./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array16_alloca_original.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array16_alloca_original.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer --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 b6c8e92f4d5413ae33bafe73b9024f19a73a1964 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:49:07,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:49:07,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:49:07,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:49:07,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:49:07,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:49:07,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:49:07,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:49:07,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:49:07,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:49:07,098 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:49:07,099 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:49:07,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:49:07,102 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:49:07,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:49:07,105 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:49:07,106 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:49:07,106 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:49:07,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:49:07,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:49:07,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:49:07,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:49:07,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:49:07,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:49:07,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:49:07,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:49:07,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:49:07,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:49:07,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:49:07,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:49:07,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:49:07,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:49:07,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:49:07,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:49:07,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:49:07,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:49:07,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:49:07,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:49:07,133 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:49:07,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:49:07,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:49:07,135 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:49:07,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:49:07,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:49:07,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:49:07,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:49:07,172 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:49:07,172 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:49:07,172 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:49:07,173 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:49:07,173 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:49:07,173 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:49:07,173 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:49:07,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:49:07,174 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:49:07,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:49:07,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:49:07,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:49:07,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:49:07,175 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:49:07,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:49:07,176 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:49:07,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:49:07,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:49:07,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:49:07,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:49:07,177 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:49:07,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:49:07,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:49:07,177 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:49:07,179 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:49:07,179 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer 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 -> b6c8e92f4d5413ae33bafe73b9024f19a73a1964 [2019-11-25 08:49:07,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:49:07,361 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:49:07,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:49:07,366 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:49:07,366 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:49:07,367 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/../../sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-25 08:49:07,437 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/data/383e8b052/8e54851c8c0d4144893d7978522595ea/FLAG51c1482da [2019-11-25 08:49:07,808 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:49:07,809 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/sv-benchmarks/c/termination-15/array16_alloca_original.i [2019-11-25 08:49:07,817 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/data/383e8b052/8e54851c8c0d4144893d7978522595ea/FLAG51c1482da [2019-11-25 08:49:08,144 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/data/383e8b052/8e54851c8c0d4144893d7978522595ea [2019-11-25 08:49:08,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:49:08,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:49:08,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:08,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:49:08,152 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:49:08,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282c9ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08, skipping insertion in model container [2019-11-25 08:49:08,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:49:08,193 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:49:08,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:08,628 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:49:08,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:49:08,770 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:49:08,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08 WrapperNode [2019-11-25 08:49:08,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:49:08,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:08,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:49:08,771 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:49:08,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:49:08,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:49:08,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:49:08,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:49:08,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... [2019-11-25 08:49:08,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:49:08,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:49:08,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:49:08,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:49:08,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/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-11-25 08:49:08,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:49:08,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:49:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:49:09,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:49:09,104 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-25 08:49:09,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09 BoogieIcfgContainer [2019-11-25 08:49:09,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:49:09,106 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:49:09,106 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:49:09,109 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:49:09,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:09,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:49:08" (1/3) ... [2019-11-25 08:49:09,118 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cadead8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:09, skipping insertion in model container [2019-11-25 08:49:09,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:09,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:49:08" (2/3) ... [2019-11-25 08:49:09,119 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cadead8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:49:09, skipping insertion in model container [2019-11-25 08:49:09,119 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:49:09,119 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09" (3/3) ... [2019-11-25 08:49:09,122 INFO L371 chiAutomizerObserver]: Analyzing ICFG array16_alloca_original.i [2019-11-25 08:49:09,187 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:49:09,188 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:49:09,188 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:49:09,188 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:49:09,188 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:49:09,188 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:49:09,188 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:49:09,188 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:49:09,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:49:09,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:49:09,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:09,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:09,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:09,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:49:09,226 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:49:09,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:49:09,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:49:09,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:09,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:09,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:49:09,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:49:09,233 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-11-25 08:49:09,234 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume 1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2);havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-11-25 08:49:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,238 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-25 08:49:09,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872704270] [2019-11-25 08:49:09,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,345 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-25 08:49:09,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680425667] [2019-11-25 08:49:09,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:09,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:09,387 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-25 08:49:09,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:09,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105507338] [2019-11-25 08:49:09,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:09,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:09,769 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:09,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:09,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:09,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:09,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:49:09,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:09,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:09,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:09,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration1_Lasso [2019-11-25 08:49:09,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:09,772 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:09,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:09,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:10,267 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:10,272 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,280 INFO L120 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-11-25 08:49:10,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,285 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,302 INFO L120 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-11-25 08:49:10,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,310 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,324 INFO L120 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-11-25 08:49:10,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,333 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,346 INFO L120 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-11-25 08:49:10,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,350 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,362 INFO L120 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-11-25 08:49:10,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,375 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:10,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,400 INFO L120 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-11-25 08:49:10,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,406 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,423 INFO L120 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-11-25 08:49:10,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,446 INFO L120 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-11-25 08:49:10,448 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,448 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:10,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:10,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,469 INFO L120 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-11-25 08:49:10,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,479 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:10,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:10,485 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,500 INFO L120 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-11-25 08:49:10,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:10,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:10,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:10,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:10,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:10,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:49:10,573 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:49:10,573 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:10,588 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:10,592 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:49:10,592 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:49:10,593 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-25 08:49:10,611 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:49:10,624 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:49:10,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:49:10,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:10,766 INFO L377 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-11-25 08:49:10,766 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:49:10,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:49:10,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:49:10,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:49:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:10,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:49:10,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:10,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:10,850 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:49:10,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-25 08:49:10,963 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-25 08:49:10,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:49:10,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:49:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-25 08:49:10,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-25 08:49:10,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:10,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-25 08:49:10,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:10,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-25 08:49:10,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:10,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-25 08:49:10,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:10,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-25 08:49:10,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-25 08:49:10,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:49:10,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-25 08:49:10,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:10,981 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:49:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-25 08:49:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-25 08:49:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:49:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-25 08:49:11,008 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:49:11,008 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:49:11,008 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:49:11,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-25 08:49:11,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:11,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:11,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:11,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:11,011 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-25 08:49:11,011 INFO L796 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 130#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 128#L378-2 [2019-11-25 08:49:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-25 08:49:11,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942752962] [2019-11-25 08:49:11,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:11,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:11,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942752962] [2019-11-25 08:49:11,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:49:11,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:49:11,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271257410] [2019-11-25 08:49:11,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:11,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-25 08:49:11,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394901780] [2019-11-25 08:49:11,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:11,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:11,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:49:11,229 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:49:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:11,282 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-25 08:49:11,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:11,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-25 08:49:11,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:11,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:49:11,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:49:11,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:49:11,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-25 08:49:11,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:49:11,286 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:49:11,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-25 08:49:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-25 08:49:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:49:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-25 08:49:11,288 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:49:11,288 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:49:11,288 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:49:11,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-25 08:49:11,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:11,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:11,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:11,298 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:11,298 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:11,299 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 158#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-25 08:49:11,299 INFO L796 eck$LassoCheckResult]: Loop: 161#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 163#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 161#L378-2 [2019-11-25 08:49:11,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-25 08:49:11,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720943318] [2019-11-25 08:49:11,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-25 08:49:11,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167633897] [2019-11-25 08:49:11,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:11,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:11,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-25 08:49:11,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:11,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865958169] [2019-11-25 08:49:11,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:11,436 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:11,716 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-25 08:49:12,036 WARN L192 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-25 08:49:12,039 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:12,039 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:12,040 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:12,040 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:12,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:49:12,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:12,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:12,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration3_Lasso [2019-11-25 08:49:12,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:12,040 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:12,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,325 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-25 08:49:12,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,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-11-25 08:49:12,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:12,713 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:12,714 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,734 INFO L120 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-11-25 08:49:12,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:12,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:12,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:49:12,740 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,745 INFO L120 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-11-25 08:49:12,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:12,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,747 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:12,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:49:12,749 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:12,770 INFO L120 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-11-25 08:49:12,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,776 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:12,776 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,779 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,794 INFO L120 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-11-25 08:49:12,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:12,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:12,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,814 INFO L120 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-11-25 08:49:12,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:12,821 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:12,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:12,841 INFO L120 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-11-25 08:49:12,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:12,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:12,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:12,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:12,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:12,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:12,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:49:13,012 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-25 08:49:13,012 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:13,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:13,030 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:49:13,030 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:49:13,030 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-11-25 08:49:13,057 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-25 08:49:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:49:13,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:49:13,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:13,135 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-11-25 08:49:13,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-25 08:49:13,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 22 transitions. Complement of second has 5 states. [2019-11-25 08:49:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:49:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-25 08:49:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2019-11-25 08:49:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-25 08:49:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-25 08:49:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:13,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-25 08:49:13,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:13,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-25 08:49:13,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:13,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:49:13,152 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:49:13,152 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:49:13,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-25 08:49:13,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:13,152 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:49:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-25 08:49:13,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-25 08:49:13,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:49:13,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:49:13,155 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:49:13,155 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:49:13,155 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:49:13,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-25 08:49:13,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:13,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:13,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:13,157 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:13,157 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:13,157 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 253#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 254#L367 assume !(main_~length~0 < 1); 265#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 266#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 267#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 255#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 256#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 268#L370-3 assume !(main_~i~0 < main_~length~0); 257#L370-4 main_~j~0 := 0; 258#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 264#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 260#L378-2 [2019-11-25 08:49:13,157 INFO L796 eck$LassoCheckResult]: Loop: 260#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 261#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 260#L378-2 [2019-11-25 08:49:13,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-25 08:49:13,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418818871] [2019-11-25 08:49:13,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-25 08:49:13,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622478074] [2019-11-25 08:49:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,220 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-25 08:49:13,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342027475] [2019-11-25 08:49:13,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:49:13,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342027475] [2019-11-25 08:49:13,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629052314] [2019-11-25 08:49:13,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:49:13,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:49:13,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:49:13,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-25 08:49:13,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885732014] [2019-11-25 08:49:13,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:49:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:49:13,444 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-25 08:49:13,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:13,467 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-11-25 08:49:13,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:49:13,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2019-11-25 08:49:13,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:13,469 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 22 transitions. [2019-11-25 08:49:13,469 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:49:13,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:49:13,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2019-11-25 08:49:13,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:13,469 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2019-11-25 08:49:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2019-11-25 08:49:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-11-25 08:49:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:49:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-11-25 08:49:13,471 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-25 08:49:13,471 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-11-25 08:49:13,471 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:49:13,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-11-25 08:49:13,472 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:13,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:13,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:13,473 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:13,473 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:13,473 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 339#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 340#L367 assume !(main_~length~0 < 1); 347#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 348#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 349#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 337#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 338#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 350#L370-3 assume !(main_~i~0 < main_~length~0); 341#L370-4 main_~j~0 := 0; 342#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 344#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 345#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 346#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 351#L378-2 [2019-11-25 08:49:13,473 INFO L796 eck$LassoCheckResult]: Loop: 351#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 352#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 351#L378-2 [2019-11-25 08:49:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash -645453020, now seen corresponding path program 2 times [2019-11-25 08:49:13,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666832598] [2019-11-25 08:49:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:13,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666832598] [2019-11-25 08:49:13,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671459528] [2019-11-25 08:49:13,603 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:13,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:49:13,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:49:13,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:49:13,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:13,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:13,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-25 08:49:13,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350607889] [2019-11-25 08:49:13,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:13,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:13,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-25 08:49:13,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:13,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842670149] [2019-11-25 08:49:13,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:13,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:13,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:49:13,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:49:13,800 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand 13 states. [2019-11-25 08:49:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:14,016 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-25 08:49:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:49:14,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-25 08:49:14,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:14,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 21 states and 27 transitions. [2019-11-25 08:49:14,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:49:14,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:49:14,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2019-11-25 08:49:14,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:14,020 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2019-11-25 08:49:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2019-11-25 08:49:14,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-25 08:49:14,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:49:14,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-11-25 08:49:14,022 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-25 08:49:14,022 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-11-25 08:49:14,022 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:49:14,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2019-11-25 08:49:14,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:14,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:14,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:14,023 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:14,023 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:14,023 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 449#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 450#L367 assume !(main_~length~0 < 1); 459#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 460#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 461#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 464#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 462#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 463#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 447#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 448#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 465#L370-3 assume !(main_~i~0 < main_~length~0); 451#L370-4 main_~j~0 := 0; 452#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 457#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 456#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 458#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 454#L378-2 [2019-11-25 08:49:14,024 INFO L796 eck$LassoCheckResult]: Loop: 454#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 455#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 454#L378-2 [2019-11-25 08:49:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:14,024 INFO L82 PathProgramCache]: Analyzing trace with hash -685994466, now seen corresponding path program 3 times [2019-11-25 08:49:14,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:14,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742920612] [2019-11-25 08:49:14,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-25 08:49:14,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:14,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110360948] [2019-11-25 08:49:14,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,164 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:14,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:14,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684191, now seen corresponding path program 4 times [2019-11-25 08:49:14,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:14,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387117421] [2019-11-25 08:49:14,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:14,255 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:14,686 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 121 [2019-11-25 08:49:15,069 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 69 [2019-11-25 08:49:15,073 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:49:15,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:49:15,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:49:15,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:49:15,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:49:15,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:49:15,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:49:15,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: array16_alloca_original.i_Iteration6_Lasso [2019-11-25 08:49:15,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:49:15,073 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:49:15,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,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-11-25 08:49:15,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-25 08:49:15,595 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:49:15,595 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,606 INFO L120 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-11-25 08:49:15,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:15,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,608 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:15,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:49:15,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:15,626 INFO L120 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-11-25 08:49:15,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:49:15,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,628 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:49:15,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:15,636 INFO L120 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-11-25 08:49:15,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,638 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,638 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,638 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:15,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:15,654 INFO L120 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-11-25 08:49:15,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:15,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:49:15,685 INFO L120 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-11-25 08:49:15,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:15,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,708 INFO L120 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-11-25 08:49:15,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:49:15,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:49:15,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:49:15,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:49:15,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:49:15,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:49:15,726 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:49:15,765 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-25 08:49:15,766 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 15 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:49:15,768 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-25 08:49:15,771 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:49:15,771 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:49:15,771 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~j~0) = -1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~j~0 + 10 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_3 + 8 >= 0] [2019-11-25 08:49:15,785 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-25 08:49:15,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:15,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 08:49:15,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:15,828 INFO L377 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-11-25 08:49:15,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:49:15,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:49:15,833 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:49:15,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 08:49:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:15,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:49:15,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:15,922 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2019-11-25 08:49:15,922 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 8 states. [2019-11-25 08:49:16,076 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 24 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 35 states and 47 transitions. Complement of second has 11 states. [2019-11-25 08:49:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-11-25 08:49:16,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-25 08:49:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2019-11-25 08:49:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-25 08:49:16,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:16,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-25 08:49:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:16,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 33 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-25 08:49:16,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:49:16,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-25 08:49:16,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:16,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 47 transitions. [2019-11-25 08:49:16,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-25 08:49:16,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-11-25 08:49:16,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-11-25 08:49:16,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:16,082 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-25 08:49:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-11-25 08:49:16,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2019-11-25 08:49:16,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-25 08:49:16,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-25 08:49:16,086 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-25 08:49:16,086 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-25 08:49:16,086 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:49:16,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-25 08:49:16,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:49:16,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:16,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:16,088 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:16,088 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:49:16,088 INFO L794 eck$LassoCheckResult]: Stem: 639#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 635#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 636#L367 assume !(main_~length~0 < 1); 645#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 646#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 649#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 654#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 650#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 651#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 660#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 652#L370-3 assume !(main_~i~0 < main_~length~0); 653#L370-4 main_~j~0 := 0; 659#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 658#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 657#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 655#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 656#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 644#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 640#L378-2 [2019-11-25 08:49:16,088 INFO L796 eck$LassoCheckResult]: Loop: 640#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 641#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 640#L378-2 [2019-11-25 08:49:16,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -2110684189, now seen corresponding path program 5 times [2019-11-25 08:49:16,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618749906] [2019-11-25 08:49:16,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:49:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:49:16,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618749906] [2019-11-25 08:49:16,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200600271] [2019-11-25 08:49:16,505 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:49:16,551 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-25 08:49:16,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:49:16,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 08:49:16,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:49:16,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-25 08:49:16,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:49:16,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:49:16,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:49:16,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2019-11-25 08:49:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:49:16,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:49:16,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2019-11-25 08:49:16,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471142708] [2019-11-25 08:49:16,656 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:49:16,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,656 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 6 times [2019-11-25 08:49:16,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463761123] [2019-11-25 08:49:16,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,662 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:16,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:49:16,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-25 08:49:16,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-25 08:49:16,714 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 16 states. [2019-11-25 08:49:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:49:16,878 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-11-25 08:49:16,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 08:49:16,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-11-25 08:49:16,880 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:49:16,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 42 states and 54 transitions. [2019-11-25 08:49:16,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-25 08:49:16,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-25 08:49:16,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2019-11-25 08:49:16,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:49:16,882 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-11-25 08:49:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2019-11-25 08:49:16,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2019-11-25 08:49:16,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-25 08:49:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2019-11-25 08:49:16,886 INFO L711 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-25 08:49:16,886 INFO L591 BuchiCegarLoop]: Abstraction has 38 states and 50 transitions. [2019-11-25 08:49:16,886 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-25 08:49:16,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 50 transitions. [2019-11-25 08:49:16,887 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:49:16,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:49:16,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:49:16,888 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:49:16,888 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-25 08:49:16,888 INFO L794 eck$LassoCheckResult]: Stem: 787#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 781#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 782#L367 assume !(main_~length~0 < 1); 792#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 793#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 794#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 798#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 802#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 799#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 800#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 795#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 796#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 783#L372 assume !(1 == (if main_#t~mem209 < 0 && 0 != main_#t~mem209 % 2 then main_#t~mem209 % 2 - 2 else main_#t~mem209 % 2));havoc main_#t~mem209; 784#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 801#L370-3 assume !(main_~i~0 < main_~length~0); 785#L370-4 main_~j~0 := 0; 786#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 788#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 789#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 791#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-25 08:49:16,888 INFO L796 eck$LassoCheckResult]: Loop: 810#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 805#L378 assume 0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2);havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := 1 + main_#t~post211;havoc main_#t~post211; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 813#L378 assume !(0 == (if main_#t~mem210 < 0 && 0 != main_#t~mem210 % 2 then main_#t~mem210 % 2 - 2 else main_#t~mem210 % 2));havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := main_#t~post212 - 1;havoc main_#t~post212; 810#L378-2 [2019-11-25 08:49:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1570402076, now seen corresponding path program 6 times [2019-11-25 08:49:16,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118670855] [2019-11-25 08:49:16,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:16,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-25 08:49:16,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986141230] [2019-11-25 08:49:16,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,932 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:49:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash -507624276, now seen corresponding path program 7 times [2019-11-25 08:49:16,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:49:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130728197] [2019-11-25 08:49:16,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:49:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:49:16,995 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:49:17,624 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 144 [2019-11-25 08:49:18,983 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 190 DAG size of output: 78 [2019-11-25 08:49:19,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:49:19 BoogieIcfgContainer [2019-11-25 08:49:19,020 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:49:19,020 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:49:19,020 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:49:19,020 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:49:19,021 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:49:09" (3/4) ... [2019-11-25 08:49:19,024 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:49:19,066 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7af1a9da-e5e6-45ca-a196-763ec55f72ce/bin/uautomizer/witness.graphml [2019-11-25 08:49:19,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:49:19,069 INFO L168 Benchmark]: Toolchain (without parser) took 10920.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.8 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -252.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:19,069 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:19,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:19,070 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:19,070 INFO L168 Benchmark]: Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:49:19,070 INFO L168 Benchmark]: RCFGBuilder took 273.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:19,071 INFO L168 Benchmark]: BuchiAutomizer took 9913.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.6 MB). Peak memory consumption was 307.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:19,071 INFO L168 Benchmark]: Witness Printer took 46.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:49:19,075 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9913.80 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 66.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -95.6 MB). Peak memory consumption was 307.7 MB. Max. memory is 11.5 GB. * Witness Printer took 46.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function -1 * j + length and consists of 3 locations. One deterministic module has affine ranking function -1 * arr + -4 * j + 10 and consists of 9 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. The remainder module has 38 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 8.4s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 7. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 66 SDtfs, 164 SDslu, 95 SDs, 0 SdLazy, 298 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU3 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf99 lsp80 ukn92 mio100 lsp51 div161 bol100 ite100 ukn100 eq156 hnf65 smp92 dnf109 smp98 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@68b29158=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1e1d11da=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e482c2=0, length=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@421a2b40=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6e482c2=2, j=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@747c2972=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@366becd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@38946787=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@467a9ac9=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i