./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/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 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-15 22:45:21,941 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:45:21,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:45:21,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:45:21,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:45:21,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:45:21,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:45:21,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:45:21,993 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:45:21,996 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:45:21,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:45:22,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:45:22,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:45:22,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:45:22,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:45:22,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:45:22,006 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:45:22,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:45:22,010 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:45:22,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:45:22,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:45:22,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:45:22,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:45:22,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:45:22,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:45:22,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:45:22,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:45:22,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:45:22,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:45:22,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:45:22,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:45:22,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:45:22,028 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:45:22,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:45:22,030 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:45:22,030 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:45:22,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:45:22,031 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:45:22,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:45:22,033 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:45:22,033 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:45:22,034 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 22:45:22,053 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:45:22,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:45:22,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:45:22,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:45:22,056 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:45:22,057 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:45:22,057 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:45:22,057 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:45:22,058 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:45:22,058 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:45:22,058 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:45:22,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:45:22,059 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:45:22,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:45:22,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:45:22,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:45:22,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:45:22,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:45:22,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:45:22,061 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:45:22,062 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:45:22,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:45:22,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:45:22,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:45:22,063 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:45:22,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:45:22,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:45:22,064 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:45:22,065 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:45:22,066 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_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/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 -> 2f8c9504db0ceae8da468539322e1d0ba6c4e9f7 [2019-11-15 22:45:22,103 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:45:22,123 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:45:22,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:45:22,132 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:45:22,132 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:45:22,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-15 22:45:22,227 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/data/6bb219c26/60d3be8c8bb9444590391ac464f78fb2/FLAG4e564395f [2019-11-15 22:45:22,927 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:45:22,928 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/sv-benchmarks/c/termination-memory-alloca/Velroyen-alloca.i [2019-11-15 22:45:22,947 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/data/6bb219c26/60d3be8c8bb9444590391ac464f78fb2/FLAG4e564395f [2019-11-15 22:45:23,155 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/data/6bb219c26/60d3be8c8bb9444590391ac464f78fb2 [2019-11-15 22:45:23,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:45:23,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:45:23,169 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:23,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:45:23,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:45:23,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed23c07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23, skipping insertion in model container [2019-11-15 22:45:23,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,186 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:45:23,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:45:23,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:23,646 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:45:23,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:45:23,762 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:45:23,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23 WrapperNode [2019-11-15 22:45:23,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:45:23,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:23,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:45:23,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:45:23,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,811 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:45:23,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:45:23,812 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:45:23,812 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:45:23,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,835 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,836 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... [2019-11-15 22:45:23,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:45:23,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:45:23,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:45:23,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:45:23,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/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-15 22:45:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:45:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:45:23,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:45:23,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:45:23,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:45:23,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:45:24,292 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:45:24,292 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 22:45:24,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:24 BoogieIcfgContainer [2019-11-15 22:45:24,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:45:24,294 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:45:24,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:45:24,298 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:45:24,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:24,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:45:23" (1/3) ... [2019-11-15 22:45:24,301 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75cd302e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:24, skipping insertion in model container [2019-11-15 22:45:24,301 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:24,301 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:45:23" (2/3) ... [2019-11-15 22:45:24,302 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75cd302e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:45:24, skipping insertion in model container [2019-11-15 22:45:24,302 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:45:24,302 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:24" (3/3) ... [2019-11-15 22:45:24,305 INFO L371 chiAutomizerObserver]: Analyzing ICFG Velroyen-alloca.i [2019-11-15 22:45:24,357 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:45:24,358 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:45:24,358 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:45:24,358 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:45:24,358 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:45:24,358 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:45:24,359 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:45:24,359 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:45:24,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 22:45:24,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:24,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:24,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:24,410 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:45:24,411 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:24,411 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:45:24,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-15 22:45:24,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:24,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:24,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:24,414 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 22:45:24,414 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:24,423 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 14#L552-3true [2019-11-15 22:45:24,424 INFO L793 eck$LassoCheckResult]: Loop: 14#L552-3true call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 11#L551-1true assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 8#L552true assume !main_#t~short7; 12#L552-2true assume !main_#t~short7;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 14#L552-3true [2019-11-15 22:45:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 22:45:24,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:24,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542176788] [2019-11-15 22:45:24,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,440 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,595 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:24,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1144151, now seen corresponding path program 1 times [2019-11-15 22:45:24,597 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:24,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252595943] [2019-11-15 22:45:24,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:24,631 INFO L82 PathProgramCache]: Analyzing trace with hash 889571353, now seen corresponding path program 1 times [2019-11-15 22:45:24,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:24,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244863928] [2019-11-15 22:45:24,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,632 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:24,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:24,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:24,835 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-11-15 22:45:25,049 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 22:45:25,121 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:45:25,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:45:25,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:45:25,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:45:25,123 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:45:25,123 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:45:25,123 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:45:25,123 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:45:25,124 INFO L131 ssoRankerPreferences]: Filename of dumped script: Velroyen-alloca.i_Iteration1_Lasso [2019-11-15 22:45:25,124 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:45:25,124 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:45:25,162 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-15 22:45:25,170 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-15 22:45:25,176 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-15 22:45:25,181 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-15 22:45:25,187 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-15 22:45:25,191 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-15 22:45:25,199 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-15 22:45:25,202 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-15 22:45:25,206 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-15 22:45:25,212 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-15 22:45:25,218 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-15 22:45:25,221 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-15 22:45:25,226 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-15 22:45:25,232 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-15 22:45:25,388 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-15 22:45:25,392 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-15 22:45:25,785 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:45:25,793 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:45:25,796 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-15 22:45:25,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,800 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,801 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,805 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,805 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,811 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,816 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-15 22:45:25,818 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,820 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,821 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,828 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-15 22:45:25,835 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,835 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,837 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,839 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,856 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-15 22:45:25,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,858 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,859 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,861 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-15 22:45:25,862 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,863 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,863 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,864 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,864 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,879 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-15 22:45:25,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,882 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,885 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,885 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:25,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,892 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-15 22:45:25,893 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,901 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,904 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-15 22:45:25,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,908 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,909 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:25,913 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,914 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-15 22:45:25,915 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,916 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,916 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,916 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,921 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:25,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,930 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-15 22:45:25,931 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,931 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,931 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,932 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,934 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,934 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:25,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,962 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-15 22:45:25,963 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:45:25,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,964 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:45:25,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:45:25,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,967 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-15 22:45:25,967 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,968 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,970 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,971 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:25,980 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:25,981 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-15 22:45:25,982 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:25,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:25,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:25,983 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:25,989 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:25,989 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:26,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:26,012 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-15 22:45:26,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:26,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:26,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:26,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:26,022 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:26,022 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:26,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:45:26,048 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-15 22:45:26,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:45:26,049 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:45:26,049 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:45:26,049 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:45:26,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:45:26,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:45:26,086 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:45:26,112 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:45:26,113 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:45:26,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:45:26,118 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:45:26,118 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:45:26,119 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2019-11-15 22:45:26,137 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:45:26,148 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:45:26,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:26,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:45:26,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:26,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 22:45:26,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:45:26,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 22:45:26,337 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-15 22:45:26,360 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 22:45:26,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-15 22:45:26,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 42 states and 56 transitions. Complement of second has 10 states. [2019-11-15 22:45:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 22:45:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 22:45:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2019-11-15 22:45:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 22:45:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-15 22:45:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 8 letters. [2019-11-15 22:45:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:45:26,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2019-11-15 22:45:26,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:26,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 35 transitions. [2019-11-15 22:45:26,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-15 22:45:26,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-15 22:45:26,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2019-11-15 22:45:26,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:26,622 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2019-11-15 22:45:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2019-11-15 22:45:26,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-11-15 22:45:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:45:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-15 22:45:26,670 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 22:45:26,671 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-15 22:45:26,671 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:45:26,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-15 22:45:26,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:26,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:26,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:26,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:26,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 22:45:26,676 INFO L791 eck$LassoCheckResult]: Stem: 123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 117#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 129#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 130#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 125#L552-2 [2019-11-15 22:45:26,677 INFO L793 eck$LassoCheckResult]: Loop: 125#L552-2 assume !main_#t~short7;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5;call write~int(0, main_~x~0.base, main_~x~0.offset, 4); 128#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 133#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 124#L552 assume !main_#t~short7; 125#L552-2 [2019-11-15 22:45:26,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:26,678 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-15 22:45:26,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:26,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850681523] [2019-11-15 22:45:26,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:26,743 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:26,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:26,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1943531, now seen corresponding path program 2 times [2019-11-15 22:45:26,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:26,745 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815030877] [2019-11-15 22:45:26,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,745 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:26,819 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-15 22:45:26,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815030877] [2019-11-15 22:45:26,820 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:26,820 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:45:26,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596104674] [2019-11-15 22:45:26,824 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:45:26,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:26,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:26,830 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-11-15 22:45:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:26,891 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-11-15 22:45:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:26,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2019-11-15 22:45:26,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:26,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 27 transitions. [2019-11-15 22:45:26,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:45:26,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-15 22:45:26,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 22:45:26,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:26,897 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:45:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 22:45:26,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-15 22:45:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-15 22:45:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2019-11-15 22:45:26,900 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:45:26,900 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:45:26,901 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:45:26,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2019-11-15 22:45:26,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:45:26,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:26,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:26,903 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:26,904 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:26,904 INFO L791 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 171#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 184#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 178#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 180#L552-2 [2019-11-15 22:45:26,905 INFO L793 eck$LassoCheckResult]: Loop: 180#L552-2 assume main_#t~short7;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 187#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 183#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 186#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 189#L552 assume !main_#t~short7; 180#L552-2 [2019-11-15 22:45:26,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:26,905 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 2 times [2019-11-15 22:45:26,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:26,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142951203] [2019-11-15 22:45:26,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:26,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:26,954 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:26,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash 48745192, now seen corresponding path program 1 times [2019-11-15 22:45:26,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:26,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143734089] [2019-11-15 22:45:26,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:26,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:45:27,018 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-15 22:45:27,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143734089] [2019-11-15 22:45:27,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:45:27,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:45:27,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601223278] [2019-11-15 22:45:27,019 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 22:45:27,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:45:27,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:45:27,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:45:27,020 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-15 22:45:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:45:27,118 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-11-15 22:45:27,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:45:27,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2019-11-15 22:45:27,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-11-15 22:45:27,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 38 transitions. [2019-11-15 22:45:27,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 22:45:27,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 22:45:27,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-15 22:45:27,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:45:27,123 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 22:45:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-15 22:45:27,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-11-15 22:45:27,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-15 22:45:27,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-11-15 22:45:27,129 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 22:45:27,129 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-11-15 22:45:27,129 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:45:27,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-11-15 22:45:27,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-15 22:45:27,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:45:27,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:45:27,136 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:27,136 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 22:45:27,139 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 230#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~nondet3, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem4, main_~x~0.base, main_~x~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call write~int(main_#t~nondet3, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet3; 231#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 247#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 249#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-15 22:45:27,139 INFO L793 eck$LassoCheckResult]: Loop: 239#L552-2 assume main_#t~short7;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem5;call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); 252#L553 assume main_#t~mem8 < 0;havoc main_#t~mem8;call write~int(-5, main_~x~0.base, main_~x~0.offset, 4); 235#L552-3 call main_#t~mem4 := read~int(main_~x~0.base, main_~x~0.offset, 4); 244#L551-1 assume !!(0 != main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := -5 <= main_#t~mem5; 238#L552 assume main_#t~short7;call main_#t~mem6 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem6 <= 35; 239#L552-2 [2019-11-15 22:45:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 3 times [2019-11-15 22:45:27,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:27,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556931101] [2019-11-15 22:45:27,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,145 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,192 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:27,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 48745190, now seen corresponding path program 1 times [2019-11-15 22:45:27,194 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:27,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587461035] [2019-11-15 22:45:27,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,195 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,230 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:45:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash 707540352, now seen corresponding path program 1 times [2019-11-15 22:45:27,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:45:27,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857923200] [2019-11-15 22:45:27,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:45:27,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:45:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:45:27,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:45:27,395 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-11-15 22:45:27,690 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 64 [2019-11-15 22:45:28,017 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2019-11-15 22:45:28,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:45:28 BoogieIcfgContainer [2019-11-15 22:45:28,061 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:45:28,075 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:45:28,075 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:45:28,076 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:45:28,077 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:45:24" (3/4) ... [2019-11-15 22:45:28,081 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 22:45:28,145 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f55f5f1f-dc4a-4aa1-a4a9-6158b51f5339/bin/uautomizer/witness.graphml [2019-11-15 22:45:28,146 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:45:28,160 INFO L168 Benchmark]: Toolchain (without parser) took 4987.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.3 MB in the beginning and 814.6 MB in the end (delta: 124.7 MB). Peak memory consumption was 247.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:28,160 INFO L168 Benchmark]: CDTParser took 0.37 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-15 22:45:28,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:28,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.67 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:28,163 INFO L168 Benchmark]: Boogie Preprocessor took 27.74 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-15 22:45:28,164 INFO L168 Benchmark]: RCFGBuilder took 454.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.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:28,165 INFO L168 Benchmark]: BuchiAutomizer took 3767.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 814.6 MB in the end (delta: 261.2 MB). Peak memory consumption was 261.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:45:28,165 INFO L168 Benchmark]: Witness Printer took 70.77 ms. Allocated memory is still 1.2 GB. Free memory is still 814.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:45:28,181 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.37 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 595.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.67 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.74 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 454.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.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3767.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 814.6 MB in the end (delta: 261.2 MB). Peak memory consumption was 261.2 MB. Max. memory is 11.5 GB. * Witness Printer took 70.77 ms. Allocated memory is still 1.2 GB. Free memory is still 814.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 23 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 29 SDtfs, 16 SDslu, 27 SDs, 0 SdLazy, 75 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax117 hnf100 lsp77 ukn72 mio100 lsp40 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf120 smp100 tf100 neg94 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms 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: 552]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=0} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29c8cdc8=-1, NULL=0, \result=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4ffd0a2=0, NULL=0, x=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29c8cdc8=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@2a49c0f=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@25249e9a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@6d5efb33=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@426f23c2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@41b4bf32=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@3284246b=-5, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@46d89196=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 552]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L549] int* x = __builtin_alloca (sizeof(int)); [L550] *x = __VERIFIER_nondet_int() [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 Loop: [L552] COND TRUE -5 <= *x && *x <= 35 [L553] EXPR \read(*x) [L553] COND TRUE *x < 0 [L554] *x = -5 [L551] EXPR \read(*x) [L551] COND TRUE *x != 0 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 [L552] EXPR \read(*x) [L552] -5 <= *x && *x <= 35 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...