./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:14:15,804 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:14:15,810 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:14:15,825 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:14:15,825 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:14:15,826 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:14:15,828 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:14:15,830 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:14:15,831 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:14:15,833 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:14:15,834 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:14:15,834 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:14:15,835 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:14:15,836 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:14:15,838 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:14:15,838 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:14:15,840 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:14:15,842 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:14:15,844 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:14:15,846 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:14:15,847 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:14:15,848 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:14:15,851 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:14:15,851 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:14:15,852 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:14:15,853 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:14:15,854 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:14:15,855 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:14:15,856 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:14:15,857 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:14:15,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:14:15,858 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:14:15,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:14:15,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:14:15,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:14:15,861 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:14:15,861 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:14:15,888 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:14:15,889 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:14:15,891 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:14:15,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:14:15,892 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:14:15,892 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:14:15,893 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:14:15,894 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:14:15,894 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:14:15,894 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:14:15,894 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:14:15,894 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:14:15,895 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:14:15,895 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:14:15,895 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:14:15,896 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:14:15,896 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:14:15,896 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:14:15,896 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:14:15,896 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:14:15,897 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:14:15,897 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:14:15,897 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:14:15,897 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:14:15,897 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:14:15,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:14:15,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:14:15,898 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:14:15,902 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:14:15,902 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-01-14 02:14:15,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:14:15,973 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:14:15,980 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:14:15,982 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:14:15,982 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:14:15,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:16,048 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23915c5ca/49277ea331124f09895747029bd66105/FLAGbaae76737 [2019-01-14 02:14:16,502 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:14:16,502 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:16,507 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23915c5ca/49277ea331124f09895747029bd66105/FLAGbaae76737 [2019-01-14 02:14:16,848 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23915c5ca/49277ea331124f09895747029bd66105 [2019-01-14 02:14:16,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:14:16,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:14:16,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:16,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:14:16,860 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:14:16,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:16" (1/1) ... [2019-01-14 02:14:16,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f9a6a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:16, skipping insertion in model container [2019-01-14 02:14:16,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:16" (1/1) ... [2019-01-14 02:14:16,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:14:16,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:14:17,145 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:17,168 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:14:17,195 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:17,214 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:14:17,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17 WrapperNode [2019-01-14 02:14:17,215 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:17,216 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:17,216 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:14:17,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:14:17,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,236 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:17,262 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:14:17,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:14:17,262 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:14:17,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... [2019-01-14 02:14:17,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:14:17,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:14:17,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:14:17,292 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:14:17,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:14:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:14:17,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:14:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:14:17,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:14:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:14:17,766 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:14:17,766 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:14:17,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:17 BoogieIcfgContainer [2019-01-14 02:14:17,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:14:17,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:14:17,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:14:17,774 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:14:17,775 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:17,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:14:16" (1/3) ... [2019-01-14 02:14:17,777 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3762cfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:17, skipping insertion in model container [2019-01-14 02:14:17,777 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:17,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:17" (2/3) ... [2019-01-14 02:14:17,778 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3762cfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:17, skipping insertion in model container [2019-01-14 02:14:17,778 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:17,778 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:17" (3/3) ... [2019-01-14 02:14:17,781 INFO L375 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:17,845 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:14:17,846 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:14:17,846 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:14:17,847 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:14:17,847 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:14:17,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:14:17,847 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:14:17,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:14:17,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:14:17,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:14:17,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:17,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:17,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:17,910 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:17,910 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:17,910 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:14:17,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-14 02:14:17,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:17,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:17,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:17,913 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:17,913 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:14:17,921 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-01-14 02:14:17,922 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-01-14 02:14:17,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:14:17,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:17,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:17,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:17,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:17,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,147 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-01-14 02:14:18,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:18,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-01-14 02:14:18,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:18,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:18,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:18,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:18,429 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-01-14 02:14:19,684 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-01-14 02:14:20,053 WARN L181 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:14:20,065 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:20,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:20,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:20,066 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:20,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:20,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:20,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:20,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:20,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Lasso [2019-01-14 02:14:20,068 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:20,069 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:20,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:20,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:20,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:20,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:20,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:21,028 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 83 [2019-01-14 02:14:21,348 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-01-14 02:14:21,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:21,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:21,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:21,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:21,523 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-01-14 02:14:23,156 WARN L181 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:14:23,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:23,314 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:23,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:23,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:23,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:23,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,333 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,333 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:23,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:23,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:23,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,429 INFO L205 nArgumentSynthesizer]: 16 stem disjuncts [2019-01-14 02:14:23,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,471 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-01-14 02:14:23,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,645 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,688 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,688 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:23,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:23,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:23,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:23,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:23,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:23,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:23,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:23,781 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:23,792 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:14:23,792 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:14:23,796 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:23,797 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:14:23,798 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:23,799 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-01-14 02:14:24,436 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-01-14 02:14:24,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:14:24,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:24,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:24,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:24,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:24,604 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:24,605 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-01-14 02:14:24,656 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-01-14 02:14:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-01-14 02:14:24,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-14 02:14:24,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:24,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-14 02:14:24,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:24,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-14 02:14:24,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:24,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-01-14 02:14:24,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:24,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-01-14 02:14:24,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:14:24,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:14:24,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-14 02:14:24,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:24,675 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:14:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-14 02:14:24,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:14:24,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-01-14 02:14:24,701 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:14:24,701 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-14 02:14:24,701 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:14:24,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-01-14 02:14:24,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:24,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:24,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:24,703 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:14:24,703 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:14:24,703 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-01-14 02:14:24,703 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-01-14 02:14:24,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-14 02:14:24,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:24,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:24,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:24,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:25,055 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-01-14 02:14:25,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:25,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:25,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:14:25,098 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:25,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:25,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-01-14 02:14:25,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:25,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:25,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,265 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-01-14 02:14:25,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:14:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:14:25,350 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-14 02:14:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:25,479 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-14 02:14:25,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:14:25,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2019-01-14 02:14:25,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:25,483 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 19 transitions. [2019-01-14 02:14:25,483 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:14:25,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:14:25,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-14 02:14:25,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:25,484 INFO L706 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-14 02:14:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-14 02:14:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-01-14 02:14:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2019-01-14 02:14:25,486 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:14:25,486 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-14 02:14:25,486 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:14:25,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2019-01-14 02:14:25,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:25,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:25,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:25,488 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:14:25,488 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:14:25,488 INFO L794 eck$LassoCheckResult]: Stem: 287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 285#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 286#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 292#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 290#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 291#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 293#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 288#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-01-14 02:14:25,488 INFO L796 eck$LassoCheckResult]: Loop: 289#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 295#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 297#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 289#L20 [2019-01-14 02:14:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:25,489 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-01-14 02:14:25,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:25,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:25,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-01-14 02:14:25,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:25,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:25,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:25,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-01-14 02:14:25,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:25,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:25,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:25,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:25,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:25,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:14:25,956 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-14 02:14:25,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:25,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:25,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:14:25,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:25,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:25,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:25,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-01-14 02:14:25,999 INFO L478 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 11 treesize of output 8 [2019-01-14 02:14:26,002 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:26,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 02:14:26,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:26,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2019-01-14 02:14:26,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:14:26,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-01-14 02:14:26,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 02:14:26,178 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:26,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,197 INFO L267 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. [2019-01-14 02:14:26,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-01-14 02:14:26,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-14 02:14:26,274 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 02:14:26,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,289 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:14:26,289 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:26,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-01-14 02:14:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:26,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:26,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 10 [2019-01-14 02:14:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:14:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:14:26,472 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-01-14 02:14:27,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:27,021 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2019-01-14 02:14:27,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:14:27,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2019-01-14 02:14:27,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:27,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2019-01-14 02:14:27,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 02:14:27,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:14:27,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2019-01-14 02:14:27,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:27,026 INFO L706 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 02:14:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2019-01-14 02:14:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2019-01-14 02:14:27,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-01-14 02:14:27,030 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:14:27,030 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-01-14 02:14:27,030 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:14:27,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-01-14 02:14:27,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:27,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:27,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:27,032 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:14:27,032 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-01-14 02:14:27,032 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 374#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 375#L24-2 [2019-01-14 02:14:27,032 INFO L796 eck$LassoCheckResult]: Loop: 375#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 384#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 376#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 377#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 379#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 382#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 383#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 375#L24-2 [2019-01-14 02:14:27,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:27,032 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:14:27,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:27,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:27,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:27,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-01-14 02:14:27,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:27,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:27,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-01-14 02:14:27,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:27,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:27,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:27,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:27,332 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-14 02:14:27,991 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 98 [2019-01-14 02:14:28,270 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:14:28,280 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:28,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:28,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:28,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:28,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:28,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:28,281 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:28,281 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:28,281 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Lasso [2019-01-14 02:14:28,281 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:28,281 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:28,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:28,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:28,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,114 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2019-01-14 02:14:29,291 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-01-14 02:14:29,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:29,546 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2019-01-14 02:14:31,148 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:14:31,203 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:31,204 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:31,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,209 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:31,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:31,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:31,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:31,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:31,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:31,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:31,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:31,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:31,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:31,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:31,271 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:31,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:14:31,285 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:31,286 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:31,287 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:14:31,287 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:31,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-01-14 02:14:31,715 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-01-14 02:14:31,717 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:14:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:31,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:31,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:31,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:31,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2019-01-14 02:14:31,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 23 [2019-01-14 02:14:31,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:31,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:31,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2019-01-14 02:14:31,945 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:14:31,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:14:32,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:14:32,008 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2019-01-14 02:14:32,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:32,067 INFO L478 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 29 treesize of output 30 [2019-01-14 02:14:32,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:14:32,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:32,183 INFO L478 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 41 treesize of output 40 [2019-01-14 02:14:32,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-14 02:14:32,203 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:32,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2019-01-14 02:14:32,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:14:32,289 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:32,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:14:32,336 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2019-01-14 02:14:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:32,408 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:14:32,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:14:32,592 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-14 02:14:32,726 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-01-14 02:14:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:32,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:14:32,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:14:32,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-01-14 02:14:32,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:32,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-01-14 02:14:32,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:32,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-01-14 02:14:32,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:32,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-01-14 02:14:32,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:32,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 02:14:32,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:14:32,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 02:14:32,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-01-14 02:14:32,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:32,734 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:14:32,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-01-14 02:14:32,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-14 02:14:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:14:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-01-14 02:14:32,738 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:14:32,738 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-01-14 02:14:32,738 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:14:32,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-01-14 02:14:32,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:32,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:32,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:32,740 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:14:32,740 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:14:32,740 INFO L794 eck$LassoCheckResult]: Stem: 647#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 641#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 642#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 652#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 653#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 666#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 665#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 664#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 655#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-01-14 02:14:32,740 INFO L796 eck$LassoCheckResult]: Loop: 651#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 648#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 649#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 661#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 660#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 651#L24 [2019-01-14 02:14:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:32,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-01-14 02:14:32,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:32,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:32,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:32,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:32,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:33,014 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-14 02:14:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:33,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:33,104 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:33,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:33,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:33,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 68 [2019-01-14 02:14:33,199 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:33,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:33,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 58 [2019-01-14 02:14:33,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 44 treesize of output 44 [2019-01-14 02:14:33,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:33,383 INFO L478 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 0 case distinctions, treesize of input 47 treesize of output 46 [2019-01-14 02:14:33,384 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:33,470 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:33,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 68 [2019-01-14 02:14:33,528 INFO L478 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 0 case distinctions, treesize of input 49 treesize of output 48 [2019-01-14 02:14:33,529 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:34,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 28 [2019-01-14 02:14:34,341 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:35,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:35,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 02:14:35,210 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-14 02:14:35,210 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:35,316 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:35,653 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:35,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 02:14:35,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2019-01-14 02:14:35,694 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:35,800 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-14 02:14:35,801 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:35,859 INFO L267 ElimStorePlain]: Start of recursive call 12: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:14:36,020 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:36,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 33 treesize of output 73 [2019-01-14 02:14:36,095 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:14:36,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-01-14 02:14:36,128 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:36,315 INFO L478 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 0 case distinctions, treesize of input 30 treesize of output 29 [2019-01-14 02:14:36,315 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:36,352 INFO L267 ElimStorePlain]: Start of recursive call 15: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:36,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:14:36,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 64 [2019-01-14 02:14:36,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2019-01-14 02:14:36,639 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:37,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 39 treesize of output 36 [2019-01-14 02:14:37,433 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:38,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 39 treesize of output 36 [2019-01-14 02:14:38,156 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:38,860 INFO L478 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 0 case distinctions, treesize of input 42 treesize of output 41 [2019-01-14 02:14:38,860 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:39,584 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:39,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 83 [2019-01-14 02:14:39,639 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:14:39,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 50 treesize of output 50 [2019-01-14 02:14:39,676 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:39,995 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 02:14:39,996 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:40,046 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:40,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 37 treesize of output 79 [2019-01-14 02:14:40,542 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:14:40,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-01-14 02:14:40,565 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:40,881 INFO L478 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 0 case distinctions, treesize of input 34 treesize of output 33 [2019-01-14 02:14:40,882 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:40,959 INFO L267 ElimStorePlain]: Start of recursive call 26: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,206 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:41,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 40 treesize of output 83 [2019-01-14 02:14:41,253 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 02:14:41,280 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 02:14:41,280 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,507 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-14 02:14:41,511 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,557 INFO L267 ElimStorePlain]: Start of recursive call 29: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,732 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:14:41,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 60 [2019-01-14 02:14:41,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2019-01-14 02:14:41,783 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,886 INFO L478 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 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-14 02:14:41,887 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:41,930 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:14:42,016 INFO L267 ElimStorePlain]: Start of recursive call 18: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,069 INFO L267 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. [2019-01-14 02:14:42,069 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-01-14 02:14:42,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 78 [2019-01-14 02:14:42,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 60 treesize of output 53 [2019-01-14 02:14:42,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 25 [2019-01-14 02:14:42,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 24 [2019-01-14 02:14:42,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:42,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 25 [2019-01-14 02:14:42,501 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:14:42,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:14:42,582 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:42, output treesize:109 [2019-01-14 02:14:42,810 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:42,810 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-01-14 02:14:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:42,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:42,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-14 02:14:42,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-01-14 02:14:42,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:42,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,953 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 02:14:43,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:14:43,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:14:43,035 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-01-14 02:14:43,212 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-14 02:14:43,502 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 44 [2019-01-14 02:14:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:43,693 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-01-14 02:14:43,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:14:43,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-01-14 02:14:43,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:43,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-01-14 02:14:43,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-01-14 02:14:43,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-01-14 02:14:43,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-01-14 02:14:43,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:43,698 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-01-14 02:14:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-01-14 02:14:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-01-14 02:14:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 02:14:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-01-14 02:14:43,702 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 02:14:43,702 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 02:14:43,702 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:14:43,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-01-14 02:14:43,703 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:43,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:43,703 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:43,704 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-01-14 02:14:43,705 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:14:43,705 INFO L794 eck$LassoCheckResult]: Stem: 762#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 760#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 761#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 771#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 765#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 766#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 776#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 775#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 769#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 770#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 785#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 784#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 774#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-01-14 02:14:43,705 INFO L796 eck$LassoCheckResult]: Loop: 772#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 767#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 768#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 780#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 778#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 772#L24 [2019-01-14 02:14:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,705 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-01-14 02:14:43,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:43,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-01-14 02:14:43,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-01-14 02:14:43,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,049 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-14 02:14:44,554 WARN L181 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 02:14:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:14:44,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:44,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:44,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:14:44,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:44,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:44,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:14:44,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-01-14 02:14:44,809 INFO L478 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 11 treesize of output 8 [2019-01-14 02:14:44,812 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:44,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 02:14:44,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2019-01-14 02:14:44,849 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 02:14:44,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:8 [2019-01-14 02:14:44,878 INFO L478 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 11 treesize of output 8 [2019-01-14 02:14:44,885 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:44,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 02:14:44,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 02:14:44,915 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:44,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:44,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-14 02:14:44,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 57 [2019-01-14 02:14:45,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:45,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 37 [2019-01-14 02:14:45,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 02:14:45,284 INFO L478 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 0 case distinctions, treesize of input 23 treesize of output 22 [2019-01-14 02:14:45,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:45,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:45,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2019-01-14 02:14:45,359 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:14:45,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:14:45,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-14 02:14:45,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:30, output treesize:65 [2019-01-14 02:14:45,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-01-14 02:14:45,587 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:14:45,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:45,593 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 02:14:45,593 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:45,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:45,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:45,600 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:42, output treesize:3 [2019-01-14 02:14:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:14:45,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:45,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2019-01-14 02:14:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 02:14:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-01-14 02:14:45,786 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 15 states. [2019-01-14 02:14:46,239 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-14 02:14:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:46,491 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2019-01-14 02:14:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 02:14:46,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2019-01-14 02:14:46,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:14:46,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2019-01-14 02:14:46,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:14:46,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:14:46,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2019-01-14 02:14:46,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:46,496 INFO L706 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-01-14 02:14:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2019-01-14 02:14:46,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2019-01-14 02:14:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 02:14:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-14 02:14:46,501 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 02:14:46,501 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-14 02:14:46,501 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:14:46,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2019-01-14 02:14:46,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:14:46,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:46,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:46,502 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-01-14 02:14:46,503 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:14:46,503 INFO L794 eck$LassoCheckResult]: Stem: 932#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 927#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 933#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 930#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 931#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 941#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 934#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 935#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 953#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 952#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 951#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 950#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 942#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-01-14 02:14:46,503 INFO L796 eck$LassoCheckResult]: Loop: 936#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 939#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 928#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 929#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 949#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 946#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 947#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 936#L24 [2019-01-14 02:14:46,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-01-14 02:14:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:46,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:46,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2019-01-14 02:14:46,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:46,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:46,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 2 times [2019-01-14 02:14:46,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:46,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:46,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:46,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,790 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 8 [2019-01-14 02:14:47,281 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-01-14 02:14:47,354 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:14:47,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:47,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:47,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:14:47,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:14:47,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:47,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:47,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:47,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:14:47,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:47,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:47,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:14:47,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:11 [2019-01-14 02:14:47,589 INFO L478 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 11 treesize of output 8 [2019-01-14 02:14:47,601 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:47,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-14 02:14:47,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 02:14:47,649 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:47,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,662 INFO L267 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. [2019-01-14 02:14:47,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2019-01-14 02:14:47,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:47,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2019-01-14 02:14:47,773 INFO L478 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 0 case distinctions, treesize of input 44 treesize of output 42 [2019-01-14 02:14:47,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:47,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 28 [2019-01-14 02:14:47,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:47,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:14:47,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-14 02:14:47,964 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:61 [2019-01-14 02:14:48,076 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:48,077 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-01-14 02:14:48,089 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 02:14:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2019-01-14 02:14:48,368 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2019-01-14 02:14:48,471 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-01-14 02:14:48,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:14:48,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:14:48,472 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 6 Second operand 12 states. [2019-01-14 02:14:48,783 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 23 [2019-01-14 02:14:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:48,949 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-14 02:14:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:14:48,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 45 transitions. [2019-01-14 02:14:48,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-01-14 02:14:48,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 45 transitions. [2019-01-14 02:14:48,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-14 02:14:48,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-14 02:14:48,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2019-01-14 02:14:48,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:48,954 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-01-14 02:14:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2019-01-14 02:14:48,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2019-01-14 02:14:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-14 02:14:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-14 02:14:48,959 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 02:14:48,959 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-14 02:14:48,959 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:14:48,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 38 transitions. [2019-01-14 02:14:48,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-14 02:14:48,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:48,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:48,963 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-01-14 02:14:48,963 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-01-14 02:14:48,964 INFO L794 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1091#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1092#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1098#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1095#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1096#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1114#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1110#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1108#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1099#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1100#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1124#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1123#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1122#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1121#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1109#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-01-14 02:14:48,964 INFO L796 eck$LassoCheckResult]: Loop: 1101#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1103#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1119#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1117#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1116#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1115#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1111#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1112#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1101#L24 [2019-01-14 02:14:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:48,964 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-01-14 02:14:48,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:48,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:48,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:48,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:48,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,002 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-01-14 02:14:49,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:49,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:49,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 02:14:49,261 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:49,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:14:49,262 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:14:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:14:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:14:49,265 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-01-14 02:14:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:49,504 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-14 02:14:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:14:49,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-01-14 02:14:49,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:14:49,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-01-14 02:14:49,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:14:49,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:14:49,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-01-14 02:14:49,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:49,509 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-14 02:14:49,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-01-14 02:14:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-14 02:14:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 02:14:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-14 02:14:49,520 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-14 02:14:49,520 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-14 02:14:49,520 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:14:49,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-01-14 02:14:49,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-01-14 02:14:49,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:49,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:49,527 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-01-14 02:14:49,527 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-01-14 02:14:49,527 INFO L794 eck$LassoCheckResult]: Stem: 1173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1167#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1168#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1179#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1171#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1172#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1176#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1183#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1181#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1182#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1185#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1197#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1196#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1195#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1194#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1184#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-01-14 02:14:49,528 INFO L796 eck$LassoCheckResult]: Loop: 1177#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1178#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1190#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1189#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1188#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1187#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1186#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1180#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1174#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1175#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1169#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1170#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1193#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1191#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1192#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L24 [2019-01-14 02:14:49,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,528 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 4 times [2019-01-14 02:14:49,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:49,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,585 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-01-14 02:14:49,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:49,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,618 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 3 times [2019-01-14 02:14:49,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:49,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:51,039 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 127 DAG size of output: 115 [2019-01-14 02:14:51,197 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-14 02:14:54,261 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 194 DAG size of output: 158 [2019-01-14 02:14:54,943 WARN L181 SmtUtils]: Spent 680.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2019-01-14 02:14:54,948 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:54,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:54,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:54,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:54,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:54,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:54,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:54,949 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:54,949 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration9_Lasso [2019-01-14 02:14:54,949 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:54,949 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:54,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:54,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:54,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:54,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:54,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:55,753 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 87 [2019-01-14 02:14:55,980 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-01-14 02:14:55,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:55,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:55,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:55,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:14:56,271 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-01-14 02:14:57,626 WARN L181 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:14:57,803 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:57,804 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:57,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:57,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:57,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:57,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:57,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:57,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:57,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,810 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:57,810 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:57,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,812 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:57,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:57,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:57,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:57,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:57,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:57,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:57,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:57,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:57,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:57,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:57,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:57,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:57,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:57,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:57,831 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:14:57,831 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:14:57,831 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:57,832 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:14:57,832 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:57,832 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-01-14 02:14:58,154 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-01-14 02:14:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:58,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:58,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:58,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2019-01-14 02:14:58,266 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:14:58,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,277 INFO L267 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. [2019-01-14 02:14:58,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-01-14 02:14:58,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 42 [2019-01-14 02:14:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 31 treesize of output 19 [2019-01-14 02:14:58,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-01-14 02:14:58,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:14:58,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:14:58,486 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:36, output treesize:62 [2019-01-14 02:14:58,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,543 INFO L478 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 50 treesize of output 49 [2019-01-14 02:14:58,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-14 02:14:58,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2019-01-14 02:14:58,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:14:58,618 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:14:58,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 02:14:58,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:98, output treesize:72 [2019-01-14 02:14:58,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:14:58,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 64 [2019-01-14 02:14:58,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-14 02:14:58,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:00,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:00,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:00,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:00,494 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-14 02:15:00,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 48 [2019-01-14 02:15:00,505 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 02:15:00,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:00,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 36 treesize of output 30 [2019-01-14 02:15:00,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:00,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2019-01-14 02:15:00,748 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-14 02:15:00,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 02:15:00,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-14 02:15:00,864 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:43, output treesize:149 [2019-01-14 02:15:01,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:01,095 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-14 02:15:01,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 64 [2019-01-14 02:15:01,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 55 treesize of output 43 [2019-01-14 02:15:01,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:02,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:02,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:02,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 58 [2019-01-14 02:15:02,102 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:15:02,656 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:15:02,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 50 [2019-01-14 02:15:02,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 02:15:02,663 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 02:15:02,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-01-14 02:15:02,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-01-14 02:15:02,811 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,825 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:02,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:02,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 78 [2019-01-14 02:15:02,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 56 treesize of output 44 [2019-01-14 02:15:02,982 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:03,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:03,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:03,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-14 02:15:03,139 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:03,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:03,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:03,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-14 02:15:03,314 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:03,395 INFO L267 ElimStorePlain]: Start of recursive call 9: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:15:03,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 7 xjuncts. [2019-01-14 02:15:03,584 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 8 variables, input treesize:193, output treesize:297 [2019-01-14 02:15:04,334 WARN L181 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 69 [2019-01-14 02:15:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:04,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2019-01-14 02:15:04,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-14 02:15:04,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:04,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:04,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:04,511 INFO L478 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 54 treesize of output 51 [2019-01-14 02:15:04,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 34 [2019-01-14 02:15:04,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-14 02:15:04,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 02:15:04,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:04,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2019-01-14 02:15:04,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:04,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:04,692 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:04,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:04,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 67 [2019-01-14 02:15:04,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 56 treesize of output 44 [2019-01-14 02:15:04,817 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:04,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:04,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 43 [2019-01-14 02:15:04,884 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2019-01-14 02:15:04,937 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:15:05,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 6 xjuncts. [2019-01-14 02:15:05,051 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 14 variables, input treesize:211, output treesize:216 [2019-01-14 02:15:05,388 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-01-14 02:15:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:05,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-01-14 02:15:05,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-01-14 02:15:06,010 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-01-14 02:15:06,328 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-01-14 02:15:06,481 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2019-01-14 02:15:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:15:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-01-14 02:15:06,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2019-01-14 02:15:06,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:06,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2019-01-14 02:15:06,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:06,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2019-01-14 02:15:06,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:06,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2019-01-14 02:15:06,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:15:06,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2019-01-14 02:15:06,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-14 02:15:06,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:15:06,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2019-01-14 02:15:06,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:06,489 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-01-14 02:15:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2019-01-14 02:15:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-01-14 02:15:06,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 02:15:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-01-14 02:15:06,492 INFO L729 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 02:15:06,492 INFO L609 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-01-14 02:15:06,492 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:15:06,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-01-14 02:15:06,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:15:06,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:06,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:06,494 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:15:06,494 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-01-14 02:15:06,494 INFO L794 eck$LassoCheckResult]: Stem: 1568#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1562#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1563#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1575#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1566#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1567#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1596#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1594#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1577#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1578#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1591#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1589#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1587#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1585#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1583#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1581#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1573#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1569#L24-2 [2019-01-14 02:15:06,494 INFO L796 eck$LassoCheckResult]: Loop: 1569#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1570#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1564#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1565#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1600#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1599#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1576#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1569#L24-2 [2019-01-14 02:15:06,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 4 times [2019-01-14 02:15:06,495 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:06,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,524 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2019-01-14 02:15:06,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:06,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 5 times [2019-01-14 02:15:06,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:06,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:06,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:06,774 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-01-14 02:15:09,704 WARN L181 SmtUtils]: Spent 2.88 s on a formula simplification. DAG size of input: 199 DAG size of output: 163 [2019-01-14 02:15:10,423 WARN L181 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-14 02:15:10,427 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:15:10,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:15:10,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:15:10,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:15:10,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:15:10,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:15:10,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:15:10,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:15:10,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Lasso [2019-01-14 02:15:10,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:15:10,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:15:10,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:10,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:10,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,379 WARN L181 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-01-14 02:15:11,521 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-01-14 02:15:11,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:15:11,726 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:15:13,277 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-01-14 02:15:13,315 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:15:13,316 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:15:13,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:13,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:13,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:13,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:13,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:13,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:15:13,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:15:13,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:13,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:13,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:13,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:15:13,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:13,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:13,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:13,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:15:13,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:15:13,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:15:13,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:15:13,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:15:13,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:15:13,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:15:13,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:15:13,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:15:13,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:15:13,332 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:15:13,335 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:15:13,335 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:15:13,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:15:13,336 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:15:13,336 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:15:13,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2019-01-14 02:15:13,518 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-01-14 02:15:13,520 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:15:13,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:13,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:13,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:13,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 46 [2019-01-14 02:15:13,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 23 [2019-01-14 02:15:13,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:13,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:13,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 37 [2019-01-14 02:15:13,736 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-01-14 02:15:13,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:15:13,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 02:15:13,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:30, output treesize:67 [2019-01-14 02:15:13,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:13,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 42 [2019-01-14 02:15:13,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:13,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:13,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:14,001 INFO L478 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 29 treesize of output 30 [2019-01-14 02:15:14,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:14,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:14,015 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:14,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:14,048 INFO L478 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 41 treesize of output 40 [2019-01-14 02:15:14,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2019-01-14 02:15:14,055 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:14,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:14,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2019-01-14 02:15:14,093 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:112, output treesize:75 [2019-01-14 02:15:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:15:14,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:15:14,165 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-01-14 02:15:14,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2019-01-14 02:15:14,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:15:14,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:15:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-01-14 02:15:14,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-01-14 02:15:14,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:14,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2019-01-14 02:15:14,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:14,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2019-01-14 02:15:14,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:15:14,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2019-01-14 02:15:14,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:15:14,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2019-01-14 02:15:14,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-01-14 02:15:14,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 02:15:14,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2019-01-14 02:15:14,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:15:14,345 INFO L706 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-01-14 02:15:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2019-01-14 02:15:14,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-01-14 02:15:14,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:15:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-01-14 02:15:14,352 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-14 02:15:14,352 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-01-14 02:15:14,352 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:15:14,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2019-01-14 02:15:14,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:15:14,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:15:14,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:15:14,360 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2019-01-14 02:15:14,360 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-01-14 02:15:14,360 INFO L794 eck$LassoCheckResult]: Stem: 1942#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1936#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1937#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1943#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1968#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1967#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1966#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1965#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1964#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1963#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1962#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1938#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1939#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1960#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1958#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1956#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1946#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1944#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1945#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1940#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1941#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1988#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1987#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1981#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1980#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1979#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1978#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1977#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1976#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1975#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1955#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1947#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1948#L24-2 [2019-01-14 02:15:14,360 INFO L796 eck$LassoCheckResult]: Loop: 1948#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1950#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1951#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1961#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1959#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1957#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1952#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1948#L24-2 [2019-01-14 02:15:14,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:14,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 6 times [2019-01-14 02:15:14,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:14,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:14,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:14,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:14,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:15:14,651 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 02:15:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 02:15:14,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:15:14,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:15:14,976 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:15:15,077 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-01-14 02:15:15,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:15:15,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:15:15,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2019-01-14 02:15:15,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:15:15,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-01-14 02:15:15,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 02:15:15,218 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:15:15,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-14 02:15:15,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2019-01-14 02:15:15,263 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:15:15,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-14 02:15:15,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2019-01-14 02:15:15,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:15,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:27 [2019-01-14 02:15:15,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2019-01-14 02:15:15,372 INFO L478 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 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 02:15:15,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 02:15:15,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2019-01-14 02:15:15,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:15,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:34 [2019-01-14 02:15:15,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:15:15,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2019-01-14 02:15:15,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 20 treesize of output 7 [2019-01-14 02:15:15,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,526 INFO L267 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. [2019-01-14 02:15:15,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-01-14 02:15:15,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2019-01-14 02:15:15,595 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:15:15,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,605 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 02:15:15,606 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,611 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2019-01-14 02:15:15,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:15:15,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2019-01-14 02:15:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 62 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-14 02:15:15,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:15:15,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-01-14 02:15:15,668 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:15:15,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:15:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2019-01-14 02:15:15,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:15:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:15:15,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:15,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:15:15,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:15:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:15:15,854 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-14 02:15:15,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 02:15:15,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-01-14 02:15:15,899 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 18 states. [2019-01-14 02:15:16,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:15:16,416 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2019-01-14 02:15:16,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 02:15:16,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 39 transitions. [2019-01-14 02:15:16,418 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:16,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 0 states and 0 transitions. [2019-01-14 02:15:16,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:15:16,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:15:16,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:15:16,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:15:16,419 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:16,419 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:16,419 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:15:16,419 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:15:16,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:15:16,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:15:16,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:15:16,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:15:16 BoogieIcfgContainer [2019-01-14 02:15:16,427 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:15:16,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:15:16,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:15:16,428 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:15:16,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:17" (3/4) ... [2019-01-14 02:15:16,433 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:15:16,433 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:15:16,434 INFO L168 Benchmark]: Toolchain (without parser) took 59579.59 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.6 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -254.4 MB). Peak memory consumption was 191.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:16,434 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:16,434 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.03 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:16,435 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.89 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:16,435 INFO L168 Benchmark]: Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:16,435 INFO L168 Benchmark]: RCFGBuilder took 476.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:16,435 INFO L168 Benchmark]: BuchiAutomizer took 58658.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 317.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.7 MB). Peak memory consumption was 213.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:15:16,436 INFO L168 Benchmark]: Witness Printer took 5.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:15:16,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.03 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.89 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.92 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 476.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 58658.04 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 317.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -103.7 MB). Peak memory consumption was 213.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 7 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 58.6s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 44.6s. Construction of modules took 1.6s. Büchi inclusion checks took 12.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 48 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 10. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 49 SDtfs, 103 SDslu, 47 SDs, 0 SdLazy, 665 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1994 mio100 ax100 hnf100 lsp98 ukn31 mio100 lsp36 div100 bol100 ite100 ukn100 eq186 hnf88 smp94 dnf710 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 194ms VariablesStem: 9 VariablesLoop: 8 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...