./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/max05-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/max05-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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 32bit --witnessprinter.graph.data.programhash d02fdead04c3e6f93d11e2edd6641f56f1584022 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:58:53,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:58:53,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:58:53,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:58:53,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:58:53,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:58:53,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:58:53,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:58:53,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:58:53,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:58:53,301 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:58:53,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:58:53,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:58:53,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:58:53,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:58:53,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:58:53,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:58:53,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:58:53,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:58:53,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:58:53,310 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:58:53,311 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:58:53,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:58:53,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:58:53,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:58:53,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:58:53,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:58:53,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:58:53,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:58:53,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:58:53,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:58:53,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:58:53,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:58:53,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:58:53,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:58:53,318 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:58:53,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:58:53,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:58:53,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:58:53,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:58:53,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:58:53,320 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 11:58:53,332 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:58:53,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:58:53,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:58:53,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:58:53,333 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:58:53,333 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 11:58:53,333 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 11:58:53,333 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 11:58:53,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 11:58:53,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:58:53,335 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 11:58:53,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 11:58:53,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:58:53,336 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:58:53,337 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 11:58:53,337 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 11:58:53,337 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_f4b086da-babd-4e5c-88f6-2a5496e83957/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d02fdead04c3e6f93d11e2edd6641f56f1584022 [2019-12-07 11:58:53,436 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:58:53,443 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:58:53,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:58:53,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:58:53,447 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:58:53,447 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/max05-1.i [2019-12-07 11:58:53,485 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/data/90a81e7c2/1986c6cf3c5543a6a1c70a7b9542ae6e/FLAGbea104820 [2019-12-07 11:58:53,912 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:58:53,912 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/sv-benchmarks/c/reducercommutativity/max05-1.i [2019-12-07 11:58:53,916 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/data/90a81e7c2/1986c6cf3c5543a6a1c70a7b9542ae6e/FLAGbea104820 [2019-12-07 11:58:53,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/data/90a81e7c2/1986c6cf3c5543a6a1c70a7b9542ae6e [2019-12-07 11:58:53,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:58:53,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:58:53,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:58:53,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:58:53,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:58:53,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:58:53" (1/1) ... [2019-12-07 11:58:53,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:53, skipping insertion in model container [2019-12-07 11:58:53,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:58:53" (1/1) ... [2019-12-07 11:58:53,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:58:53,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:58:54,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:58:54,093 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:58:54,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:58:54,122 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:58:54,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54 WrapperNode [2019-12-07 11:58:54,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:58:54,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:58:54,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:58:54,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:58:54,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,134 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:58:54,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:58:54,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:58:54,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:58:54,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... [2019-12-07 11:58:54,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:58:54,169 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:58:54,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:58:54,169 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:58:54,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:58:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:58:54,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:58:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:58:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:58:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:58:54,374 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:58:54,374 INFO L287 CfgBuilder]: Removed 15 assume(true) statements. [2019-12-07 11:58:54,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:58:54 BoogieIcfgContainer [2019-12-07 11:58:54,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:58:54,376 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 11:58:54,376 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 11:58:54,378 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 11:58:54,379 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:58:54,379 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 11:58:53" (1/3) ... [2019-12-07 11:58:54,379 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd4c47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:58:54, skipping insertion in model container [2019-12-07 11:58:54,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:58:54,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:58:54" (2/3) ... [2019-12-07 11:58:54,380 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@bd4c47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 11:58:54, skipping insertion in model container [2019-12-07 11:58:54,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 11:58:54,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:58:54" (3/3) ... [2019-12-07 11:58:54,381 INFO L371 chiAutomizerObserver]: Analyzing ICFG max05-1.i [2019-12-07 11:58:54,410 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 11:58:54,410 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 11:58:54,410 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 11:58:54,410 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:58:54,410 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:58:54,410 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 11:58:54,410 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:58:54,410 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 11:58:54,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-12-07 11:58:54,434 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-12-07 11:58:54,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:54,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:54,438 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 11:58:54,438 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:58:54,438 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 11:58:54,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states. [2019-12-07 11:58:54,440 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 16 [2019-12-07 11:58:54,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:54,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:54,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-12-07 11:58:54,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:58:54,447 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 30#L23-3true [2019-12-07 11:58:54,447 INFO L796 eck$LassoCheckResult]: Loop: 30#L23-3true assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 10#L23-2true main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 30#L23-3true [2019-12-07 11:58:54,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-12-07 11:58:54,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:54,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667157794] [2019-12-07 11:58:54,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-12-07 11:58:54,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:54,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959381149] [2019-12-07 11:58:54,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:54,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:54,545 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-12-07 11:58:54,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:54,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847027725] [2019-12-07 11:58:54,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:54,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:54,667 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:58:54,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:58:54,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:58:54,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:58:54,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:58:54,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:58:54,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:58:54,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration1_Lasso [2019-12-07 11:58:54,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:58:54,668 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:58:54,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:54,845 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:58:54,848 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,853 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-12-07 11:58:54,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:54,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:54,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:54,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,866 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-12-07 11:58:54,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:54,871 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:54,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,880 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-12-07 11:58:54,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:54,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:54,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,895 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-12-07 11:58:54,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:54,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,897 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:54,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:54,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,903 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-12-07 11:58:54,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:54,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:54,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,915 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-12-07 11:58:54,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:54,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:54,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:54,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,927 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-12-07 11:58:54,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:54,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:54,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:54,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:54,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:54,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:54,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:58:54,965 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2019-12-07 11:58:54,965 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:54,971 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:58:54,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:58:54,974 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:58:54,974 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1) = -8*ULTIMATE.start_main_~i~1 + 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 Supporting invariants [] [2019-12-07 11:58:54,980 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-12-07 11:58:54,986 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:58:55,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,016 INFO L264 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,017 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,026 WARN L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,026 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,057 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-12-07 11:58:55,058 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states. Second operand 3 states. [2019-12-07 11:58:55,143 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states.. Second operand 3 states. Result 84 states and 119 transitions. Complement of second has 8 states. [2019-12-07 11:58:55,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 11:58:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:58:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-12-07 11:58:55,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-12-07 11:58:55,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:55,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-12-07 11:58:55,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:55,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-12-07 11:58:55,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:55,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 119 transitions. [2019-12-07 11:58:55,152 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 25 states and 33 transitions. [2019-12-07 11:58:55,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-12-07 11:58:55,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2019-12-07 11:58:55,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,157 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-12-07 11:58:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2019-12-07 11:58:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-12-07 11:58:55,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:58:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-12-07 11:58:55,177 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-12-07 11:58:55,177 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-12-07 11:58:55,177 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 11:58:55,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-12-07 11:58:55,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,178 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-12-07 11:58:55,178 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,179 INFO L794 eck$LassoCheckResult]: Stem: 181#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 178#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 175#L23-3 assume !(main_~i~1 < 5); 174#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 163#L9-3 [2019-12-07 11:58:55,179 INFO L796 eck$LassoCheckResult]: Loop: 163#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 164#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 173#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 168#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 163#L9-3 [2019-12-07 11:58:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-12-07 11:58:55,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156223656] [2019-12-07 11:58:55,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156223656] [2019-12-07 11:58:55,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:58:55,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:58:55,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612171505] [2019-12-07 11:58:55,208 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 1 times [2019-12-07 11:58:55,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302029748] [2019-12-07 11:58:55,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:58:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:58:55,254 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-12-07 11:58:55,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:55,264 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-12-07 11:58:55,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:58:55,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-12-07 11:58:55,265 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 33 transitions. [2019-12-07 11:58:55,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:58:55,266 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-12-07 11:58:55,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,267 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-12-07 11:58:55,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-12-07 11:58:55,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-12-07 11:58:55,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 11:58:55,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-12-07 11:58:55,269 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-12-07 11:58:55,269 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-12-07 11:58:55,269 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 11:58:55,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2019-12-07 11:58:55,269 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,270 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-12-07 11:58:55,270 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,270 INFO L794 eck$LassoCheckResult]: Stem: 238#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 235#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 232#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 233#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 234#L23-3 assume !(main_~i~1 < 5); 231#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 220#L9-3 [2019-12-07 11:58:55,270 INFO L796 eck$LassoCheckResult]: Loop: 220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 221#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 230#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 225#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 220#L9-3 [2019-12-07 11:58:55,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-12-07 11:58:55,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395070400] [2019-12-07 11:58:55,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395070400] [2019-12-07 11:58:55,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404238017] [2019-12-07 11:58:55,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:55,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 11:58:55,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557004933] [2019-12-07 11:58:55,324 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:55,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 2 times [2019-12-07 11:58:55,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813142753] [2019-12-07 11:58:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,333 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:58:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:58:55,362 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-12-07 11:58:55,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:55,374 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-12-07 11:58:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:58:55,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-12-07 11:58:55,376 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-12-07 11:58:55,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:58:55,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-12-07 11:58:55,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,377 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-12-07 11:58:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-12-07 11:58:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-12-07 11:58:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-07 11:58:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-12-07 11:58:55,379 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-12-07 11:58:55,379 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-12-07 11:58:55,379 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 11:58:55,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-12-07 11:58:55,379 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,380 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-12-07 11:58:55,380 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,380 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 312#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 308#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 309#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 310#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 311#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 318#L23-3 assume !(main_~i~1 < 5); 307#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 296#L9-3 [2019-12-07 11:58:55,380 INFO L796 eck$LassoCheckResult]: Loop: 296#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 297#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 306#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 301#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 296#L9-3 [2019-12-07 11:58:55,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,380 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-12-07 11:58:55,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864341261] [2019-12-07 11:58:55,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864341261] [2019-12-07 11:58:55,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664195853] [2019-12-07 11:58:55,404 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:55,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:58:55,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:58:55,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,429 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:55,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 11:58:55,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975347364] [2019-12-07 11:58:55,436 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 3 times [2019-12-07 11:58:55,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783066723] [2019-12-07 11:58:55,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,444 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:55,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:58:55,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:58:55,473 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-12-07 11:58:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:55,487 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2019-12-07 11:58:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:58:55,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2019-12-07 11:58:55,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 37 transitions. [2019-12-07 11:58:55,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:58:55,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 37 transitions. [2019-12-07 11:58:55,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,489 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-12-07 11:58:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 37 transitions. [2019-12-07 11:58:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-12-07 11:58:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 11:58:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-12-07 11:58:55,491 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-12-07 11:58:55,491 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-12-07 11:58:55,491 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 11:58:55,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-12-07 11:58:55,492 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-12-07 11:58:55,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,492 INFO L794 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 399#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 395#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 396#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 397#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 398#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 400#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 407#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 406#L23-3 assume !(main_~i~1 < 5); 394#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 383#L9-3 [2019-12-07 11:58:55,493 INFO L796 eck$LassoCheckResult]: Loop: 383#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 384#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 393#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 388#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 383#L9-3 [2019-12-07 11:58:55,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-12-07 11:58:55,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543003609] [2019-12-07 11:58:55,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543003609] [2019-12-07 11:58:55,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493939605] [2019-12-07 11:58:55,521 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:55,547 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-12-07 11:58:55,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:58:55,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,548 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:55,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 11:58:55,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966567331] [2019-12-07 11:58:55,555 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:55,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 4 times [2019-12-07 11:58:55,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477927369] [2019-12-07 11:58:55,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,564 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:55,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:58:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:58:55,597 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-12-07 11:58:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:55,612 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2019-12-07 11:58:55,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:58:55,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2019-12-07 11:58:55,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 39 transitions. [2019-12-07 11:58:55,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:58:55,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 39 transitions. [2019-12-07 11:58:55,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,614 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-12-07 11:58:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 39 transitions. [2019-12-07 11:58:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-12-07 11:58:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 11:58:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2019-12-07 11:58:55,615 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-12-07 11:58:55,615 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2019-12-07 11:58:55,615 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-12-07 11:58:55,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2019-12-07 11:58:55,616 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-12-07 11:58:55,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,616 INFO L794 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 497#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 493#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 494#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 495#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 496#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 507#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 506#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 505#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 504#L23-3 assume !(main_~i~1 < 5); 492#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 481#L9-3 [2019-12-07 11:58:55,616 INFO L796 eck$LassoCheckResult]: Loop: 481#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 482#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 491#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 486#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 481#L9-3 [2019-12-07 11:58:55,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-12-07 11:58:55,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378872558] [2019-12-07 11:58:55,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:55,648 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378872558] [2019-12-07 11:58:55,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54383472] [2019-12-07 11:58:55,648 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:55,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 11:58:55,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:58:55,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:58:55,678 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:55,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:55,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 11:58:55,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046889487] [2019-12-07 11:58:55,684 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 5 times [2019-12-07 11:58:55,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968787335] [2019-12-07 11:58:55,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:58:55,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:58:55,722 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 8 states. [2019-12-07 11:58:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:55,738 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-12-07 11:58:55,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:58:55,739 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2019-12-07 11:58:55,739 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2019-12-07 11:58:55,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-12-07 11:58:55,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-12-07 11:58:55,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2019-12-07 11:58:55,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:55,740 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-12-07 11:58:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2019-12-07 11:58:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-12-07 11:58:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-07 11:58:55,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-12-07 11:58:55,742 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-12-07 11:58:55,742 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-12-07 11:58:55,742 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-12-07 11:58:55,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 40 transitions. [2019-12-07 11:58:55,742 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-12-07 11:58:55,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:55,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:55,743 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-12-07 11:58:55,743 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:55,743 INFO L794 eck$LassoCheckResult]: Stem: 606#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 605#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 601#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 602#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 603#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 604#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 617#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 616#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 615#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 614#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 613#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 612#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 611#L23-3 assume !(main_~i~1 < 5); 600#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 589#L9-3 [2019-12-07 11:58:55,743 INFO L796 eck$LassoCheckResult]: Loop: 589#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 590#L10 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 599#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 594#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 589#L9-3 [2019-12-07 11:58:55,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-12-07 11:58:55,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268357267] [2019-12-07 11:58:55,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1665446, now seen corresponding path program 6 times [2019-12-07 11:58:55,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772043389] [2019-12-07 11:58:55,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:55,769 INFO L82 PathProgramCache]: Analyzing trace with hash -743539014, now seen corresponding path program 1 times [2019-12-07 11:58:55,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:55,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654364630] [2019-12-07 11:58:55,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:55,796 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:56,165 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 101 [2019-12-07 11:58:56,228 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:58:56,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:58:56,229 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:58:56,229 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:58:56,229 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:58:56,229 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,229 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:58:56,229 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:58:56,229 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration7_Lasso [2019-12-07 11:58:56,229 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:58:56,229 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:58:56,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:58:56,475 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:58:56,475 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,479 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-12-07 11:58:56,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,481 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,485 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-12-07 11:58:56,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,488 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,494 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-12-07 11:58:56,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,501 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-12-07 11:58:56,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,508 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-12-07 11:58:56,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,510 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:56,510 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:56,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,517 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-12-07 11:58:56,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,518 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,525 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-12-07 11:58:56,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,526 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,532 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-12-07 11:58:56,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,534 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,540 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-12-07 11:58:56,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,543 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,551 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-12-07 11:58:56,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,553 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,554 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,559 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-12-07 11:58:56,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:56,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:56,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,568 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-12-07 11:58:56,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,570 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,574 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-12-07 11:58:56,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,576 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,576 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,577 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,583 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-12-07 11:58:56,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/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-12-07 11:58:56,590 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-12-07 11:58:56,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,597 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-12-07 11:58:56,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,604 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-12-07 11:58:56,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:58:56,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:58:56,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:58:56,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,611 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-12-07 11:58:56,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:58:56,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:58:56,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:58:56,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:58:56,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:58:56,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:58:56,624 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:58:56,653 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-12-07 11:58:56,653 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:58:56,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:58:56,659 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:58:56,659 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:58:56,660 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2, ULTIMATE.start_max_~i~0) = 9*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_2 - 8*ULTIMATE.start_max_~i~0 Supporting invariants [] [2019-12-07 11:58:56,666 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-12-07 11:58:56,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-12-07 11:58:56,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:56,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:58:56,707 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:56,712 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 11:58:56,712 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:58:56,728 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-12-07 11:58:56,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-12-07 11:58:56,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 40 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 7 states. [2019-12-07 11:58:56,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-12-07 11:58:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 11:58:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-12-07 11:58:56,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 4 letters. [2019-12-07 11:58:56,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:56,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 18 letters. Loop has 4 letters. [2019-12-07 11:58:56,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:56,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 14 letters. Loop has 8 letters. [2019-12-07 11:58:56,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:58:56,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-12-07 11:58:56,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:56,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 34 states and 42 transitions. [2019-12-07 11:58:56,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-12-07 11:58:56,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-12-07 11:58:56,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-12-07 11:58:56,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:56,762 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-12-07 11:58:56,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-12-07 11:58:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 11:58:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 11:58:56,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-12-07 11:58:56,764 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-12-07 11:58:56,764 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-12-07 11:58:56,764 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-12-07 11:58:56,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2019-12-07 11:58:56,765 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:56,765 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:56,765 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:56,765 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:56,765 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:56,765 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 773#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 769#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 770#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 771#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 772#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 785#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 784#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 783#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 782#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 781#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 780#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 779#L23-3 assume !(main_~i~1 < 5); 768#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 756#L9-3 assume !(max_~i~0 < 5); 752#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 753#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 777#L9-8 [2019-12-07 11:58:56,766 INFO L796 eck$LassoCheckResult]: Loop: 777#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 763#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 754#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 755#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 777#L9-8 [2019-12-07 11:58:56,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:56,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1638581251, now seen corresponding path program 1 times [2019-12-07 11:58:56,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:56,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727490864] [2019-12-07 11:58:56,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 11:58:56,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727490864] [2019-12-07 11:58:56,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:58:56,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:58:56,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124901627] [2019-12-07 11:58:56,804 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:56,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:56,804 INFO L82 PathProgramCache]: Analyzing trace with hash 2373478, now seen corresponding path program 1 times [2019-12-07 11:58:56,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:56,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75344530] [2019-12-07 11:58:56,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:56,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:56,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:56,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:58:56,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:58:56,836 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-12-07 11:58:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:56,854 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2019-12-07 11:58:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:58:56,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 55 transitions. [2019-12-07 11:58:56,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:56,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 55 transitions. [2019-12-07 11:58:56,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-12-07 11:58:56,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-12-07 11:58:56,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 55 transitions. [2019-12-07 11:58:56,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:56,856 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 55 transitions. [2019-12-07 11:58:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 55 transitions. [2019-12-07 11:58:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-12-07 11:58:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-07 11:58:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2019-12-07 11:58:56,859 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-12-07 11:58:56,859 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 42 transitions. [2019-12-07 11:58:56,859 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-12-07 11:58:56,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 42 transitions. [2019-12-07 11:58:56,859 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:56,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:56,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:56,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:56,860 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:56,861 INFO L794 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 858#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 854#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 855#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 856#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 857#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 871#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 870#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 869#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 868#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 867#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 866#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 865#L23-3 assume !(main_~i~1 < 5); 853#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 841#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 842#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 852#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 847#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 843#L9-3 assume !(max_~i~0 < 5); 837#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 838#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 862#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 848#L10-3 [2019-12-07 11:58:56,861 INFO L796 eck$LassoCheckResult]: Loop: 848#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 839#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 840#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 864#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 848#L10-3 [2019-12-07 11:58:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1336698829, now seen corresponding path program 1 times [2019-12-07 11:58:56,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:56,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208719751] [2019-12-07 11:58:56,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 11:58:56,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208719751] [2019-12-07 11:58:56,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003780667] [2019-12-07 11:58:56,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:56,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:58:56,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:56,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 11:58:56,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:56,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-07 11:58:56,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009076740] [2019-12-07 11:58:56,937 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:56,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:56,937 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 2 times [2019-12-07 11:58:56,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:56,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580293224] [2019-12-07 11:58:56,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:56,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:56,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:56,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:58:56,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:58:56,990 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-12-07 11:58:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:57,026 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2019-12-07 11:58:57,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:58:57,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 70 transitions. [2019-12-07 11:58:57,027 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 70 transitions. [2019-12-07 11:58:57,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2019-12-07 11:58:57,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-12-07 11:58:57,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 70 transitions. [2019-12-07 11:58:57,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:57,028 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 70 transitions. [2019-12-07 11:58:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 70 transitions. [2019-12-07 11:58:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 43. [2019-12-07 11:58:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 11:58:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-12-07 11:58:57,030 INFO L711 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-12-07 11:58:57,031 INFO L591 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-12-07 11:58:57,031 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-12-07 11:58:57,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2019-12-07 11:58:57,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:57,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:57,032 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:57,032 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:57,032 INFO L794 eck$LassoCheckResult]: Stem: 1025#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1023#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1019#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1020#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1021#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1022#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1024#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1040#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1039#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1038#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1036#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1035#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1034#L23-3 assume !(main_~i~1 < 5); 1018#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1004#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1005#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1037#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1011#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1006#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1007#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1016#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1017#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1032#L9-3 assume !(max_~i~0 < 5); 1000#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1001#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1029#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1042#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1041#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1030#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1028#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1012#L10-3 [2019-12-07 11:58:57,032 INFO L796 eck$LassoCheckResult]: Loop: 1012#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1002#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1003#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1033#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1012#L10-3 [2019-12-07 11:58:57,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1525547091, now seen corresponding path program 1 times [2019-12-07 11:58:57,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402740809] [2019-12-07 11:58:57,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 11:58:57,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402740809] [2019-12-07 11:58:57,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106104563] [2019-12-07 11:58:57,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:57,102 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 11:58:57,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:57,110 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-12-07 11:58:57,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:57,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-07 11:58:57,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483575610] [2019-12-07 11:58:57,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:57,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 3 times [2019-12-07 11:58:57,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351657108] [2019-12-07 11:58:57,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:57,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:57,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:58:57,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:58:57,159 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-12-07 11:58:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:57,199 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2019-12-07 11:58:57,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:58:57,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 85 transitions. [2019-12-07 11:58:57,200 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 69 states and 85 transitions. [2019-12-07 11:58:57,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-12-07 11:58:57,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2019-12-07 11:58:57,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 85 transitions. [2019-12-07 11:58:57,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:57,202 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-12-07 11:58:57,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 85 transitions. [2019-12-07 11:58:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2019-12-07 11:58:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 11:58:57,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2019-12-07 11:58:57,205 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-12-07 11:58:57,205 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 62 transitions. [2019-12-07 11:58:57,205 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-12-07 11:58:57,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 62 transitions. [2019-12-07 11:58:57,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:57,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:57,207 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:57,207 INFO L794 eck$LassoCheckResult]: Stem: 1235#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1232#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1228#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1229#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1230#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1231#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1253#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1252#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1251#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1250#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1249#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1248#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1247#L23-3 assume !(main_~i~1 < 5); 1227#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1212#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1213#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1225#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1226#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1214#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1215#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1258#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1219#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1220#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1242#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1257#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1243#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1241#L9-3 assume !(max_~i~0 < 5); 1208#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1209#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1236#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1237#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1256#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1238#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1239#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1221#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1210#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1211#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1255#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1245#L10-3 [2019-12-07 11:58:57,207 INFO L796 eck$LassoCheckResult]: Loop: 1245#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1254#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1246#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1244#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1245#L10-3 [2019-12-07 11:58:57,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,208 INFO L82 PathProgramCache]: Analyzing trace with hash 452444531, now seen corresponding path program 2 times [2019-12-07 11:58:57,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125054753] [2019-12-07 11:58:57,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 11:58:57,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125054753] [2019-12-07 11:58:57,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848491260] [2019-12-07 11:58:57,249 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:57,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 11:58:57,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:58:57,295 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 11:58:57,297 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 11:58:57,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:57,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-07 11:58:57,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816589773] [2019-12-07 11:58:57,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:57,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,306 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 4 times [2019-12-07 11:58:57,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476094449] [2019-12-07 11:58:57,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,312 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:57,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:57,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:58:57,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:58:57,356 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. cyclomatic complexity: 16 Second operand 7 states. [2019-12-07 11:58:57,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:57,413 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2019-12-07 11:58:57,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:58:57,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 100 transitions. [2019-12-07 11:58:57,414 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 100 transitions. [2019-12-07 11:58:57,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-12-07 11:58:57,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-12-07 11:58:57,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 100 transitions. [2019-12-07 11:58:57,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:57,415 INFO L688 BuchiCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-12-07 11:58:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 100 transitions. [2019-12-07 11:58:57,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 59. [2019-12-07 11:58:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-12-07 11:58:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2019-12-07 11:58:57,418 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-12-07 11:58:57,418 INFO L591 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2019-12-07 11:58:57,418 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-12-07 11:58:57,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 72 transitions. [2019-12-07 11:58:57,418 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:57,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:57,419 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:57,419 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:57,419 INFO L794 eck$LassoCheckResult]: Stem: 1486#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1483#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1479#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1480#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1481#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1482#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1502#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1501#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1500#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1499#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1498#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1497#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1496#L23-3 assume !(main_~i~1 < 5); 1478#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1465#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1466#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1477#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1472#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1467#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1468#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1518#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1516#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1514#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1512#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1510#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1508#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1506#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1491#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1504#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1492#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1490#L9-3 assume !(max_~i~0 < 5); 1461#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1462#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1487#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1473#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1463#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1464#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1488#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1519#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1517#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1515#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1513#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1511#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1509#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1507#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1505#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1494#L10-3 [2019-12-07 11:58:57,419 INFO L796 eck$LassoCheckResult]: Loop: 1494#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1503#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1495#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1493#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1494#L10-3 [2019-12-07 11:58:57,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,419 INFO L82 PathProgramCache]: Analyzing trace with hash 2023971731, now seen corresponding path program 3 times [2019-12-07 11:58:57,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5715859] [2019-12-07 11:58:57,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 11:58:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5715859] [2019-12-07 11:58:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065405558] [2019-12-07 11:58:57,456 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:58:57,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-07 11:58:57,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 11:58:57,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:58:57,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:58:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 11:58:57,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 11:58:57,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-12-07 11:58:57,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622488074] [2019-12-07 11:58:57,527 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 11:58:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 5 times [2019-12-07 11:58:57,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894082185] [2019-12-07 11:58:57,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:57,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:57,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:58:57,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:58:57,577 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. cyclomatic complexity: 18 Second operand 10 states. [2019-12-07 11:58:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:57,670 INFO L93 Difference]: Finished difference Result 84 states and 103 transitions. [2019-12-07 11:58:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:58:57,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 103 transitions. [2019-12-07 11:58:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 103 transitions. [2019-12-07 11:58:57,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-12-07 11:58:57,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-12-07 11:58:57,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 103 transitions. [2019-12-07 11:58:57,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:57,673 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 103 transitions. [2019-12-07 11:58:57,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 103 transitions. [2019-12-07 11:58:57,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 67. [2019-12-07 11:58:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-12-07 11:58:57,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2019-12-07 11:58:57,675 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-12-07 11:58:57,675 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 82 transitions. [2019-12-07 11:58:57,675 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-12-07 11:58:57,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 82 transitions. [2019-12-07 11:58:57,676 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-12-07 11:58:57,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:57,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:57,677 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:57,677 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-12-07 11:58:57,677 INFO L794 eck$LassoCheckResult]: Stem: 1786#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1785#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1781#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1782#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1783#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1784#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1810#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1808#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1806#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1804#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1802#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1800#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1799#L23-3 assume !(main_~i~1 < 5); 1780#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1766#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1767#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1828#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1827#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1768#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1769#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1779#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1773#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1774#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1826#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1825#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1824#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1823#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1822#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1820#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1818#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1816#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1793#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1813#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1794#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1792#L9-3 assume !(max_~i~0 < 5); 1762#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1763#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1789#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1775#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1764#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1765#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1790#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1821#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1819#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1817#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1815#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1814#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1812#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1811#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1809#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1807#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1805#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1803#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1801#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1796#L10-3 [2019-12-07 11:58:57,677 INFO L796 eck$LassoCheckResult]: Loop: 1796#L10-3 assume max_~ret~0 < max_#t~mem1;call max_#t~mem2 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4);max_#t~ite3 := max_#t~mem2; 1798#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1797#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1795#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1796#L10-3 [2019-12-07 11:58:57,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,677 INFO L82 PathProgramCache]: Analyzing trace with hash 669208243, now seen corresponding path program 4 times [2019-12-07 11:58:57,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341468336] [2019-12-07 11:58:57,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,730 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:57,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2466748, now seen corresponding path program 6 times [2019-12-07 11:58:57,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324581981] [2019-12-07 11:58:57,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:57,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:57,736 INFO L82 PathProgramCache]: Analyzing trace with hash -746698386, now seen corresponding path program 1 times [2019-12-07 11:58:57,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:57,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610025496] [2019-12-07 11:58:57,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:58:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-12-07 11:58:57,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610025496] [2019-12-07 11:58:57,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:58:57,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:58:57,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162201897] [2019-12-07 11:58:57,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:58:57,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:58:57,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:58:57,879 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. cyclomatic complexity: 20 Second operand 10 states. [2019-12-07 11:58:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:58:58,021 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2019-12-07 11:58:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:58:58,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 100 transitions. [2019-12-07 11:58:58,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 11:58:58,022 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 62 states and 73 transitions. [2019-12-07 11:58:58,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-12-07 11:58:58,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2019-12-07 11:58:58,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2019-12-07 11:58:58,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:58:58,023 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 11:58:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2019-12-07 11:58:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-07 11:58:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-07 11:58:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2019-12-07 11:58:58,026 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 11:58:58,026 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2019-12-07 11:58:58,026 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-12-07 11:58:58,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 73 transitions. [2019-12-07 11:58:58,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-12-07 11:58:58,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 11:58:58,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 11:58:58,027 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:58:58,027 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-12-07 11:58:58,027 INFO L794 eck$LassoCheckResult]: Stem: 1958#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1957#L-1 havoc main_#res;havoc main_#t~nondet5, main_#t~post4, main_~i~1, main_#t~ret6, main_#t~mem7, main_#t~mem8, main_#t~ret9, main_#t~mem10, main_#t~mem12, main_#t~post11, main_~i~2, main_#t~ret13, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(20);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1953#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1954#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1955#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1956#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1978#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1975#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1972#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1969#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1967#L23-3 assume !!(main_~i~1 < 5);call write~int(main_#t~nondet5, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet5; 1965#L23-2 main_#t~post4 := main_~i~1;main_~i~1 := 1 + main_#t~post4;havoc main_#t~post4; 1964#L23-3 assume !(main_~i~1 < 5); 1952#L23-4 max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1944#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1945#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1951#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1946#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1947#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 2001#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 2000#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1998#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1996#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1994#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1992#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1990#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1988#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1986#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1984#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1982#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1980#L9-3 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1977#L10 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1974#L10-2 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1971#L9-2 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1963#L9-3 assume !(max_~i~0 < 5); 1940#L9-4 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1941#L12 main_#t~ret6 := max_#res;main_~ret~1 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem8, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem8;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);max_#in~x.base, max_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc max_#res;havoc max_#t~mem1, max_#t~ite3, max_#t~mem2, max_#t~post0, max_~x.base, max_~x.offset, max_~i~0, max_~ret~0;max_~x.base, max_~x.offset := max_#in~x.base, max_#in~x.offset;havoc max_~i~0;havoc max_~ret~0;max_~ret~0 := 0;max_~i~0 := 0; 1961#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1948#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1942#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1943#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1962#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1999#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1997#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1995#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1993#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1991#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1989#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1987#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1985#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1983#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1981#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1979#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1976#L9-8 assume !!(max_~i~0 < 5);call max_#t~mem1 := read~int(max_~x.base, max_~x.offset + 4 * max_~i~0, 4); 1973#L10-3 assume !(max_~ret~0 < max_#t~mem1);max_#t~ite3 := max_~ret~0; 1970#L10-5 max_~ret~0 := max_#t~ite3;havoc max_#t~mem1;havoc max_#t~ite3;havoc max_#t~mem2; 1968#L9-7 max_#t~post0 := max_~i~0;max_~i~0 := 1 + max_#t~post0;havoc max_#t~post0; 1966#L9-8 assume !(max_~i~0 < 5); 1959#L9-9 max_#res := (if max_~ret~0 % 4294967296 <= 2147483647 then max_~ret~0 % 4294967296 else max_~ret~0 % 4294967296 - 4294967296); 1960#L12-1 main_#t~ret9 := max_#res;main_~ret2~0 := main_#t~ret9;havoc main_#t~ret9;call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem10;havoc main_#t~mem10;main_~i~2 := 0; 1949#L32-3 [2019-12-07 11:58:58,028 INFO L796 eck$LassoCheckResult]: Loop: 1949#L32-3 assume !!(main_~i~2 < 4);call main_#t~mem12 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem12, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem12; 1950#L32-2 main_#t~post11 := main_~i~2;main_~i~2 := 1 + main_#t~post11;havoc main_#t~post11; 1949#L32-3 [2019-12-07 11:58:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -260352212, now seen corresponding path program 1 times [2019-12-07 11:58:58,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:58,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621843709] [2019-12-07 11:58:58,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 3203, now seen corresponding path program 1 times [2019-12-07 11:58:58,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:58,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606063380] [2019-12-07 11:58:58,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:58:58,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:58:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1090370322, now seen corresponding path program 1 times [2019-12-07 11:58:58,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:58:58,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64116245] [2019-12-07 11:58:58,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:58:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:58:58,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:59:00,297 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 402 DAG size of output: 285 [2019-12-07 11:59:00,812 WARN L192 SmtUtils]: Spent 454.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-12-07 11:59:00,814 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 11:59:00,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 11:59:00,814 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 11:59:00,814 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 11:59:00,814 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 11:59:00,814 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:00,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 11:59:00,815 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 11:59:00,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: max05-1.i_Iteration14_Lasso [2019-12-07 11:59:00,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 11:59:00,815 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 11:59:00,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-12-07 11:59:00,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:00,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 11:59:01,329 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 11:59:01,329 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,332 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-12-07 11:59:01,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,339 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-12-07 11:59:01,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,341 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,345 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-12-07 11:59:01,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,354 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-12-07 11:59:01,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,365 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-12-07 11:59:01,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,366 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,366 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,367 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,372 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-12-07 11:59:01,373 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,380 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-12-07 11:59:01,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,382 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,390 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-12-07 11:59:01,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,401 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-12-07 11:59:01,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,407 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-12-07 11:59:01,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,411 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,416 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-12-07 11:59:01,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,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-12-07 11:59:01,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,426 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,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_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,435 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-12-07 11:59:01,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 11:59:01,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 11:59:01,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 11:59:01,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,441 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-12-07 11:59:01,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 11:59:01,443 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 11:59:01,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 11:59:01,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 11:59:01,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 11:59:01,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 11:59:01,458 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 11:59:01,487 INFO L443 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2019-12-07 11:59:01,487 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f4b086da-babd-4e5c-88f6-2a5496e83957/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 11:59:01,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 11:59:01,492 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-12-07 11:59:01,492 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 11:59:01,492 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1, ULTIMATE.start_main_~i~2) = 7*ULTIMATE.start_main_~i~1 - 10*ULTIMATE.start_main_~i~2 Supporting invariants [] [2019-12-07 11:59:01,575 INFO L297 tatePredicateManager]: 24 out of 25 supporting invariants were superfluous and have been removed [2019-12-07 11:59:01,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:59:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:59:01,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 11:59:01,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:59:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:59:01,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 11:59:01,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:59:01,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:59:01,896 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2019-12-07 11:59:01,896 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13 Second operand 9 states. [2019-12-07 11:59:01,959 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 73 transitions. cyclomatic complexity: 13. Second operand 9 states. Result 115 states and 138 transitions. Complement of second has 11 states. [2019-12-07 11:59:01,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 1 accepting loop states [2019-12-07 11:59:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-12-07 11:59:01,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2019-12-07 11:59:01,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 60 letters. Loop has 2 letters. [2019-12-07 11:59:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:59:01,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 62 letters. Loop has 2 letters. [2019-12-07 11:59:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:59:01,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 60 letters. Loop has 4 letters. [2019-12-07 11:59:01,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 11:59:01,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 138 transitions. [2019-12-07 11:59:01,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 11:59:01,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 0 states and 0 transitions. [2019-12-07 11:59:01,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 11:59:01,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 11:59:01,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 11:59:01,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 11:59:01,962 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:59:01,962 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:59:01,962 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:59:01,962 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-12-07 11:59:01,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:59:01,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 11:59:01,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 11:59:01,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 11:59:01 BoogieIcfgContainer [2019-12-07 11:59:01,966 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 11:59:01,967 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:59:01,967 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:59:01,967 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:59:01,967 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:58:54" (3/4) ... [2019-12-07 11:59:01,969 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:59:01,969 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:59:01,970 INFO L168 Benchmark]: Toolchain (without parser) took 8042.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:59:01,971 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:59:01,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 194.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:59:01,971 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:59:01,971 INFO L168 Benchmark]: Boogie Preprocessor took 18.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:59:01,972 INFO L168 Benchmark]: RCFGBuilder took 206.28 ms. Allocated memory is still 1.1 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-12-07 11:59:01,972 INFO L168 Benchmark]: BuchiAutomizer took 7590.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.6 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:59:01,972 INFO L168 Benchmark]: Witness Printer took 2.95 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-12-07 11:59:01,973 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 194.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -137.6 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 206.28 ms. Allocated memory is still 1.1 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 7590.58 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -60.6 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.95 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 14 terminating modules (11 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 9 * unknown-#length-unknown[x] and consists of 5 locations. One deterministic module has affine ranking function 9 * unknown-#length-unknown[x] + -8 * i and consists of 4 locations. One deterministic module has affine ranking function 7 * i + -10 * i and consists of 10 locations. 11 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 15 iterations. TraceHistogramMax:5. Analysis of lassos took 6.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 85 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 12. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 336 SDtfs, 489 SDslu, 778 SDs, 0 SdLazy, 546 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU10 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital252 mio100 ax100 hnf99 lsp95 ukn49 mio100 lsp57 div100 bol100 ite100 ukn100 eq164 hnf86 smp99 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...