100.34/67.86 YES 100.34/67.86 100.34/67.86 Ultimate: Cannot open display: 100.34/67.86 This is Ultimate 0.1.24-8dc7c08-m 100.34/67.86 [2019-03-28 12:34:45,758 INFO L170 SettingsManager]: Resetting all preferences to default values... 100.34/67.86 [2019-03-28 12:34:45,760 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 100.34/67.86 [2019-03-28 12:34:45,772 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 100.34/67.86 [2019-03-28 12:34:45,773 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 100.34/67.86 [2019-03-28 12:34:45,774 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 100.34/67.86 [2019-03-28 12:34:45,776 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 100.34/67.86 [2019-03-28 12:34:45,777 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 100.34/67.86 [2019-03-28 12:34:45,778 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 100.34/67.86 [2019-03-28 12:34:45,779 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,779 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 100.34/67.86 [2019-03-28 12:34:45,780 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 100.34/67.86 [2019-03-28 12:34:45,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 100.34/67.86 [2019-03-28 12:34:45,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 100.34/67.86 [2019-03-28 12:34:45,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 100.34/67.86 [2019-03-28 12:34:45,784 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 100.34/67.86 [2019-03-28 12:34:45,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 100.34/67.86 [2019-03-28 12:34:45,787 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 100.34/67.86 [2019-03-28 12:34:45,789 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 100.34/67.86 [2019-03-28 12:34:45,790 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 100.34/67.86 [2019-03-28 12:34:45,791 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 100.34/67.86 [2019-03-28 12:34:45,793 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,793 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,794 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 100.34/67.86 [2019-03-28 12:34:45,794 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 100.34/67.86 [2019-03-28 12:34:45,795 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 100.34/67.86 [2019-03-28 12:34:45,796 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,796 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 100.34/67.86 [2019-03-28 12:34:45,796 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 100.34/67.86 [2019-03-28 12:34:45,797 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 100.34/67.86 [2019-03-28 12:34:45,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 100.34/67.86 [2019-03-28 12:34:45,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 100.34/67.86 [2019-03-28 12:34:45,800 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,800 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 100.34/67.86 [2019-03-28 12:34:45,800 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 100.34/67.86 [2019-03-28 12:34:45,801 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 100.34/67.86 [2019-03-28 12:34:45,802 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 100.34/67.86 [2019-03-28 12:34:45,802 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 100.34/67.86 [2019-03-28 12:34:45,816 INFO L110 SettingsManager]: Loading preferences was successful 100.34/67.86 [2019-03-28 12:34:45,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 100.34/67.86 [2019-03-28 12:34:45,818 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 100.34/67.86 [2019-03-28 12:34:45,818 INFO L133 SettingsManager]: * Rewrite not-equals=true 100.34/67.86 [2019-03-28 12:34:45,818 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 100.34/67.86 [2019-03-28 12:34:45,818 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 100.34/67.86 [2019-03-28 12:34:45,819 INFO L133 SettingsManager]: * Use SBE=true 100.34/67.86 [2019-03-28 12:34:45,819 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 100.34/67.86 [2019-03-28 12:34:45,819 INFO L133 SettingsManager]: * Use old map elimination=false 100.34/67.86 [2019-03-28 12:34:45,819 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 100.34/67.86 [2019-03-28 12:34:45,819 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 100.34/67.86 [2019-03-28 12:34:45,819 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 100.34/67.86 [2019-03-28 12:34:45,820 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 100.34/67.86 [2019-03-28 12:34:45,820 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 100.34/67.86 [2019-03-28 12:34:45,820 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 100.34/67.86 [2019-03-28 12:34:45,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 100.34/67.86 [2019-03-28 12:34:45,820 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 100.34/67.86 [2019-03-28 12:34:45,820 INFO L133 SettingsManager]: * Check division by zero=IGNORE 100.34/67.86 [2019-03-28 12:34:45,821 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 100.34/67.86 [2019-03-28 12:34:45,821 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 100.34/67.86 [2019-03-28 12:34:45,821 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 100.34/67.86 [2019-03-28 12:34:45,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 100.34/67.86 [2019-03-28 12:34:45,821 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 100.34/67.86 [2019-03-28 12:34:45,822 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 100.34/67.86 [2019-03-28 12:34:45,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 100.34/67.86 [2019-03-28 12:34:45,822 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 100.34/67.86 [2019-03-28 12:34:45,822 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 100.34/67.86 [2019-03-28 12:34:45,822 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 100.34/67.86 [2019-03-28 12:34:45,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 100.34/67.86 [2019-03-28 12:34:45,848 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 100.34/67.86 [2019-03-28 12:34:45,861 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 100.34/67.86 [2019-03-28 12:34:45,865 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 100.34/67.86 [2019-03-28 12:34:45,866 INFO L271 PluginConnector]: Initializing CDTParser... 100.34/67.86 [2019-03-28 12:34:45,867 INFO L276 PluginConnector]: CDTParser initialized 100.34/67.86 [2019-03-28 12:34:45,868 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 100.34/67.86 [2019-03-28 12:34:45,927 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/80ad34df0e19461c900b55f8f2688d57/FLAG38e8de861 100.34/67.86 [2019-03-28 12:34:46,281 INFO L307 CDTParser]: Found 1 translation units. 100.34/67.86 [2019-03-28 12:34:46,282 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 100.34/67.86 [2019-03-28 12:34:46,282 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 100.34/67.86 [2019-03-28 12:34:46,289 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/80ad34df0e19461c900b55f8f2688d57/FLAG38e8de861 100.34/67.86 [2019-03-28 12:34:46,688 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/80ad34df0e19461c900b55f8f2688d57 100.34/67.86 [2019-03-28 12:34:46,700 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 100.34/67.86 [2019-03-28 12:34:46,702 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 100.34/67.86 [2019-03-28 12:34:46,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 100.34/67.86 [2019-03-28 12:34:46,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 100.34/67.86 [2019-03-28 12:34:46,707 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 100.34/67.86 [2019-03-28 12:34:46,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:46" (1/1) ... 100.34/67.86 [2019-03-28 12:34:46,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fce46c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:46, skipping insertion in model container 100.34/67.86 [2019-03-28 12:34:46,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:34:46" (1/1) ... 100.34/67.86 [2019-03-28 12:34:46,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 100.34/67.86 [2019-03-28 12:34:46,737 INFO L176 MainTranslator]: Built tables and reachable declarations 100.34/67.86 [2019-03-28 12:34:46,904 INFO L206 PostProcessor]: Analyzing one entry point: main 100.34/67.86 [2019-03-28 12:34:46,915 INFO L191 MainTranslator]: Completed pre-run 100.34/67.86 [2019-03-28 12:34:46,990 INFO L206 PostProcessor]: Analyzing one entry point: main 100.34/67.86 [2019-03-28 12:34:47,007 INFO L195 MainTranslator]: Completed translation 100.34/67.86 [2019-03-28 12:34:47,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47 WrapperNode 100.34/67.86 [2019-03-28 12:34:47,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 100.34/67.86 [2019-03-28 12:34:47,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 100.34/67.86 [2019-03-28 12:34:47,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 100.34/67.86 [2019-03-28 12:34:47,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 100.34/67.86 [2019-03-28 12:34:47,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,049 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 100.34/67.86 [2019-03-28 12:34:47,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 100.34/67.86 [2019-03-28 12:34:47,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 100.34/67.86 [2019-03-28 12:34:47,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized 100.34/67.86 [2019-03-28 12:34:47,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 100.34/67.86 [2019-03-28 12:34:47,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 100.34/67.86 [2019-03-28 12:34:47,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... 100.34/67.86 [2019-03-28 12:34:47,076 INFO L276 PluginConnector]: RCFGBuilder initialized 100.34/67.86 [2019-03-28 12:34:47,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (1/1) ... 100.34/67.86 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.86 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 100.34/67.86 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 100.34/67.86 [2019-03-28 12:34:47,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 100.34/67.86 [2019-03-28 12:34:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 100.34/67.86 [2019-03-28 12:34:47,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 100.34/67.86 [2019-03-28 12:34:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 100.34/67.86 [2019-03-28 12:34:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 100.34/67.86 [2019-03-28 12:34:47,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 100.34/67.86 [2019-03-28 12:34:47,401 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 100.34/67.86 [2019-03-28 12:34:47,402 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 100.34/67.86 [2019-03-28 12:34:47,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47 BoogieIcfgContainer 100.34/67.86 [2019-03-28 12:34:47,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 100.34/67.86 [2019-03-28 12:34:47,404 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 100.34/67.86 [2019-03-28 12:34:47,404 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 100.34/67.86 [2019-03-28 12:34:47,406 INFO L276 PluginConnector]: BlockEncodingV2 initialized 100.34/67.86 [2019-03-28 12:34:47,407 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (1/1) ... 100.34/67.86 [2019-03-28 12:34:47,426 INFO L313 BlockEncoder]: Initial Icfg 38 locations, 44 edges 100.34/67.86 [2019-03-28 12:34:47,428 INFO L258 BlockEncoder]: Using Remove infeasible edges 100.34/67.86 [2019-03-28 12:34:47,428 INFO L263 BlockEncoder]: Using Maximize final states 100.34/67.86 [2019-03-28 12:34:47,429 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 100.34/67.86 [2019-03-28 12:34:47,429 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 100.34/67.86 [2019-03-28 12:34:47,431 INFO L296 BlockEncoder]: Using Remove sink states 100.34/67.86 [2019-03-28 12:34:47,432 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 100.34/67.86 [2019-03-28 12:34:47,432 INFO L179 BlockEncoder]: Using Rewrite not-equals 100.34/67.86 [2019-03-28 12:34:47,460 INFO L185 BlockEncoder]: Using Use SBE 100.34/67.86 [2019-03-28 12:34:47,491 INFO L200 BlockEncoder]: SBE split 19 edges 100.34/67.86 [2019-03-28 12:34:47,496 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 100.34/67.86 [2019-03-28 12:34:47,498 INFO L71 MaximizeFinalStates]: 0 new accepting states 100.34/67.86 [2019-03-28 12:34:47,517 INFO L100 BaseMinimizeStates]: Removed 8 edges and 4 locations by large block encoding 100.34/67.86 [2019-03-28 12:34:47,520 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states 100.34/67.86 [2019-03-28 12:34:47,521 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 100.34/67.86 [2019-03-28 12:34:47,521 INFO L71 MaximizeFinalStates]: 0 new accepting states 100.34/67.86 [2019-03-28 12:34:47,522 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 100.34/67.86 [2019-03-28 12:34:47,522 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 100.34/67.86 [2019-03-28 12:34:47,523 INFO L313 BlockEncoder]: Encoded RCFG 31 locations, 57 edges 100.34/67.86 [2019-03-28 12:34:47,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47 BasicIcfg 100.34/67.86 [2019-03-28 12:34:47,523 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 100.34/67.86 [2019-03-28 12:34:47,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 100.34/67.86 [2019-03-28 12:34:47,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... 100.34/67.86 [2019-03-28 12:34:47,528 INFO L276 PluginConnector]: TraceAbstraction initialized 100.34/67.86 [2019-03-28 12:34:47,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:34:46" (1/4) ... 100.34/67.86 [2019-03-28 12:34:47,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168b16d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:47, skipping insertion in model container 100.34/67.87 [2019-03-28 12:34:47,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (2/4) ... 100.34/67.87 [2019-03-28 12:34:47,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168b16d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:34:47, skipping insertion in model container 100.34/67.87 [2019-03-28 12:34:47,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (3/4) ... 100.34/67.87 [2019-03-28 12:34:47,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168b16d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:34:47, skipping insertion in model container 100.34/67.87 [2019-03-28 12:34:47,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47" (4/4) ... 100.34/67.87 [2019-03-28 12:34:47,532 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 100.34/67.87 [2019-03-28 12:34:47,543 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 100.34/67.87 [2019-03-28 12:34:47,552 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. 100.34/67.87 [2019-03-28 12:34:47,569 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. 100.34/67.87 [2019-03-28 12:34:47,598 INFO L133 ementStrategyFactory]: Using default assertion order modulation 100.34/67.87 [2019-03-28 12:34:47,599 INFO L382 AbstractCegarLoop]: Interprodecural is true 100.34/67.87 [2019-03-28 12:34:47,599 INFO L383 AbstractCegarLoop]: Hoare is true 100.34/67.87 [2019-03-28 12:34:47,599 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 100.34/67.87 [2019-03-28 12:34:47,599 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 100.34/67.87 [2019-03-28 12:34:47,599 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 100.34/67.87 [2019-03-28 12:34:47,599 INFO L387 AbstractCegarLoop]: Difference is false 100.34/67.87 [2019-03-28 12:34:47,599 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 100.34/67.87 [2019-03-28 12:34:47,600 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 100.34/67.87 [2019-03-28 12:34:47,614 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. 100.34/67.87 [2019-03-28 12:34:47,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.34/67.87 [2019-03-28 12:34:47,620 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:47,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:47,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash 200279767, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:47,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:47,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:47,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:47,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:47,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:47,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:47,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.34/67.87 [2019-03-28 12:34:47,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:47,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:47,836 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:47,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:47,969 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. 100.34/67.87 [2019-03-28 12:34:47,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:47,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 100.34/67.87 [2019-03-28 12:34:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:47,985 INFO L225 Difference]: With dead ends: 31 100.34/67.87 [2019-03-28 12:34:47,985 INFO L226 Difference]: Without dead ends: 30 100.34/67.87 [2019-03-28 12:34:47,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 100.34/67.87 [2019-03-28 12:34:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 100.34/67.87 [2019-03-28 12:34:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 100.34/67.87 [2019-03-28 12:34:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 55 transitions. 100.34/67.87 [2019-03-28 12:34:48,029 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 55 transitions. Word has length 5 100.34/67.87 [2019-03-28 12:34:48,030 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,030 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 55 transitions. 100.34/67.87 [2019-03-28 12:34:48,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,031 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 55 transitions. 100.34/67.87 [2019-03-28 12:34:48,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.34/67.87 [2019-03-28 12:34:48,031 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,032 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,032 INFO L82 PathProgramCache]: Analyzing trace with hash 200279769, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:34:48,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 100.34/67.87 [2019-03-28 12:34:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 100.34/67.87 [2019-03-28 12:34:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,081 INFO L87 Difference]: Start difference. First operand 30 states and 55 transitions. Second operand 4 states. 100.34/67.87 [2019-03-28 12:34:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,165 INFO L93 Difference]: Finished difference Result 31 states and 55 transitions. 100.34/67.87 [2019-03-28 12:34:48,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 100.34/67.87 [2019-03-28 12:34:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,166 INFO L225 Difference]: With dead ends: 31 100.34/67.87 [2019-03-28 12:34:48,166 INFO L226 Difference]: Without dead ends: 30 100.34/67.87 [2019-03-28 12:34:48,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. 100.34/67.87 [2019-03-28 12:34:48,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. 100.34/67.87 [2019-03-28 12:34:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. 100.34/67.87 [2019-03-28 12:34:48,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 54 transitions. 100.34/67.87 [2019-03-28 12:34:48,172 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 54 transitions. Word has length 5 100.34/67.87 [2019-03-28 12:34:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,173 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 54 transitions. 100.34/67.87 [2019-03-28 12:34:48,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 54 transitions. 100.34/67.87 [2019-03-28 12:34:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 100.34/67.87 [2019-03-28 12:34:48,174 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,174 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,174 INFO L82 PathProgramCache]: Analyzing trace with hash 200279770, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.34/67.87 [2019-03-28 12:34:48,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:48,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,220 INFO L87 Difference]: Start difference. First operand 30 states and 54 transitions. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:48,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,312 INFO L93 Difference]: Finished difference Result 30 states and 54 transitions. 100.34/67.87 [2019-03-28 12:34:48,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 100.34/67.87 [2019-03-28 12:34:48,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,314 INFO L225 Difference]: With dead ends: 30 100.34/67.87 [2019-03-28 12:34:48,314 INFO L226 Difference]: Without dead ends: 29 100.34/67.87 [2019-03-28 12:34:48,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. 100.34/67.87 [2019-03-28 12:34:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. 100.34/67.87 [2019-03-28 12:34:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. 100.34/67.87 [2019-03-28 12:34:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 53 transitions. 100.34/67.87 [2019-03-28 12:34:48,319 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 53 transitions. Word has length 5 100.34/67.87 [2019-03-28 12:34:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,319 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 53 transitions. 100.34/67.87 [2019-03-28 12:34:48,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 53 transitions. 100.34/67.87 [2019-03-28 12:34:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 100.34/67.87 [2019-03-28 12:34:48,320 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,321 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704544, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.34/67.87 [2019-03-28 12:34:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:48,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:48,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,353 INFO L87 Difference]: Start difference. First operand 29 states and 53 transitions. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,417 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. 100.34/67.87 [2019-03-28 12:34:48,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,419 INFO L225 Difference]: With dead ends: 29 100.34/67.87 [2019-03-28 12:34:48,419 INFO L226 Difference]: Without dead ends: 28 100.34/67.87 [2019-03-28 12:34:48,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 100.34/67.87 [2019-03-28 12:34:48,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 100.34/67.87 [2019-03-28 12:34:48,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 100.34/67.87 [2019-03-28 12:34:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 51 transitions. 100.34/67.87 [2019-03-28 12:34:48,424 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 51 transitions. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,424 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 51 transitions. 100.34/67.87 [2019-03-28 12:34:48,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 51 transitions. 100.34/67.87 [2019-03-28 12:34:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 100.34/67.87 [2019-03-28 12:34:48,425 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,425 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704546, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.34/67.87 [2019-03-28 12:34:48,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:48,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,465 INFO L87 Difference]: Start difference. First operand 28 states and 51 transitions. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,555 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. 100.34/67.87 [2019-03-28 12:34:48,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,556 INFO L225 Difference]: With dead ends: 29 100.34/67.87 [2019-03-28 12:34:48,556 INFO L226 Difference]: Without dead ends: 28 100.34/67.87 [2019-03-28 12:34:48,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:48,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 100.34/67.87 [2019-03-28 12:34:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 100.34/67.87 [2019-03-28 12:34:48,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 100.34/67.87 [2019-03-28 12:34:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 50 transitions. 100.34/67.87 [2019-03-28 12:34:48,562 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 50 transitions. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,562 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 50 transitions. 100.34/67.87 [2019-03-28 12:34:48,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 50 transitions. 100.34/67.87 [2019-03-28 12:34:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 100.34/67.87 [2019-03-28 12:34:48,563 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,563 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1913704547, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:34:48,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 100.34/67.87 [2019-03-28 12:34:48,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 100.34/67.87 [2019-03-28 12:34:48,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,599 INFO L87 Difference]: Start difference. First operand 28 states and 50 transitions. Second operand 4 states. 100.34/67.87 [2019-03-28 12:34:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,670 INFO L93 Difference]: Finished difference Result 28 states and 50 transitions. 100.34/67.87 [2019-03-28 12:34:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,671 INFO L225 Difference]: With dead ends: 28 100.34/67.87 [2019-03-28 12:34:48,671 INFO L226 Difference]: Without dead ends: 27 100.34/67.87 [2019-03-28 12:34:48,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. 100.34/67.87 [2019-03-28 12:34:48,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. 100.34/67.87 [2019-03-28 12:34:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. 100.34/67.87 [2019-03-28 12:34:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. 100.34/67.87 [2019-03-28 12:34:48,677 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 49 transitions. Word has length 6 100.34/67.87 [2019-03-28 12:34:48,677 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,677 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 49 transitions. 100.34/67.87 [2019-03-28 12:34:48,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,677 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 49 transitions. 100.34/67.87 [2019-03-28 12:34:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 100.34/67.87 [2019-03-28 12:34:48,678 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,678 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash -804700043, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:34:48,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 100.34/67.87 [2019-03-28 12:34:48,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 100.34/67.87 [2019-03-28 12:34:48,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,727 INFO L87 Difference]: Start difference. First operand 27 states and 49 transitions. Second operand 4 states. 100.34/67.87 [2019-03-28 12:34:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,812 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. 100.34/67.87 [2019-03-28 12:34:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 100.34/67.87 [2019-03-28 12:34:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,813 INFO L225 Difference]: With dead ends: 27 100.34/67.87 [2019-03-28 12:34:48,813 INFO L226 Difference]: Without dead ends: 25 100.34/67.87 [2019-03-28 12:34:48,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 100.34/67.87 [2019-03-28 12:34:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. 100.34/67.87 [2019-03-28 12:34:48,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. 100.34/67.87 [2019-03-28 12:34:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. 100.34/67.87 [2019-03-28 12:34:48,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 45 transitions. 100.34/67.87 [2019-03-28 12:34:48,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 45 transitions. Word has length 7 100.34/67.87 [2019-03-28 12:34:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,818 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 45 transitions. 100.34/67.87 [2019-03-28 12:34:48,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 45 transitions. 100.34/67.87 [2019-03-28 12:34:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 100.34/67.87 [2019-03-28 12:34:48,818 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,819 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash -804700041, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:48,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:48,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:34:48,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states 100.34/67.87 [2019-03-28 12:34:48,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. 100.34/67.87 [2019-03-28 12:34:48,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 100.34/67.87 [2019-03-28 12:34:48,858 INFO L87 Difference]: Start difference. First operand 25 states and 45 transitions. Second operand 4 states. 100.34/67.87 [2019-03-28 12:34:48,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:48,957 INFO L93 Difference]: Finished difference Result 46 states and 79 transitions. 100.34/67.87 [2019-03-28 12:34:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 100.34/67.87 [2019-03-28 12:34:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:48,982 INFO L225 Difference]: With dead ends: 46 100.34/67.87 [2019-03-28 12:34:48,982 INFO L226 Difference]: Without dead ends: 44 100.34/67.87 [2019-03-28 12:34:48,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 100.34/67.87 [2019-03-28 12:34:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 100.34/67.87 [2019-03-28 12:34:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. 100.34/67.87 [2019-03-28 12:34:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 100.34/67.87 [2019-03-28 12:34:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:48,989 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 7 100.34/67.87 [2019-03-28 12:34:48,989 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:48,989 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:48,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. 100.34/67.87 [2019-03-28 12:34:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 100.34/67.87 [2019-03-28 12:34:48,990 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:48,990 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:48,990 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:48,991 INFO L82 PathProgramCache]: Analyzing trace with hash -804700040, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:48,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:48,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:48,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:49,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 100.34/67.87 [2019-03-28 12:34:49,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 100.34/67.87 [2019-03-28 12:34:49,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 100.34/67.87 [2019-03-28 12:34:49,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 100.34/67.87 [2019-03-28 12:34:49,058 INFO L87 Difference]: Start difference. First operand 35 states and 73 transitions. Second operand 6 states. 100.34/67.87 [2019-03-28 12:34:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:49,190 INFO L93 Difference]: Finished difference Result 44 states and 77 transitions. 100.34/67.87 [2019-03-28 12:34:49,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 100.34/67.87 [2019-03-28 12:34:49,191 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 100.34/67.87 [2019-03-28 12:34:49,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:49,192 INFO L225 Difference]: With dead ends: 44 100.34/67.87 [2019-03-28 12:34:49,192 INFO L226 Difference]: Without dead ends: 42 100.34/67.87 [2019-03-28 12:34:49,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 100.34/67.87 [2019-03-28 12:34:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. 100.34/67.87 [2019-03-28 12:34:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. 100.34/67.87 [2019-03-28 12:34:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 100.34/67.87 [2019-03-28 12:34:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,198 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 71 transitions. Word has length 7 100.34/67.87 [2019-03-28 12:34:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:49,198 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 100.34/67.87 [2019-03-28 12:34:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 100.34/67.87 [2019-03-28 12:34:49,199 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:49,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:49,199 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:49,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1686893786, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:49,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:49,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:49,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:34:49,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:49,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:49,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:49,236 INFO L87 Difference]: Start difference. First operand 35 states and 71 transitions. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:49,295 INFO L93 Difference]: Finished difference Result 68 states and 139 transitions. 100.34/67.87 [2019-03-28 12:34:49,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:49,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:49,297 INFO L225 Difference]: With dead ends: 68 100.34/67.87 [2019-03-28 12:34:49,297 INFO L226 Difference]: Without dead ends: 39 100.34/67.87 [2019-03-28 12:34:49,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. 100.34/67.87 [2019-03-28 12:34:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. 100.34/67.87 [2019-03-28 12:34:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. 100.34/67.87 [2019-03-28 12:34:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,302 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 73 transitions. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,302 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:49,303 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 100.34/67.87 [2019-03-28 12:34:49,303 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:49,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:49,304 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:49,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:49,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1686894747, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:49,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:49,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:49,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 100.34/67.87 [2019-03-28 12:34:49,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 100.34/67.87 [2019-03-28 12:34:49,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:34:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:49,335 INFO L87 Difference]: Start difference. First operand 37 states and 73 transitions. Second operand 3 states. 100.34/67.87 [2019-03-28 12:34:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:49,397 INFO L93 Difference]: Finished difference Result 37 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:49,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:49,399 INFO L225 Difference]: With dead ends: 37 100.34/67.87 [2019-03-28 12:34:49,399 INFO L226 Difference]: Without dead ends: 34 100.34/67.87 [2019-03-28 12:34:49,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:34:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. 100.34/67.87 [2019-03-28 12:34:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. 100.34/67.87 [2019-03-28 12:34:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. 100.34/67.87 [2019-03-28 12:34:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. 100.34/67.87 [2019-03-28 12:34:49,404 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 63 transitions. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:49,404 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 63 transitions. 100.34/67.87 [2019-03-28 12:34:49,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:34:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 63 transitions. 100.34/67.87 [2019-03-28 12:34:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 100.34/67.87 [2019-03-28 12:34:49,405 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:49,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:49,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1686894749, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:49,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:49,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:49,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 100.34/67.87 [2019-03-28 12:34:49,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states 100.34/67.87 [2019-03-28 12:34:49,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. 100.34/67.87 [2019-03-28 12:34:49,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 100.34/67.87 [2019-03-28 12:34:49,468 INFO L87 Difference]: Start difference. First operand 34 states and 63 transitions. Second operand 5 states. 100.34/67.87 [2019-03-28 12:34:49,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:49,553 INFO L93 Difference]: Finished difference Result 51 states and 90 transitions. 100.34/67.87 [2019-03-28 12:34:49,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 100.34/67.87 [2019-03-28 12:34:49,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:49,554 INFO L225 Difference]: With dead ends: 51 100.34/67.87 [2019-03-28 12:34:49,554 INFO L226 Difference]: Without dead ends: 45 100.34/67.87 [2019-03-28 12:34:49,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 100.34/67.87 [2019-03-28 12:34:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. 100.34/67.87 [2019-03-28 12:34:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. 100.34/67.87 [2019-03-28 12:34:49,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 100.34/67.87 [2019-03-28 12:34:49,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 10 100.34/67.87 [2019-03-28 12:34:49,559 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:49,560 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. 100.34/67.87 [2019-03-28 12:34:49,560 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. 100.34/67.87 [2019-03-28 12:34:49,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 100.34/67.87 [2019-03-28 12:34:49,560 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:49,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:49,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:49,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348888, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:49,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:49,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:49,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:34:49,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:34:49,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:49,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:34:49,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:34:49,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:49,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 100.34/67.87 [2019-03-28 12:34:49,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 100.34/67.87 [2019-03-28 12:34:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 100.34/67.87 [2019-03-28 12:34:49,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 100.34/67.87 [2019-03-28 12:34:49,706 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 6 states. 100.34/67.87 [2019-03-28 12:34:49,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:49,810 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. 100.34/67.87 [2019-03-28 12:34:49,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 100.34/67.87 [2019-03-28 12:34:49,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 100.34/67.87 [2019-03-28 12:34:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:49,811 INFO L225 Difference]: With dead ends: 50 100.34/67.87 [2019-03-28 12:34:49,811 INFO L226 Difference]: Without dead ends: 48 100.34/67.87 [2019-03-28 12:34:49,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 100.34/67.87 [2019-03-28 12:34:49,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 100.34/67.87 [2019-03-28 12:34:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. 100.34/67.87 [2019-03-28 12:34:49,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 100.34/67.87 [2019-03-28 12:34:49,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,817 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 71 transitions. Word has length 17 100.34/67.87 [2019-03-28 12:34:49,817 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:49,817 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 100.34/67.87 [2019-03-28 12:34:49,817 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 71 transitions. 100.34/67.87 [2019-03-28 12:34:49,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 100.34/67.87 [2019-03-28 12:34:49,818 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:49,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:49,818 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:49,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1690348887, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:49,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:49,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:50,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:50,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 100.34/67.87 [2019-03-28 12:34:50,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states 100.34/67.87 [2019-03-28 12:34:50,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. 100.34/67.87 [2019-03-28 12:34:50,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 100.34/67.87 [2019-03-28 12:34:50,030 INFO L87 Difference]: Start difference. First operand 42 states and 71 transitions. Second operand 12 states. 100.34/67.87 [2019-03-28 12:34:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:50,332 INFO L93 Difference]: Finished difference Result 86 states and 145 transitions. 100.34/67.87 [2019-03-28 12:34:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 100.34/67.87 [2019-03-28 12:34:50,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 100.34/67.87 [2019-03-28 12:34:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:50,334 INFO L225 Difference]: With dead ends: 86 100.34/67.87 [2019-03-28 12:34:50,334 INFO L226 Difference]: Without dead ends: 46 100.34/67.87 [2019-03-28 12:34:50,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 100.34/67.87 [2019-03-28 12:34:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. 100.34/67.87 [2019-03-28 12:34:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. 100.34/67.87 [2019-03-28 12:34:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. 100.34/67.87 [2019-03-28 12:34:50,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 70 transitions. 100.34/67.87 [2019-03-28 12:34:50,339 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 70 transitions. Word has length 17 100.34/67.87 [2019-03-28 12:34:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:50,340 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 70 transitions. 100.34/67.87 [2019-03-28 12:34:50,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. 100.34/67.87 [2019-03-28 12:34:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 70 transitions. 100.34/67.87 [2019-03-28 12:34:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 100.34/67.87 [2019-03-28 12:34:50,340 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:50,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:50,341 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1583550055, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:50,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:50,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:50,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:50,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:50,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:34:50,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:34:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:50,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 19 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:34:50,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:34:50,689 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 100.34/67.87 [2019-03-28 12:34:50,690 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:50,693 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:34:50,693 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:50,694 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 100.34/67.87 [2019-03-28 12:34:50,716 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 100.34/67.87 [2019-03-28 12:34:50,717 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:50,719 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:34:50,719 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:50,719 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 100.34/67.87 [2019-03-28 12:34:50,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 100.34/67.87 [2019-03-28 12:34:50,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 100.34/67.87 [2019-03-28 12:34:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 100.34/67.87 [2019-03-28 12:34:50,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 100.34/67.87 [2019-03-28 12:34:50,768 INFO L87 Difference]: Start difference. First operand 42 states and 70 transitions. Second operand 16 states. 100.34/67.87 [2019-03-28 12:34:51,518 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 100.34/67.87 [2019-03-28 12:34:51,755 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 100.34/67.87 [2019-03-28 12:34:52,790 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 100.34/67.87 [2019-03-28 12:34:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:53,406 INFO L93 Difference]: Finished difference Result 147 states and 232 transitions. 100.34/67.87 [2019-03-28 12:34:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 100.34/67.87 [2019-03-28 12:34:53,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 100.34/67.87 [2019-03-28 12:34:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:53,408 INFO L225 Difference]: With dead ends: 147 100.34/67.87 [2019-03-28 12:34:53,408 INFO L226 Difference]: Without dead ends: 116 100.34/67.87 [2019-03-28 12:34:53,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=539, Invalid=1353, Unknown=0, NotChecked=0, Total=1892 100.34/67.87 [2019-03-28 12:34:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. 100.34/67.87 [2019-03-28 12:34:53,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 51. 100.34/67.87 [2019-03-28 12:34:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. 100.34/67.87 [2019-03-28 12:34:53,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. 100.34/67.87 [2019-03-28 12:34:53,416 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 17 100.34/67.87 [2019-03-28 12:34:53,417 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:53,417 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. 100.34/67.87 [2019-03-28 12:34:53,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 100.34/67.87 [2019-03-28 12:34:53,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. 100.34/67.87 [2019-03-28 12:34:53,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 100.34/67.87 [2019-03-28 12:34:53,418 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:53,418 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:53,418 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:53,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:53,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1510663876, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:53,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:53,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:53,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:53,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:53,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 100.34/67.87 [2019-03-28 12:34:53,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states 100.34/67.87 [2019-03-28 12:34:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. 100.34/67.87 [2019-03-28 12:34:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 100.34/67.87 [2019-03-28 12:34:53,487 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand 8 states. 100.34/67.87 [2019-03-28 12:34:53,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:53,728 INFO L93 Difference]: Finished difference Result 131 states and 217 transitions. 100.34/67.87 [2019-03-28 12:34:53,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 100.34/67.87 [2019-03-28 12:34:53,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 100.34/67.87 [2019-03-28 12:34:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:53,730 INFO L225 Difference]: With dead ends: 131 100.34/67.87 [2019-03-28 12:34:53,730 INFO L226 Difference]: Without dead ends: 102 100.34/67.87 [2019-03-28 12:34:53,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 100.34/67.87 [2019-03-28 12:34:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. 100.34/67.87 [2019-03-28 12:34:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 91. 100.34/67.87 [2019-03-28 12:34:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. 100.34/67.87 [2019-03-28 12:34:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 150 transitions. 100.34/67.87 [2019-03-28 12:34:53,739 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 150 transitions. Word has length 20 100.34/67.87 [2019-03-28 12:34:53,739 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:53,739 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 150 transitions. 100.34/67.87 [2019-03-28 12:34:53,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. 100.34/67.87 [2019-03-28 12:34:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 150 transitions. 100.34/67.87 [2019-03-28 12:34:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 100.34/67.87 [2019-03-28 12:34:53,740 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:53,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:53,741 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1539293027, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:53,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:53,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:53,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:53,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 100.34/67.87 [2019-03-28 12:34:53,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 100.34/67.87 [2019-03-28 12:34:53,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 100.34/67.87 [2019-03-28 12:34:53,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 100.34/67.87 [2019-03-28 12:34:53,808 INFO L87 Difference]: Start difference. First operand 91 states and 150 transitions. Second operand 6 states. 100.34/67.87 [2019-03-28 12:34:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:53,926 INFO L93 Difference]: Finished difference Result 155 states and 262 transitions. 100.34/67.87 [2019-03-28 12:34:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 100.34/67.87 [2019-03-28 12:34:53,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 100.34/67.87 [2019-03-28 12:34:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:53,928 INFO L225 Difference]: With dead ends: 155 100.34/67.87 [2019-03-28 12:34:53,928 INFO L226 Difference]: Without dead ends: 81 100.34/67.87 [2019-03-28 12:34:53,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 100.34/67.87 [2019-03-28 12:34:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. 100.34/67.87 [2019-03-28 12:34:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. 100.34/67.87 [2019-03-28 12:34:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. 100.34/67.87 [2019-03-28 12:34:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 134 transitions. 100.34/67.87 [2019-03-28 12:34:53,935 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 134 transitions. Word has length 20 100.34/67.87 [2019-03-28 12:34:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:53,935 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 134 transitions. 100.34/67.87 [2019-03-28 12:34:53,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 100.34/67.87 [2019-03-28 12:34:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 134 transitions. 100.34/67.87 [2019-03-28 12:34:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 100.34/67.87 [2019-03-28 12:34:53,936 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:53,937 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:53,937 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -824761312, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:53,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:53,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:34:54,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:34:54,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:54,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 25 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:34:54,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:34:54,138 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:34:54,139 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 100.34/67.87 [2019-03-28 12:34:54,139 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,157 INFO L497 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size 100.34/67.87 [2019-03-28 12:34:54,158 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,158 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:12 100.34/67.87 [2019-03-28 12:34:54,176 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 100.34/67.87 [2019-03-28 12:34:54,177 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,184 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:34:54,185 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,185 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 100.34/67.87 [2019-03-28 12:34:54,333 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:34:54,334 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 100.34/67.87 [2019-03-28 12:34:54,354 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,446 INFO L497 ElimStorePlain]: treesize reduction 8, result has 91.8 percent of original size 100.34/67.87 [2019-03-28 12:34:54,449 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:34:54,449 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:89 100.34/67.87 [2019-03-28 12:34:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:54,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:54,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 100.34/67.87 [2019-03-28 12:34:54,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 100.34/67.87 [2019-03-28 12:34:54,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 100.34/67.87 [2019-03-28 12:34:54,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 100.34/67.87 [2019-03-28 12:34:54,641 INFO L87 Difference]: Start difference. First operand 80 states and 134 transitions. Second operand 16 states. 100.34/67.87 [2019-03-28 12:34:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:59,606 INFO L93 Difference]: Finished difference Result 146 states and 249 transitions. 100.34/67.87 [2019-03-28 12:34:59,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 100.34/67.87 [2019-03-28 12:34:59,607 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 100.34/67.87 [2019-03-28 12:34:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:59,608 INFO L225 Difference]: With dead ends: 146 100.34/67.87 [2019-03-28 12:34:59,608 INFO L226 Difference]: Without dead ends: 143 100.34/67.87 [2019-03-28 12:34:59,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=300, Invalid=691, Unknown=1, NotChecked=0, Total=992 100.34/67.87 [2019-03-28 12:34:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. 100.34/67.87 [2019-03-28 12:34:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 103. 100.34/67.87 [2019-03-28 12:34:59,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. 100.34/67.87 [2019-03-28 12:34:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 167 transitions. 100.34/67.87 [2019-03-28 12:34:59,617 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 167 transitions. Word has length 20 100.34/67.87 [2019-03-28 12:34:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:59,618 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 167 transitions. 100.34/67.87 [2019-03-28 12:34:59,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 100.34/67.87 [2019-03-28 12:34:59,618 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 167 transitions. 100.34/67.87 [2019-03-28 12:34:59,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 100.34/67.87 [2019-03-28 12:34:59,619 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:59,619 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:59,619 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:59,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:59,620 INFO L82 PathProgramCache]: Analyzing trace with hash -824761311, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:59,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:59,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:59,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:34:59,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:34:59,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:34:59,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:34:59,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:34:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:34:59,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:34:59,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 100.34/67.87 [2019-03-28 12:34:59,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states 100.34/67.87 [2019-03-28 12:34:59,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. 100.34/67.87 [2019-03-28 12:34:59,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 100.34/67.87 [2019-03-28 12:34:59,749 INFO L87 Difference]: Start difference. First operand 103 states and 167 transitions. Second operand 6 states. 100.34/67.87 [2019-03-28 12:34:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:34:59,855 INFO L93 Difference]: Finished difference Result 105 states and 167 transitions. 100.34/67.87 [2019-03-28 12:34:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 100.34/67.87 [2019-03-28 12:34:59,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 100.34/67.87 [2019-03-28 12:34:59,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:34:59,856 INFO L225 Difference]: With dead ends: 105 100.34/67.87 [2019-03-28 12:34:59,856 INFO L226 Difference]: Without dead ends: 99 100.34/67.87 [2019-03-28 12:34:59,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 100.34/67.87 [2019-03-28 12:34:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. 100.34/67.87 [2019-03-28 12:34:59,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. 100.34/67.87 [2019-03-28 12:34:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. 100.34/67.87 [2019-03-28 12:34:59,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. 100.34/67.87 [2019-03-28 12:34:59,864 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 20 100.34/67.87 [2019-03-28 12:34:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:34:59,864 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. 100.34/67.87 [2019-03-28 12:34:59,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. 100.34/67.87 [2019-03-28 12:34:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. 100.34/67.87 [2019-03-28 12:34:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 100.34/67.87 [2019-03-28 12:34:59,866 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:34:59,866 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:34:59,866 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:34:59,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:34:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 234545917, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:34:59,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:34:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:34:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:34:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:00,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:35:00,341 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:35:00,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:00,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 37 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:00,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:00,399 INFO L189 IndexEqualityManager]: detected not equals via solver 100.34/67.87 [2019-03-28 12:35:00,401 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 100.34/67.87 [2019-03-28 12:35:00,401 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,410 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:00,418 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 100.34/67.87 [2019-03-28 12:35:00,418 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,427 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:00,427 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,427 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 100.34/67.87 [2019-03-28 12:35:00,462 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 100.34/67.87 [2019-03-28 12:35:00,462 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,470 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:00,470 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,470 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 100.34/67.87 [2019-03-28 12:35:00,506 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 100.34/67.87 [2019-03-28 12:35:00,507 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,516 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:00,517 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,517 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 100.34/67.87 [2019-03-28 12:35:00,838 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:00,839 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 100.34/67.87 [2019-03-28 12:35:00,840 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,921 INFO L497 ElimStorePlain]: treesize reduction 8, result has 88.9 percent of original size 100.34/67.87 [2019-03-28 12:35:00,923 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:00,924 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:64 100.34/67.87 [2019-03-28 12:35:05,994 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 40 100.34/67.87 [2019-03-28 12:35:06,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:06,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:35:06,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 100.34/67.87 [2019-03-28 12:35:06,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states 100.34/67.87 [2019-03-28 12:35:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. 100.34/67.87 [2019-03-28 12:35:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 100.34/67.87 [2019-03-28 12:35:06,055 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand 21 states. 100.34/67.87 [2019-03-28 12:35:07,766 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 100.34/67.87 [2019-03-28 12:35:07,997 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 100.34/67.87 [2019-03-28 12:35:14,104 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 55 100.34/67.87 [2019-03-28 12:35:35,377 WARN L188 SmtUtils]: Spent 5.11 s on a formula simplification. DAG size of input: 83 DAG size of output: 50 100.34/67.87 [2019-03-28 12:35:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:35:35,545 INFO L93 Difference]: Finished difference Result 224 states and 287 transitions. 100.34/67.87 [2019-03-28 12:35:35,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 100.34/67.87 [2019-03-28 12:35:35,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 100.34/67.87 [2019-03-28 12:35:35,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:35:35,547 INFO L225 Difference]: With dead ends: 224 100.34/67.87 [2019-03-28 12:35:35,547 INFO L226 Difference]: Without dead ends: 223 100.34/67.87 [2019-03-28 12:35:35,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=890, Invalid=2412, Unknown=4, NotChecked=0, Total=3306 100.34/67.87 [2019-03-28 12:35:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. 100.34/67.87 [2019-03-28 12:35:35,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 113. 100.34/67.87 [2019-03-28 12:35:35,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. 100.34/67.87 [2019-03-28 12:35:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. 100.34/67.87 [2019-03-28 12:35:35,558 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 27 100.34/67.87 [2019-03-28 12:35:35,558 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:35:35,558 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. 100.34/67.87 [2019-03-28 12:35:35,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. 100.34/67.87 [2019-03-28 12:35:35,558 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. 100.34/67.87 [2019-03-28 12:35:35,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 100.34/67.87 [2019-03-28 12:35:35,559 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:35:35,559 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:35,560 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:35:35,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:35,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1375365658, now seen corresponding path program 2 times 100.34/67.87 [2019-03-28 12:35:35,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:35,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:35,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:35,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:35,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:35,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:35:35,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:35:35,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 100.34/67.87 [2019-03-28 12:35:35,783 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) 100.34/67.87 [2019-03-28 12:35:35,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:35,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:35,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:35,811 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:35,812 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 100.34/67.87 [2019-03-28 12:35:35,812 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:35,833 INFO L497 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size 100.34/67.87 [2019-03-28 12:35:35,833 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:35,833 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:13, output treesize:9 100.34/67.87 [2019-03-28 12:35:35,853 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 100.34/67.87 [2019-03-28 12:35:35,853 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:35,856 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:35,856 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:35,856 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 100.34/67.87 [2019-03-28 12:35:36,053 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:36,054 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 100.34/67.87 [2019-03-28 12:35:36,060 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 100.34/67.87 [2019-03-28 12:35:36,097 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:36,099 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:36,099 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:69 100.34/67.87 [2019-03-28 12:35:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:39,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:35:39,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 100.34/67.87 [2019-03-28 12:35:39,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states 100.34/67.87 [2019-03-28 12:35:39,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. 100.34/67.87 [2019-03-28 12:35:39,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=187, Unknown=1, NotChecked=0, Total=240 100.34/67.87 [2019-03-28 12:35:39,228 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand 16 states. 100.34/67.87 [2019-03-28 12:35:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:35:44,566 INFO L93 Difference]: Finished difference Result 199 states and 282 transitions. 100.34/67.87 [2019-03-28 12:35:44,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 100.34/67.87 [2019-03-28 12:35:44,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 100.34/67.87 [2019-03-28 12:35:44,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:35:44,568 INFO L225 Difference]: With dead ends: 199 100.34/67.87 [2019-03-28 12:35:44,568 INFO L226 Difference]: Without dead ends: 191 100.34/67.87 [2019-03-28 12:35:44,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=410, Invalid=921, Unknown=1, NotChecked=0, Total=1332 100.34/67.87 [2019-03-28 12:35:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. 100.34/67.87 [2019-03-28 12:35:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 71. 100.34/67.87 [2019-03-28 12:35:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. 100.34/67.87 [2019-03-28 12:35:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. 100.34/67.87 [2019-03-28 12:35:44,576 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 30 100.34/67.87 [2019-03-28 12:35:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:35:44,576 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. 100.34/67.87 [2019-03-28 12:35:44,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. 100.34/67.87 [2019-03-28 12:35:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. 100.34/67.87 [2019-03-28 12:35:44,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 100.34/67.87 [2019-03-28 12:35:44,577 INFO L394 BasicCegarLoop]: Found error trace 100.34/67.87 [2019-03-28 12:35:44,577 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:44,578 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== 100.34/67.87 [2019-03-28 12:35:44,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:44,578 INFO L82 PathProgramCache]: Analyzing trace with hash 487522126, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:35:44,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:44,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:44,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:44,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:44,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:44,859 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:44,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. 100.34/67.87 [2019-03-28 12:35:44,859 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 100.34/67.87 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 100.34/67.87 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) 100.34/67.87 Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 100.34/67.87 [2019-03-28 12:35:44,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:44,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:44,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:44,910 INFO L189 IndexEqualityManager]: detected not equals via solver 100.34/67.87 [2019-03-28 12:35:44,911 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 100.34/67.87 [2019-03-28 12:35:44,911 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:44,920 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:44,925 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 100.34/67.87 [2019-03-28 12:35:44,926 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:44,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:44,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:44,934 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 100.34/67.87 [2019-03-28 12:35:44,962 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 100.34/67.87 [2019-03-28 12:35:44,962 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:44,969 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:44,970 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:44,970 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 100.34/67.87 [2019-03-28 12:35:44,999 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 100.34/67.87 [2019-03-28 12:35:45,000 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:45,006 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:45,006 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:45,007 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 100.34/67.87 [2019-03-28 12:35:45,060 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:45,060 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 100.34/67.87 [2019-03-28 12:35:45,061 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. 100.34/67.87 [2019-03-28 12:35:45,070 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 100.34/67.87 [2019-03-28 12:35:45,070 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 100.34/67.87 [2019-03-28 12:35:45,070 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 100.34/67.87 [2019-03-28 12:35:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:35:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 100.34/67.87 [2019-03-28 12:35:45,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states 100.34/67.87 [2019-03-28 12:35:45,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. 100.34/67.87 [2019-03-28 12:35:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 100.34/67.87 [2019-03-28 12:35:45,172 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 18 states. 100.34/67.87 [2019-03-28 12:35:45,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:35:45,527 INFO L93 Difference]: Finished difference Result 79 states and 105 transitions. 100.34/67.87 [2019-03-28 12:35:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 100.34/67.87 [2019-03-28 12:35:45,529 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 100.34/67.87 [2019-03-28 12:35:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 100.34/67.87 [2019-03-28 12:35:45,529 INFO L225 Difference]: With dead ends: 79 100.34/67.87 [2019-03-28 12:35:45,529 INFO L226 Difference]: Without dead ends: 0 100.34/67.87 [2019-03-28 12:35:45,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 100.34/67.87 [2019-03-28 12:35:45,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 100.34/67.87 [2019-03-28 12:35:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 100.34/67.87 [2019-03-28 12:35:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. 100.34/67.87 [2019-03-28 12:35:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:45,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 100.34/67.87 [2019-03-28 12:35:45,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:45,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 100.34/67.87 [2019-03-28 12:35:45,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. 100.34/67.87 [2019-03-28 12:35:45,793 WARN L188 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 203 100.34/67.87 [2019-03-28 12:35:47,951 WARN L188 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 201 DAG size of output: 104 100.34/67.87 [2019-03-28 12:35:47,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,955 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,956 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point L25-1(lines 25 27) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point L9-2(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point L9-3(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point L9-4(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,957 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 31) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,958 INFO L448 ceAbstractionStarter]: For program point L9-6(lines 9 14) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,958 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,958 INFO L444 ceAbstractionStarter]: At program point L9-8(lines 9 14) the Hoare annotation is: (let ((.cse25 (select |#memory_int| ULTIMATE.start_subseq_~pt~0.base)) (.cse26 (select |#length| ULTIMATE.start_subseq_~pt~0.base)) (.cse24 (select |#length| ULTIMATE.start_main_~nondetString1~0.base)) (.cse27 (select |#memory_int| ULTIMATE.start_subseq_~ps~0.base)) (.cse21 (select |#length| ULTIMATE.start_subseq_~ps~0.base))) (let ((.cse2 (= (select .cse27 (+ .cse21 (- 1))) 0)) (.cse3 (exists ((ULTIMATE.start_main_~nondetString2~0.base Int) (ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (not (= ULTIMATE.start_main_~nondetString2~0.base ULTIMATE.start_subseq_~ps~0.base))))) (.cse19 (= (select (select |#memory_int| ULTIMATE.start_main_~nondetString1~0.base) (+ .cse24 (- 1))) 0)) (.cse4 (<= (+ ULTIMATE.start_subseq_~pt~0.offset 1) .cse26)) (.cse5 (<= 1 ULTIMATE.start_subseq_~pt~0.offset)) (.cse16 (= (select .cse25 (+ .cse26 (- 1))) 0)) (.cse15 (<= 1 ULTIMATE.start_main_~length2~0)) (.cse17 (= 0 ULTIMATE.start_subseq_~pt~0.offset)) (.cse7 (= 1 (select |#valid| ULTIMATE.start_subseq_~ps~0.base))) (.cse8 (= ULTIMATE.start_main_~length1~0 .cse24)) (.cse9 (= 1 (select |#valid| ULTIMATE.start_subseq_~pt~0.base))) (.cse20 (= (select |#length| ULTIMATE.start_main_~nondetString2~0.base) ULTIMATE.start_main_~length2~0)) (.cse10 (= ULTIMATE.start_subseq_~ps~0.offset 0)) (.cse23 (= 0 (select .cse27 ULTIMATE.start_subseq_~ps~0.offset))) (.cse1 (not (= ULTIMATE.start_main_~nondetString1~0.base ULTIMATE.start_main_~nondetString2~0.base))) (.cse22 (= 0 (select (select (store |#memory_int| ULTIMATE.start_main_~nondetString2~0.base (store (select |#memory_int| ULTIMATE.start_main_~nondetString2~0.base) (+ ULTIMATE.start_main_~length2~0 ULTIMATE.start_main_~nondetString2~0.offset (- 1)) 0)) ULTIMATE.start_main_~nondetString1~0.base) ULTIMATE.start_main_~nondetString1~0.offset))) (.cse11 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString1~0.base))) (.cse12 (<= (+ ULTIMATE.start_main_~nondetString1~0.offset 1) .cse24)) (.cse0 (= ULTIMATE.start_main_~nondetString1~0.offset 0)) (.cse6 (= ULTIMATE.start_main_~nondetString2~0.offset 0)) (.cse18 (<= 1 .cse26)) (.cse13 (<= 1 .cse21)) (.cse14 (= 1 (select |#valid| ULTIMATE.start_main_~nondetString2~0.base)))) (or (and .cse0 .cse1 .cse2 .cse3 (or (and .cse4 (and .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) .cse16) (and .cse17 .cse7 .cse8 .cse9 .cse10 .cse15 (exists ((ULTIMATE.start_main_~nondetString2~0.offset Int)) (and (= 0 (select (select |#memory_int| ULTIMATE.start_subseq_~pt~0.base) (+ (select |#length| ULTIMATE.start_subseq_~pt~0.base) ULTIMATE.start_main_~nondetString2~0.offset (- 1)))) (<= ULTIMATE.start_main_~nondetString2~0.offset 0) (<= ULTIMATE.start_subseq_~pt~0.offset ULTIMATE.start_main_~nondetString2~0.offset))) .cse11 .cse12 .cse6 .cse18 .cse13 .cse14)) .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse19 (and .cse4 .cse5 (and (<= 1 ULTIMATE.start_subseq_~ps~0.offset) .cse7 .cse8 .cse9 .cse20 (<= (+ ULTIMATE.start_subseq_~ps~0.offset 1) .cse21) .cse15 .cse11 .cse12 .cse0 .cse6 .cse14) .cse16)) (and .cse17 .cse7 .cse8 .cse1 .cse9 .cse22 .cse20 .cse10 .cse15 .cse23 (= 1 ULTIMATE.start_main_~length1~0) .cse11 .cse0 .cse6 .cse18 .cse13 .cse14) (and .cse17 .cse7 .cse8 .cse9 .cse20 .cse10 (or (<= 2 .cse21) .cse23) (or (<= 2 .cse24) (and .cse1 .cse22)) (= ULTIMATE.start_main_~length2~0 1) .cse11 .cse12 .cse0 .cse6 (= (select .cse25 ULTIMATE.start_subseq_~pt~0.offset) 0) .cse18 .cse13 .cse14)))) 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L9-9(lines 9 14) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L22-2(lines 19 33) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,959 INFO L448 ceAbstractionStarter]: For program point L10-2(lines 10 12) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,960 INFO L448 ceAbstractionStarter]: For program point L10-4(lines 10 12) no Hoare annotation was computed. 100.34/67.87 [2019-03-28 12:35:47,960 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 100.34/67.87 [2019-03-28 12:35:47,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,973 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,974 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:47,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,983 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,984 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,985 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,986 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,987 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,988 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,989 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,990 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,991 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,992 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,993 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,994 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,996 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:47,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:47,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,008 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,012 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 [2019-03-28 12:35:48,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,017 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,018 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,019 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,020 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,021 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,022 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,023 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,024 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,025 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,026 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,027 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.87 [2019-03-28 12:35:48,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,029 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:48,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:48 BasicIcfg 100.34/67.87 [2019-03-28 12:35:48,032 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 100.34/67.87 [2019-03-28 12:35:48,033 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 100.34/67.87 [2019-03-28 12:35:48,033 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 100.34/67.87 [2019-03-28 12:35:48,036 INFO L276 PluginConnector]: BuchiAutomizer initialized 100.34/67.87 [2019-03-28 12:35:48,037 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.34/67.87 [2019-03-28 12:35:48,037 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:34:46" (1/5) ... 100.34/67.87 [2019-03-28 12:35:48,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6d7e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:35:48, skipping insertion in model container 100.34/67.87 [2019-03-28 12:35:48,038 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.34/67.87 [2019-03-28 12:35:48,038 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:34:47" (2/5) ... 100.34/67.87 [2019-03-28 12:35:48,038 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6d7e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:35:48, skipping insertion in model container 100.34/67.87 [2019-03-28 12:35:48,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.34/67.87 [2019-03-28 12:35:48,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:34:47" (3/5) ... 100.34/67.87 [2019-03-28 12:35:48,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6d7e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:48, skipping insertion in model container 100.34/67.87 [2019-03-28 12:35:48,039 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.34/67.87 [2019-03-28 12:35:48,039 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:34:47" (4/5) ... 100.34/67.87 [2019-03-28 12:35:48,039 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3d6d7e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:48, skipping insertion in model container 100.34/67.87 [2019-03-28 12:35:48,040 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 100.34/67.87 [2019-03-28 12:35:48,040 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:35:48" (5/5) ... 100.34/67.87 [2019-03-28 12:35:48,041 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 100.34/67.87 [2019-03-28 12:35:48,070 INFO L133 ementStrategyFactory]: Using default assertion order modulation 100.34/67.87 [2019-03-28 12:35:48,070 INFO L374 BuchiCegarLoop]: Interprodecural is true 100.34/67.87 [2019-03-28 12:35:48,070 INFO L375 BuchiCegarLoop]: Hoare is true 100.34/67.87 [2019-03-28 12:35:48,070 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 100.34/67.87 [2019-03-28 12:35:48,070 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 100.34/67.87 [2019-03-28 12:35:48,070 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 100.34/67.87 [2019-03-28 12:35:48,070 INFO L379 BuchiCegarLoop]: Difference is false 100.34/67.87 [2019-03-28 12:35:48,071 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 100.34/67.87 [2019-03-28 12:35:48,071 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 100.34/67.87 [2019-03-28 12:35:48,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. 100.34/67.87 [2019-03-28 12:35:48,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 100.34/67.87 [2019-03-28 12:35:48,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.34/67.87 [2019-03-28 12:35:48,079 INFO L119 BuchiIsEmpty]: Starting construction of run 100.34/67.87 [2019-03-28 12:35:48,084 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,084 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,084 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 100.34/67.87 [2019-03-28 12:35:48,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. 100.34/67.87 [2019-03-28 12:35:48,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 100.34/67.87 [2019-03-28 12:35:48,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.34/67.87 [2019-03-28 12:35:48,086 INFO L119 BuchiIsEmpty]: Starting construction of run 100.34/67.87 [2019-03-28 12:35:48,086 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,087 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,092 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [182] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 29#L22true [119] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 8#L22-2true [120] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 12#L25-1true [143] L25-1-->L30: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc10.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (> |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4| 1) |v_#valid_6|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 24#L30true [109] L30-->L30-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 21#L30-1true [183] L30-1-->L9-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= 1 .cse0) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_subseq_~s.base_3) (= v_ULTIMATE.start_subseq_~s.base_3 v_ULTIMATE.start_subseq_~ps~0.base_11) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_subseq_~t.base_3) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~t.offset_3 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~pt~0.offset_11 v_ULTIMATE.start_subseq_~t.offset_3) (= v_ULTIMATE.start_subseq_~s.offset_3 v_ULTIMATE.start_subseq_~ps~0.offset_9) (= v_ULTIMATE.start_subseq_~s.offset_3 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~pt~0.base_14 v_ULTIMATE.start_subseq_~t.base_3))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_4|, ULTIMATE.start_subseq_#in~s.offset=|v_ULTIMATE.start_subseq_#in~s.offset_2|, ULTIMATE.start_subseq_#t~post5.base=|v_ULTIMATE.start_subseq_#t~post5.base_4|, ULTIMATE.start_subseq_#in~s.base=|v_ULTIMATE.start_subseq_#in~s.base_2|, ULTIMATE.start_subseq_#in~t.base=|v_ULTIMATE.start_subseq_#in~t.base_2|, ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_10|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_9, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_4|, ULTIMATE.start_subseq_~s.offset=v_ULTIMATE.start_subseq_~s.offset_3, ULTIMATE.start_subseq_#in~t.offset=|v_ULTIMATE.start_subseq_#in~t.offset_2|, ULTIMATE.start_subseq_~s.base=v_ULTIMATE.start_subseq_~s.base_3, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_subseq_~t.base=v_ULTIMATE.start_subseq_~t.base_3, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_14, ULTIMATE.start_subseq_#t~mem7=|v_ULTIMATE.start_subseq_#t~mem7_7|, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_7|, ULTIMATE.start_subseq_#t~post5.offset=|v_ULTIMATE.start_subseq_#t~post5.offset_4|, ULTIMATE.start_subseq_#res=|v_ULTIMATE.start_subseq_#res_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_7|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_6|, #valid=|v_#valid_25|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_6|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_subseq_~t.offset=v_ULTIMATE.start_subseq_~t.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~ps~0.offset, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_#in~s.offset, ULTIMATE.start_subseq_#t~post5.base, ULTIMATE.start_subseq_~s.offset, ULTIMATE.start_subseq_#in~s.base, ULTIMATE.start_subseq_#in~t.base, ULTIMATE.start_subseq_#in~t.offset, ULTIMATE.start_subseq_~s.base, ULTIMATE.start_subseq_~t.base, ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_subseq_#t~mem7, ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~post5.offset, ULTIMATE.start_subseq_#res, ULTIMATE.start_subseq_#t~mem3, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0, #memory_int, ULTIMATE.start_subseq_~ps~0.base, ULTIMATE.start_subseq_~t.offset] 11#L9-8true 100.34/67.87 [2019-03-28 12:35:48,093 INFO L796 eck$LassoCheckResult]: Loop: 11#L9-8true [94] L9-8-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_subseq_~ps~0.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_subseq_~ps~0.base_3) v_ULTIMATE.start_subseq_~ps~0.offset_3) |v_ULTIMATE.start_subseq_#t~mem0_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_subseq_~ps~0.base_3))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #valid=|v_#valid_13|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem0] 7#L9-1true [160] L9-1-->L9-2: Formula: (and (not |v_ULTIMATE.start_subseq_#t~short2_2|) (= 0 |v_ULTIMATE.start_subseq_#t~mem0_3|)) InVars {ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_2|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 6#L9-2true [81] L9-2-->L9-6: Formula: (not |v_ULTIMATE.start_subseq_#t~short2_5|) InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_5|} AuxVars[] AssignedVars[] 13#L9-6true [99] L9-6-->L10: Formula: |v_ULTIMATE.start_subseq_#t~short2_9| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_9|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_8|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_5|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0] 9#L10true [86] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_subseq_~ps~0.base_6)) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_subseq_~ps~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subseq_~ps~0.base_6) v_ULTIMATE.start_subseq_~ps~0.offset_5) |v_ULTIMATE.start_subseq_#t~mem3_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem3] 25#L10-1true [112] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_subseq_~pt~0.base_7)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_subseq_~pt~0.base_7) v_ULTIMATE.start_subseq_~pt~0.offset_6) |v_ULTIMATE.start_subseq_#t~mem4_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_subseq_~pt~0.base_7)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_6)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, #memory_int=|v_#memory_int_8|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4] 22#L10-2true [180] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_subseq_#t~mem3_6| |v_ULTIMATE.start_subseq_#t~mem4_6|) InVars {ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_6|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_6|} OutVars{ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~mem3] 18#L10-4true [103] L10-4-->L9-8: Formula: (and (= v_ULTIMATE.start_subseq_~pt~0.base_11 v_ULTIMATE.start_subseq_~pt~0.base_10) (= (+ v_ULTIMATE.start_subseq_~pt~0.offset_9 1) v_ULTIMATE.start_subseq_~pt~0.offset_8)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_11, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_9} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_2|, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_10, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_2|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_~pt~0.offset] 11#L9-8true 100.34/67.87 [2019-03-28 12:35:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1916656771, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:35:48,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:48,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1487693122, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:35:48,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:48,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 100.34/67.87 [2019-03-28 12:35:48,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 100.34/67.87 [2019-03-28 12:35:48,136 INFO L811 eck$LassoCheckResult]: loop already infeasible 100.34/67.87 [2019-03-28 12:35:48,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 100.34/67.87 [2019-03-28 12:35:48,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 100.34/67.87 [2019-03-28 12:35:48,138 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. 100.34/67.87 [2019-03-28 12:35:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 100.34/67.87 [2019-03-28 12:35:48,210 INFO L93 Difference]: Finished difference Result 33 states and 59 transitions. 100.34/67.87 [2019-03-28 12:35:48,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 100.34/67.87 [2019-03-28 12:35:48,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 59 transitions. 100.34/67.87 [2019-03-28 12:35:48,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 100.34/67.87 [2019-03-28 12:35:48,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 100.34/67.87 [2019-03-28 12:35:48,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 100.34/67.87 [2019-03-28 12:35:48,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.34/67.87 [2019-03-28 12:35:48,218 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. 100.34/67.87 [2019-03-28 12:35:48,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. 100.34/67.87 [2019-03-28 12:35:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,220 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,220 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,221 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 100.34/67.87 [2019-03-28 12:35:48,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 25 transitions. 100.34/67.87 [2019-03-28 12:35:48,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 100.34/67.87 [2019-03-28 12:35:48,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 100.34/67.87 [2019-03-28 12:35:48,223 INFO L119 BuchiIsEmpty]: Starting construction of run 100.34/67.87 [2019-03-28 12:35:48,223 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,223 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 100.34/67.87 [2019-03-28 12:35:48,224 INFO L794 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY [182] ULTIMATE.startENTRY-->L22: Formula: (and (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|) (= |v_#valid_23| (store |v_#valid_24| 0 0))) InVars {#valid=|v_#valid_24|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_5|, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_6|, ULTIMATE.start_main_#t~nondet9=|v_ULTIMATE.start_main_#t~nondet9_6|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_10, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_5|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_7, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_6, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_5|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_23|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_6, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_10, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet9, ULTIMATE.start_main_~length1~0, #NULL.offset, ULTIMATE.start_main_#t~malloc11.base, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, #NULL.base, ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_main_~nondetString1~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_~length2~0, ULTIMATE.start_main_#t~malloc10.offset] 88#L22 [119] L22-->L22-2: Formula: (>= v_ULTIMATE.start_main_~length1~0_6 1) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} OutVars{ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_6} AuxVars[] AssignedVars[] 84#L22-2 [120] L22-2-->L25-1: Formula: (>= v_ULTIMATE.start_main_~length2~0_6 1) InVars {ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} OutVars{ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_6} AuxVars[] AssignedVars[] 85#L25-1 [143] L25-1-->L30: Formula: (let ((.cse0 (store |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4| 1))) (and (= v_ULTIMATE.start_main_~nondetString2~0.base_2 |v_ULTIMATE.start_main_#t~malloc11.base_4|) (= |v_ULTIMATE.start_main_#t~malloc11.offset_4| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4|)) (< |v_ULTIMATE.start_main_#t~malloc10.base_4| |v_#StackHeapBarrier_1|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_#t~malloc10.base_4|) 0) (= (store (store |v_#length_4| |v_ULTIMATE.start_main_#t~malloc10.base_4| v_ULTIMATE.start_main_~length1~0_7) |v_ULTIMATE.start_main_#t~malloc11.base_4| v_ULTIMATE.start_main_~length2~0_7) |v_#length_2|) (= v_ULTIMATE.start_main_~nondetString1~0.base_2 |v_ULTIMATE.start_main_#t~malloc10.base_4|) (> |v_ULTIMATE.start_main_#t~malloc11.base_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc11.base_4| 1) |v_#valid_6|) (= v_ULTIMATE.start_main_~nondetString2~0.offset_2 |v_ULTIMATE.start_main_#t~malloc11.offset_4|) (< |v_ULTIMATE.start_main_#t~malloc11.base_4| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_main_#t~malloc10.offset_4| 0) (> |v_ULTIMATE.start_main_#t~malloc10.base_4| 0) (= v_ULTIMATE.start_main_~nondetString1~0.offset_2 |v_ULTIMATE.start_main_#t~malloc10.offset_4|))) InVars {ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_4|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_main_#t~malloc11.offset=|v_ULTIMATE.start_main_#t~malloc11.offset_4|, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_7, ULTIMATE.start_main_#t~malloc11.base=|v_ULTIMATE.start_main_#t~malloc11.base_4|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_2, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_2, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc10.base=|v_ULTIMATE.start_main_#t~malloc10.base_4|, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_2, #valid=|v_#valid_6|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_2, #length=|v_#length_2|, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_7, ULTIMATE.start_main_#t~malloc10.offset=|v_ULTIMATE.start_main_#t~malloc10.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc10.base, ULTIMATE.start_main_#t~malloc11.offset, ULTIMATE.start_main_~nondetString1~0.base, #valid, ULTIMATE.start_main_~nondetString1~0.offset, ULTIMATE.start_main_#t~malloc11.base, #length, ULTIMATE.start_main_~nondetString2~0.base, ULTIMATE.start_main_~nondetString2~0.offset, ULTIMATE.start_main_#t~malloc10.offset] 82#L30 [109] L30-->L30-1: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3))) (and (<= 1 .cse0) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_main_~nondetString1~0.base_3) (+ v_ULTIMATE.start_main_~length1~0_8 v_ULTIMATE.start_main_~nondetString1~0.offset_3 (- 1)) 0))) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_main_~nondetString1~0.base_3)) (= (select |v_#valid_9| v_ULTIMATE.start_main_~nondetString1~0.base_3) 1))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} OutVars{ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_3, ULTIMATE.start_main_~length1~0=v_ULTIMATE.start_main_~length1~0_8, #length=|v_#length_5|} AuxVars[] AssignedVars[#memory_int] 79#L30-1 [183] L30-1-->L9-8: Formula: (let ((.cse0 (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7))) (and (= v_ULTIMATE.start_main_~nondetString1~0.offset_7 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= 1 .cse0) (= (select |v_#valid_25| v_ULTIMATE.start_main_~nondetString2~0.base_8) 1) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_subseq_~s.base_3) (= v_ULTIMATE.start_subseq_~s.base_3 v_ULTIMATE.start_subseq_~ps~0.base_11) (= |v_ULTIMATE.start_subseq_#in~s.base_2| v_ULTIMATE.start_main_~nondetString1~0.base_8) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_main_~nondetString2~0.base_8) (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~nondetString2~0.base_8) (+ v_ULTIMATE.start_main_~length2~0_11 v_ULTIMATE.start_main_~nondetString2~0.offset_7 (- 1)) 0)) |v_#memory_int_10|) (= |v_ULTIMATE.start_subseq_#in~t.base_2| v_ULTIMATE.start_subseq_~t.base_3) (= v_ULTIMATE.start_main_~nondetString2~0.offset_7 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~t.offset_3 |v_ULTIMATE.start_subseq_#in~t.offset_2|) (= v_ULTIMATE.start_subseq_~pt~0.offset_11 v_ULTIMATE.start_subseq_~t.offset_3) (= v_ULTIMATE.start_subseq_~s.offset_3 v_ULTIMATE.start_subseq_~ps~0.offset_9) (= v_ULTIMATE.start_subseq_~s.offset_3 |v_ULTIMATE.start_subseq_#in~s.offset_2|) (<= .cse0 (select |v_#length_18| v_ULTIMATE.start_main_~nondetString2~0.base_8)) (= v_ULTIMATE.start_subseq_~pt~0.base_14 v_ULTIMATE.start_subseq_~t.base_3))) InVars {ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, #length=|v_#length_18|, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_4|, ULTIMATE.start_subseq_#in~s.offset=|v_ULTIMATE.start_subseq_#in~s.offset_2|, ULTIMATE.start_subseq_#t~post5.base=|v_ULTIMATE.start_subseq_#t~post5.base_4|, ULTIMATE.start_subseq_#in~s.base=|v_ULTIMATE.start_subseq_#in~s.base_2|, ULTIMATE.start_subseq_#in~t.base=|v_ULTIMATE.start_subseq_#in~t.base_2|, ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_10|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_11, ULTIMATE.start_main_~nondetString1~0.base=v_ULTIMATE.start_main_~nondetString1~0.base_8, #length=|v_#length_18|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_11, ULTIMATE.start_main_~length2~0=v_ULTIMATE.start_main_~length2~0_11, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_9, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_4|, ULTIMATE.start_subseq_~s.offset=v_ULTIMATE.start_subseq_~s.offset_3, ULTIMATE.start_subseq_#in~t.offset=|v_ULTIMATE.start_subseq_#in~t.offset_2|, ULTIMATE.start_subseq_~s.base=v_ULTIMATE.start_subseq_~s.base_3, ULTIMATE.start_main_~nondetString2~0.base=v_ULTIMATE.start_main_~nondetString2~0.base_8, ULTIMATE.start_main_~nondetString2~0.offset=v_ULTIMATE.start_main_~nondetString2~0.offset_7, ULTIMATE.start_subseq_~t.base=v_ULTIMATE.start_subseq_~t.base_3, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_14, ULTIMATE.start_subseq_#t~mem7=|v_ULTIMATE.start_subseq_#t~mem7_7|, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_7|, ULTIMATE.start_subseq_#t~post5.offset=|v_ULTIMATE.start_subseq_#t~post5.offset_4|, ULTIMATE.start_subseq_#res=|v_ULTIMATE.start_subseq_#res_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_7|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_6|, #valid=|v_#valid_25|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_6|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_main_~nondetString1~0.offset=v_ULTIMATE.start_main_~nondetString1~0.offset_7, ULTIMATE.start_subseq_~t.offset=v_ULTIMATE.start_subseq_~t.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~ps~0.offset, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_#in~s.offset, ULTIMATE.start_subseq_#t~post5.base, ULTIMATE.start_subseq_~s.offset, ULTIMATE.start_subseq_#in~s.base, ULTIMATE.start_subseq_#in~t.base, ULTIMATE.start_subseq_#in~t.offset, ULTIMATE.start_subseq_~s.base, ULTIMATE.start_subseq_~t.base, ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_~pt~0.offset, ULTIMATE.start_subseq_#t~mem7, ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~post5.offset, ULTIMATE.start_subseq_#res, ULTIMATE.start_subseq_#t~mem3, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0, #memory_int, ULTIMATE.start_subseq_~ps~0.base, ULTIMATE.start_subseq_~t.offset] 76#L9-8 100.34/67.87 [2019-03-28 12:35:48,225 INFO L796 eck$LassoCheckResult]: Loop: 76#L9-8 [94] L9-8-->L9-1: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_3 1) (select |v_#length_9| v_ULTIMATE.start_subseq_~ps~0.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_subseq_~ps~0.base_3) v_ULTIMATE.start_subseq_~ps~0.offset_3) |v_ULTIMATE.start_subseq_#t~mem0_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_subseq_~ps~0.base_3))) InVars {#memory_int=|v_#memory_int_5|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_3, #valid=|v_#valid_13|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_2|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_3} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem0] 81#L9-1 [161] L9-1-->L9-2: Formula: (and |v_ULTIMATE.start_subseq_#t~short2_2| (< 0 |v_ULTIMATE.start_subseq_#t~mem0_3|)) InVars {ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_2|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 78#L9-2 [80] L9-2-->L9-3: Formula: |v_ULTIMATE.start_subseq_#t~short2_3| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_3|} AuxVars[] AssignedVars[] 77#L9-3 [77] L9-3-->L9-4: Formula: (and (= (select (select |v_#memory_int_6| v_ULTIMATE.start_subseq_~pt~0.base_4) v_ULTIMATE.start_subseq_~pt~0.offset_4) |v_ULTIMATE.start_subseq_#t~mem1_2|) (= 1 (select |v_#valid_15| v_ULTIMATE.start_subseq_~pt~0.base_4)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_4) (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_4 1) (select |v_#length_11| v_ULTIMATE.start_subseq_~pt~0.base_4))) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_4, #memory_int=|v_#memory_int_6|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_4, #length=|v_#length_11|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_4, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_4, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_2|, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem1] 73#L9-4 [170] L9-4-->L9-6: Formula: (and (< 0 |v_ULTIMATE.start_subseq_#t~mem1_3|) |v_ULTIMATE.start_subseq_#t~short2_4|) InVars {ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_3|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_4|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_3|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2] 74#L9-6 [99] L9-6-->L10: Formula: |v_ULTIMATE.start_subseq_#t~short2_9| InVars {ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_9|} OutVars{ULTIMATE.start_subseq_#t~short2=|v_ULTIMATE.start_subseq_#t~short2_8|, ULTIMATE.start_subseq_#t~mem0=|v_ULTIMATE.start_subseq_#t~mem0_5|, ULTIMATE.start_subseq_#t~mem1=|v_ULTIMATE.start_subseq_#t~mem1_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~short2, ULTIMATE.start_subseq_#t~mem1, ULTIMATE.start_subseq_#t~mem0] 86#L10 [86] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_subseq_~ps~0.base_6)) (<= (+ v_ULTIMATE.start_subseq_~ps~0.offset_5 1) (select |v_#length_13| v_ULTIMATE.start_subseq_~ps~0.base_6)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_subseq_~ps~0.base_6) v_ULTIMATE.start_subseq_~ps~0.offset_5) |v_ULTIMATE.start_subseq_#t~mem3_2|) (<= 0 v_ULTIMATE.start_subseq_~ps~0.offset_5)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_subseq_~ps~0.offset=v_ULTIMATE.start_subseq_~ps~0.offset_5, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_subseq_~ps~0.base=v_ULTIMATE.start_subseq_~ps~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem3] 83#L10-1 [112] L10-1-->L10-2: Formula: (and (<= (+ v_ULTIMATE.start_subseq_~pt~0.offset_6 1) (select |v_#length_15| v_ULTIMATE.start_subseq_~pt~0.base_7)) (= (select (select |v_#memory_int_8| v_ULTIMATE.start_subseq_~pt~0.base_7) v_ULTIMATE.start_subseq_~pt~0.offset_6) |v_ULTIMATE.start_subseq_#t~mem4_2|) (= 1 (select |v_#valid_19| v_ULTIMATE.start_subseq_~pt~0.base_7)) (<= 0 v_ULTIMATE.start_subseq_~pt~0.offset_6)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, #memory_int=|v_#memory_int_8|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, #length=|v_#length_15|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_7, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_6, ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4] 80#L10-2 [180] L10-2-->L10-4: Formula: (< |v_ULTIMATE.start_subseq_#t~mem3_6| |v_ULTIMATE.start_subseq_#t~mem4_6|) InVars {ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_6|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_6|} OutVars{ULTIMATE.start_subseq_#t~mem4=|v_ULTIMATE.start_subseq_#t~mem4_5|, ULTIMATE.start_subseq_#t~mem3=|v_ULTIMATE.start_subseq_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~mem4, ULTIMATE.start_subseq_#t~mem3] 75#L10-4 [103] L10-4-->L9-8: Formula: (and (= v_ULTIMATE.start_subseq_~pt~0.base_11 v_ULTIMATE.start_subseq_~pt~0.base_10) (= (+ v_ULTIMATE.start_subseq_~pt~0.offset_9 1) v_ULTIMATE.start_subseq_~pt~0.offset_8)) InVars {ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_11, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_9} OutVars{ULTIMATE.start_subseq_#t~post6.base=|v_ULTIMATE.start_subseq_#t~post6.base_2|, ULTIMATE.start_subseq_~pt~0.base=v_ULTIMATE.start_subseq_~pt~0.base_10, ULTIMATE.start_subseq_#t~post6.offset=|v_ULTIMATE.start_subseq_#t~post6.offset_2|, ULTIMATE.start_subseq_~pt~0.offset=v_ULTIMATE.start_subseq_~pt~0.offset_8} AuxVars[] AssignedVars[ULTIMATE.start_subseq_#t~post6.base, ULTIMATE.start_subseq_~pt~0.base, ULTIMATE.start_subseq_#t~post6.offset, ULTIMATE.start_subseq_~pt~0.offset] 76#L9-8 100.34/67.87 [2019-03-28 12:35:48,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:48,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1916656771, now seen corresponding path program 2 times 100.34/67.87 [2019-03-28 12:35:48,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:48,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:48,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 238528263, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:35:48,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1107998455, now seen corresponding path program 1 times 100.34/67.87 [2019-03-28 12:35:48,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 100.34/67.87 [2019-03-28 12:35:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 100.34/67.87 [2019-03-28 12:35:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 100.34/67.87 [2019-03-28 12:35:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 100.34/67.87 [2019-03-28 12:35:48,650 WARN L188 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 100.34/67.87 [2019-03-28 12:35:48,764 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 82 100.34/67.87 [2019-03-28 12:35:48,776 INFO L216 LassoAnalysis]: Preferences: 100.34/67.87 [2019-03-28 12:35:48,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 100.34/67.87 [2019-03-28 12:35:48,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 100.34/67.87 [2019-03-28 12:35:48,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 100.34/67.87 [2019-03-28 12:35:48,778 INFO L127 ssoRankerPreferences]: Use exernal solver: false 100.34/67.87 [2019-03-28 12:35:48,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 100.34/67.87 [2019-03-28 12:35:48,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 100.34/67.87 [2019-03-28 12:35:48,778 INFO L130 ssoRankerPreferences]: Path of dumped script: 100.34/67.87 [2019-03-28 12:35:48,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration2_Lasso 100.34/67.87 [2019-03-28 12:35:48,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 100.34/67.87 [2019-03-28 12:35:48,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 100.34/67.87 [2019-03-28 12:35:48,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:48,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:49,127 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 100.34/67.87 [2019-03-28 12:35:49,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:49,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:49,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 100.34/67.87 [2019-03-28 12:35:49,650 INFO L300 LassoAnalysis]: Preprocessing complete. 100.34/67.87 [2019-03-28 12:35:49,656 INFO L497 LassoAnalysis]: Using template 'affine'. 100.34/67.87 [2019-03-28 12:35:49,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 100.34/67.87 [2019-03-28 12:35:49,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,720 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 100.34/67.87 [2019-03-28 12:35:49,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 100.34/67.87 Termination analysis: LINEAR_WITH_GUESSES 100.34/67.87 Number of strict supporting invariants: 0 100.34/67.87 Number of non-strict supporting invariants: 1 100.34/67.87 Consider only non-deceasing supporting invariants: true 100.34/67.87 Simplify termination arguments: true 100.34/67.87 Simplify supporting invariants: trueOverapproximate stem: false 100.34/67.87 [2019-03-28 12:35:49,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. 100.34/67.87 [2019-03-28 12:35:49,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 100.34/67.87 [2019-03-28 12:35:49,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 100.34/67.87 [2019-03-28 12:35:49,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 100.34/67.87 [2019-03-28 12:35:49,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 100.34/67.87 [2019-03-28 12:35:49,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 100.34/67.87 [2019-03-28 12:35:49,814 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 100.34/67.87 [2019-03-28 12:35:49,841 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. 100.34/67.87 [2019-03-28 12:35:49,841 INFO L444 ModelExtractionUtils]: 44 out of 49 variables were initially zero. Simplification set additionally 2 variables to zero. 100.34/67.87 [2019-03-28 12:35:49,844 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 100.34/67.87 [2019-03-28 12:35:49,845 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 100.34/67.87 [2019-03-28 12:35:49,845 INFO L518 LassoAnalysis]: Proved termination. 100.34/67.87 [2019-03-28 12:35:49,846 INFO L520 LassoAnalysis]: Termination argument consisting of: 100.34/67.87 Ranking function f(ULTIMATE.start_subseq_~pt~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1) = -1*ULTIMATE.start_subseq_~pt~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_1 100.34/67.87 Supporting invariants [] 100.34/67.87 [2019-03-28 12:35:49,893 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed 100.34/67.87 [2019-03-28 12:35:49,896 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.87 [2019-03-28 12:35:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 100.34/67.87 [2019-03-28 12:35:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:49,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:49,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:49,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:49,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:49,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 100.34/67.87 [2019-03-28 12:35:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:50,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:50,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:50,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:50,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 100.34/67.87 [2019-03-28 12:35:50,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 8 conjunts are in the unsatisfiable core 100.34/67.87 [2019-03-28 12:35:50,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... 100.34/67.87 [2019-03-28 12:35:50,118 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization 100.34/67.87 [2019-03-28 12:35:50,122 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates 100.34/67.87 [2019-03-28 12:35:50,123 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 25 transitions. cyclomatic complexity: 10 Second operand 5 states. 100.34/67.87 [2019-03-28 12:35:50,213 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 25 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 26 states and 40 transitions. Complement of second has 7 states. 100.34/67.87 [2019-03-28 12:35:50,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states 100.34/67.87 [2019-03-28 12:35:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. 100.34/67.87 [2019-03-28 12:35:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. 100.34/67.87 [2019-03-28 12:35:50,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 6 letters. Loop has 10 letters. 100.34/67.87 [2019-03-28 12:35:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.34/67.87 [2019-03-28 12:35:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 16 letters. Loop has 10 letters. 100.34/67.87 [2019-03-28 12:35:50,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.34/67.87 [2019-03-28 12:35:50,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 6 letters. Loop has 20 letters. 100.34/67.87 [2019-03-28 12:35:50,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. 100.34/67.87 [2019-03-28 12:35:50,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 40 transitions. 100.34/67.87 [2019-03-28 12:35:50,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 100.34/67.87 [2019-03-28 12:35:50,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 100.34/67.87 [2019-03-28 12:35:50,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 100.34/67.87 [2019-03-28 12:35:50,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 100.34/67.87 [2019-03-28 12:35:50,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. 100.34/67.87 [2019-03-28 12:35:50,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 100.34/67.87 [2019-03-28 12:35:50,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true 100.34/67.87 [2019-03-28 12:35:50,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:35:50 BasicIcfg 100.34/67.87 [2019-03-28 12:35:50,233 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- 100.34/67.87 [2019-03-28 12:35:50,233 INFO L168 Benchmark]: Toolchain (without parser) took 63533.09 ms. Allocated memory was 649.6 MB in the beginning and 947.9 MB in the end (delta: 298.3 MB). Free memory was 563.8 MB in the beginning and 662.6 MB in the end (delta: -98.9 MB). Peak memory consumption was 199.5 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,234 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.89 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 563.8 MB in the beginning and 638.8 MB in the end (delta: -75.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 673.7 MB. Free memory was 638.8 MB in the beginning and 635.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,236 INFO L168 Benchmark]: Boogie Preprocessor took 26.12 ms. Allocated memory is still 673.7 MB. Free memory was 635.7 MB in the beginning and 633.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,236 INFO L168 Benchmark]: RCFGBuilder took 327.47 ms. Allocated memory is still 673.7 MB. Free memory was 633.0 MB in the beginning and 609.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,236 INFO L168 Benchmark]: BlockEncodingV2 took 119.69 ms. Allocated memory is still 673.7 MB. Free memory was 609.5 MB in the beginning and 600.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,237 INFO L168 Benchmark]: TraceAbstraction took 60507.83 ms. Allocated memory was 673.7 MB in the beginning and 940.6 MB in the end (delta: 266.9 MB). Free memory was 600.0 MB in the beginning and 566.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 470.5 MB. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,237 INFO L168 Benchmark]: BuchiAutomizer took 2200.28 ms. Allocated memory was 940.6 MB in the beginning and 947.9 MB in the end (delta: 7.3 MB). Free memory was 566.4 MB in the beginning and 662.6 MB in the end (delta: -96.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 100.34/67.87 [2019-03-28 12:35:50,241 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 100.34/67.87 --- Results --- 100.34/67.87 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 100.34/67.87 - StatisticsResult: Initial Icfg 100.34/67.87 38 locations, 44 edges 100.34/67.87 - StatisticsResult: Encoded RCFG 100.34/67.87 31 locations, 57 edges 100.34/67.87 * Results from de.uni_freiburg.informatik.ultimate.core: 100.34/67.87 - StatisticsResult: Toolchain Benchmarks 100.34/67.87 Benchmark results are: 100.34/67.87 * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 585.4 MB. There was no memory consumed. Max. memory is 50.3 GB. 100.34/67.87 * CACSL2BoogieTranslator took 304.89 ms. Allocated memory was 649.6 MB in the beginning and 673.7 MB in the end (delta: 24.1 MB). Free memory was 563.8 MB in the beginning and 638.8 MB in the end (delta: -75.0 MB). Peak memory consumption was 30.2 MB. Max. memory is 50.3 GB. 100.34/67.87 * Boogie Procedure Inliner took 41.02 ms. Allocated memory is still 673.7 MB. Free memory was 638.8 MB in the beginning and 635.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 50.3 GB. 100.34/67.87 * Boogie Preprocessor took 26.12 ms. Allocated memory is still 673.7 MB. Free memory was 635.7 MB in the beginning and 633.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. 100.34/67.87 * RCFGBuilder took 327.47 ms. Allocated memory is still 673.7 MB. Free memory was 633.0 MB in the beginning and 609.5 MB in the end (delta: 23.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 50.3 GB. 100.34/67.87 * BlockEncodingV2 took 119.69 ms. Allocated memory is still 673.7 MB. Free memory was 609.5 MB in the beginning and 600.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 50.3 GB. 100.34/67.87 * TraceAbstraction took 60507.83 ms. Allocated memory was 673.7 MB in the beginning and 940.6 MB in the end (delta: 266.9 MB). Free memory was 600.0 MB in the beginning and 566.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 470.5 MB. Max. memory is 50.3 GB. 100.34/67.87 * BuchiAutomizer took 2200.28 ms. Allocated memory was 940.6 MB in the beginning and 947.9 MB in the end (delta: 7.3 MB). Free memory was 566.4 MB in the beginning and 662.6 MB in the end (delta: -96.2 MB). There was no memory consumed. Max. memory is 50.3 GB. 100.34/67.87 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.87 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.87 - GenericResult: Unfinished Backtranslation 100.34/67.88 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #memory_int 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 - GenericResult: Unfinished Backtranslation 100.34/67.88 unknown boogie variable #length 100.34/67.88 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 100.34/67.88 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 30]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 31]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 30]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 9]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 9]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 9]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 9]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 10]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 15]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - PositiveResult [Line: 31]: pointer dereference always succeeds 100.34/67.88 For all program executions holds that pointer dereference always succeeds at this location 100.34/67.88 - AllSpecificationsHoldResult: All specifications hold 100.34/67.88 14 specifications checked. All of them hold 100.34/67.88 - InvariantResult [Line: 9]: Loop Invariant 100.34/67.88 [2019-03-28 12:35:50,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,253 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,259 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,260 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,261 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,262 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,264 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,265 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,266 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,270 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.offset,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,272 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~nondetString2~0.base,QUANTIFIED] 100.34/67.88 [2019-03-28 12:35:50,274 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,275 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,279 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,280 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,282 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,283 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,284 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 100.34/67.88 [2019-03-28 12:35:50,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 [2019-03-28 12:35:50,286 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 100.34/67.88 Derived loop invariant: ((((((((nondetString1 == 0 && !(nondetString1 == nondetString2)) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == ps))) && (((pt + 1 <= unknown-#length-unknown[pt] && ((1 <= pt && nondetString2 == 0) && ((((((1 == \valid[ps] && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && ps == 0) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]) && 1 <= length2) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0) || ((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && ps == 0) && 1 <= length2) && (\exists ULTIMATE.start_main_~nondetString2~0.offset : int :: (0 == unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && ULTIMATE.start_main_~nondetString2~0.offset <= 0) && pt <= ULTIMATE.start_main_~nondetString2~0.offset)) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString2 == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]))) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && unknown-#length-unknown[nondetString2] == length2) || ((((!(nondetString1 == nondetString2) && unknown-#memory_int-unknown[ps][unknown-#length-unknown[ps] + -1] == 0) && (\exists ULTIMATE.start_main_~nondetString2~0.base : int, ULTIMATE.start_main_~nondetString2~0.offset : int :: 0 == unknown-#memory_int-unknown[ULTIMATE.start_main_~nondetString2~0.base][unknown-#length-unknown[ULTIMATE.start_main_~nondetString2~0.base] + ULTIMATE.start_main_~nondetString2~0.offset + -1] && !(ULTIMATE.start_main_~nondetString2~0.base == ps))) && unknown-#memory_int-unknown[nondetString1][unknown-#length-unknown[nondetString1] + -1] == 0) && ((pt + 1 <= unknown-#length-unknown[pt] && 1 <= pt) && ((((((((((1 <= ps && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && unknown-#length-unknown[nondetString2] == length2) && ps + 1 <= unknown-#length-unknown[ps]) && 1 <= length2) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 == \valid[nondetString2]) && unknown-#memory_int-unknown[pt][unknown-#length-unknown[pt] + -1] == 0)) || ((((((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && !(nondetString1 == nondetString2)) && 1 == \valid[pt]) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]) && unknown-#length-unknown[nondetString2] == length2) && ps == 0) && 1 <= length2) && 0 == unknown-#memory_int-unknown[ps][ps]) && 1 == length1) && 1 == \valid[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2])) || ((((((((((((((((0 == pt && 1 == \valid[ps]) && length1 == unknown-#length-unknown[nondetString1]) && 1 == \valid[pt]) && unknown-#length-unknown[nondetString2] == length2) && ps == 0) && (2 <= unknown-#length-unknown[ps] || 0 == unknown-#memory_int-unknown[ps][ps])) && (2 <= unknown-#length-unknown[nondetString1] || (!(nondetString1 == nondetString2) && 0 == unknown-#memory_int-unknown[nondetString2 := unknown-#memory_int-unknown[nondetString2][length2 + nondetString2 + -1 := 0]][nondetString1][nondetString1]))) && length2 == 1) && 1 == \valid[nondetString1]) && nondetString1 + 1 <= unknown-#length-unknown[nondetString1]) && nondetString1 == 0) && nondetString2 == 0) && unknown-#memory_int-unknown[pt][pt] == 0) && 1 <= unknown-#length-unknown[pt]) && 1 <= unknown-#length-unknown[ps]) && 1 == \valid[nondetString2]) 100.34/67.88 - StatisticsResult: Ultimate Automizer benchmark data 100.34/67.88 CFG has 1 procedures, 31 locations, 14 error locations. SAFE Result, 60.3s OverallTime, 22 OverallIterations, 3 TraceHistogramMax, 44.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 222 SDtfs, 2870 SDslu, 1103 SDs, 0 SdLazy, 2731 SolverSat, 610 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 412 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1759 ImplicationChecksByTransitivity, 45.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 378 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 12 NumberOfFragments, 524 HoareAnnotationTreeSize, 1 FomulaSimplifications, 7524 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 1 FomulaSimplificationsInter, 16335 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 448 ConstructedInterpolants, 51 QuantifiedInterpolants, 132591 SizeOfPredicates, 69 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 56/155 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 100.34/67.88 - StatisticsResult: Constructed decomposition of program 100.34/67.88 Your program was decomposed into 2 terminating modules (1 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * pt + unknown-#length-unknown[alloca(length2 * sizeof(char))] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. 100.34/67.88 - StatisticsResult: Timing statistics 100.34/67.88 BüchiAutomizer plugin needed 2.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28 SDtfs, 75 SDslu, 71 SDs, 0 SdLazy, 140 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital214 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp45 div100 bol100 ite100 ukn100 eq188 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s 100.34/67.88 - TerminationAnalysisResult: Termination proven 100.34/67.88 Buchi Automizer proved that your program is terminating 100.34/67.88 RESULT: Ultimate proved your program to be correct! 100.34/67.88 !SESSION 2019-03-28 12:34:43.411 ----------------------------------------------- 100.34/67.88 eclipse.buildId=unknown 100.34/67.88 java.version=1.8.0_181 100.34/67.88 java.vendor=Oracle Corporation 100.34/67.88 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 100.34/67.88 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 100.34/67.88 Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c 100.34/67.88 100.34/67.88 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:35:50.515 100.34/67.88 !MESSAGE The workspace will exit with unsaved changes in this session. 100.34/67.88 Received shutdown request... 100.34/67.88 Ultimate: 100.34/67.88 GTK+ Version Check 100.34/67.88 EOF