./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:42:08,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:42:08,320 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:42:08,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:42:08,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:42:08,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:42:08,362 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:42:08,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:42:08,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:42:08,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:42:08,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:42:08,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:42:08,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:42:08,383 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:42:08,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:42:08,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:42:08,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:42:08,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:42:08,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:42:08,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:42:08,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:42:08,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:42:08,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:42:08,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:42:08,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:42:08,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:42:08,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:42:08,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:42:08,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:42:08,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:42:08,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:42:08,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:42:08,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:42:08,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:42:08,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:42:08,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:42:08,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:42:08,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:42:08,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:42:08,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:42:08,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:42:08,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-10-21 19:42:08,488 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:42:08,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:42:08,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:42:08,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:42:08,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:42:08,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:42:08,491 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:42:08,491 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-21 19:42:08,492 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-21 19:42:08,492 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-21 19:42:08,493 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-21 19:42:08,493 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-21 19:42:08,493 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-21 19:42:08,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:42:08,494 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-21 19:42:08,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:42:08,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:42:08,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-21 19:42:08,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-21 19:42:08,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-21 19:42:08,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:42:08,495 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-21 19:42:08,495 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:42:08,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-21 19:42:08,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:42:08,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:42:08,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:42:08,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:42:08,498 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:42:08,499 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-21 19:42:08,499 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 337340cdf38da99928295b0c576766fb8f09c8634f9763511165b0f7240edd89 [2021-10-21 19:42:08,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:42:08,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:42:08,816 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:42:08,817 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:42:08,818 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:42:08,819 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-10-21 19:42:08,922 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/data/adeaac127/5f3c410cfcba4bdd90494ba596d1372b/FLAG469ef823d [2021-10-21 19:42:09,559 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:42:09,560 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/sv-benchmarks/c/termination-memory-alloca/java_Continue1-alloca.i [2021-10-21 19:42:09,575 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/data/adeaac127/5f3c410cfcba4bdd90494ba596d1372b/FLAG469ef823d [2021-10-21 19:42:09,903 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/data/adeaac127/5f3c410cfcba4bdd90494ba596d1372b [2021-10-21 19:42:09,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:42:09,907 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:42:09,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:09,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:42:09,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:42:09,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:09" (1/1) ... [2021-10-21 19:42:09,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29136993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:09, skipping insertion in model container [2021-10-21 19:42:09,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:42:09" (1/1) ... [2021-10-21 19:42:09,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:42:09,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:42:10,277 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:10,286 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:42:10,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:42:10,395 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:42:10,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10 WrapperNode [2021-10-21 19:42:10,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:42:10,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:10,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:42:10,398 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:42:10,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:42:10,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:42:10,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:42:10,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:42:10,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:42:10,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:42:10,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:42:10,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:42:10,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (1/1) ... [2021-10-21 19:42:10,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:10,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:10,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:10,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-10-21 19:42:10,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-21 19:42:10,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-21 19:42:10,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:42:10,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-21 19:42:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:42:10,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:42:10,784 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:42:10,785 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2021-10-21 19:42:10,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:10 BoogieIcfgContainer [2021-10-21 19:42:10,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:42:10,788 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-21 19:42:10,788 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-21 19:42:10,792 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-21 19:42:10,792 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:42:10,793 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.10 07:42:09" (1/3) ... [2021-10-21 19:42:10,794 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8e9334a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:42:10, skipping insertion in model container [2021-10-21 19:42:10,794 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:42:10,794 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:42:10" (2/3) ... [2021-10-21 19:42:10,795 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@8e9334a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.10 07:42:10, skipping insertion in model container [2021-10-21 19:42:10,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-21 19:42:10,795 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:10" (3/3) ... [2021-10-21 19:42:10,796 INFO L389 chiAutomizerObserver]: Analyzing ICFG java_Continue1-alloca.i [2021-10-21 19:42:10,839 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-21 19:42:10,839 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-21 19:42:10,839 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-21 19:42:10,839 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-21 19:42:10,839 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-21 19:42:10,840 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-21 19:42:10,840 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-21 19:42:10,840 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-21 19:42:10,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:10,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:10,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:10,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:10,891 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 19:42:10,891 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:10,891 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-21 19:42:10,891 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:10,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:10,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:10,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:10,915 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-10-21 19:42:10,915 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:10,922 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 9#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 5#L552-3true [2021-10-21 19:42:10,922 INFO L793 eck$LassoCheckResult]: Loop: 5#L552-3true goto; 8#L554-1true call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 10#L552-1true assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 11#L554true assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 5#L552-3true [2021-10-21 19:42:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-10-21 19:42:10,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:10,953 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149596999] [2021-10-21 19:42:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:10,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,061 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,112 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1109383, now seen corresponding path program 1 times [2021-10-21 19:42:11,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,117 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580841740] [2021-10-21 19:42:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,150 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,189 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash 889536585, now seen corresponding path program 1 times [2021-10-21 19:42:11,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790453205] [2021-10-21 19:42:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:11,412 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:11,412 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790453205] [2021-10-21 19:42:11,414 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790453205] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:42:11,414 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:42:11,415 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 19:42:11,415 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810685310] [2021-10-21 19:42:11,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:11,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:42:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:42:11,616 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:11,651 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2021-10-21 19:42:11,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:42:11,654 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2021-10-21 19:42:11,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:11,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 11 transitions. [2021-10-21 19:42:11,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-10-21 19:42:11,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-10-21 19:42:11,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2021-10-21 19:42:11,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:11,664 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-21 19:42:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2021-10-21 19:42:11,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-10-21 19:42:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2021-10-21 19:42:11,690 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-21 19:42:11,690 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2021-10-21 19:42:11,690 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-21 19:42:11,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2021-10-21 19:42:11,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:11,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:11,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:11,692 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-10-21 19:42:11,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-10-21 19:42:11,693 INFO L791 eck$LassoCheckResult]: Stem: 39#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 40#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 37#L552-3 goto; 38#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 41#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 42#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2021-10-21 19:42:11,693 INFO L793 eck$LassoCheckResult]: Loop: 43#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 46#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 44#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 43#L554-1 [2021-10-21 19:42:11,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash 889536583, now seen corresponding path program 1 times [2021-10-21 19:42:11,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,695 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189040924] [2021-10-21 19:42:11,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,726 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,769 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2021-10-21 19:42:11,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722964599] [2021-10-21 19:42:11,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,777 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,795 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:11,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 236134947, now seen corresponding path program 2 times [2021-10-21 19:42:11,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:11,803 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067874560] [2021-10-21 19:42:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:11,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,842 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:11,862 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:12,397 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:42:12,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:42:12,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:42:12,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:42:12,399 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:42:12,399 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:12,399 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:42:12,399 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:42:12,399 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration2_Lasso [2021-10-21 19:42:12,399 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:42:12,399 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:42:12,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:12,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:42:12,952 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:42:12,954 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:12,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:12,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:12,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:12,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:12,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:12,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:12,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:12,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:12,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:12,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-10-21 19:42:12,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:13,035 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:13,035 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:13,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:13,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:13,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:13,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:13,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:13,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:13,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:13,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:13,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:13,069 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-10-21 19:42:13,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:13,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:13,118 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:13,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:13,119 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:13,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:13,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:13,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:13,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:13,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:13,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:13,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:13,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-10-21 19:42:13,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:42:13,183 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-10-21 19:42:13,183 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-10-21 19:42:13,185 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:13,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:13,195 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:42:13,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-10-21 19:42:13,214 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-10-21 19:42:13,215 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:42:13,215 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_1 + 19 Supporting invariants [] [2021-10-21 19:42:13,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:13,275 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2021-10-21 19:42:13,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-21 19:42:13,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-21 19:42:13,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:13,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2021-10-21 19:42:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:13,472 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 [2021-10-21 19:42:13,475 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:13,524 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 20 transitions. Complement of second has 6 states. [2021-10-21 19:42:13,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-10-21 19:42:13,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:13,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-10-21 19:42:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2021-10-21 19:42:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:13,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2021-10-21 19:42:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:13,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2021-10-21 19:42:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:13,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2021-10-21 19:42:13,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:13,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 20 transitions. [2021-10-21 19:42:13,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:13,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-10-21 19:42:13,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2021-10-21 19:42:13,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:13,535 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2021-10-21 19:42:13,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2021-10-21 19:42:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2021-10-21 19:42:13,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:13,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2021-10-21 19:42:13,539 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-10-21 19:42:13,542 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2021-10-21 19:42:13,542 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-21 19:42:13,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2021-10-21 19:42:13,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:13,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:13,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:13,544 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2021-10-21 19:42:13,544 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:13,546 INFO L791 eck$LassoCheckResult]: Stem: 158#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 159#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 162#L552-3 goto; 169#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 168#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 167#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 166#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 160#L552-1 [2021-10-21 19:42:13,546 INFO L793 eck$LassoCheckResult]: Loop: 160#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 163#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 154#L552-3 goto; 155#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 160#L552-1 [2021-10-21 19:42:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1805830304, now seen corresponding path program 3 times [2021-10-21 19:42:13,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:13,547 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577643885] [2021-10-21 19:42:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:13,587 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:13,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:13,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 2 times [2021-10-21 19:42:13,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:13,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653223461] [2021-10-21 19:42:13,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,617 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:13,623 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:13,630 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:13,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:13,631 INFO L82 PathProgramCache]: Analyzing trace with hash -707580506, now seen corresponding path program 1 times [2021-10-21 19:42:13,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:13,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078823452] [2021-10-21 19:42:13,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,632 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,754 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:13,755 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:13,755 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078823452] [2021-10-21 19:42:13,755 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078823452] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:13,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748126115] [2021-10-21 19:42:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:13,757 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:13,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:13,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:13,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-10-21 19:42:13,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-21 19:42:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:13,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-21 19:42:13,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:13,881 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:13,882 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:13,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:14,007 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:14,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748126115] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:14,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:14,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2021-10-21 19:42:14,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915596438] [2021-10-21 19:42:14,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:14,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:42:14,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:42:14,114 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:14,192 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2021-10-21 19:42:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:42:14,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2021-10-21 19:42:14,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:14,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 20 transitions. [2021-10-21 19:42:14,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:14,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:14,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2021-10-21 19:42:14,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:14,199 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-10-21 19:42:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2021-10-21 19:42:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-21 19:42:14,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2021-10-21 19:42:14,203 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-10-21 19:42:14,204 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2021-10-21 19:42:14,204 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-21 19:42:14,204 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2021-10-21 19:42:14,205 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:14,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:14,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:14,206 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2021-10-21 19:42:14,206 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:14,206 INFO L791 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 247#L552-3 goto; 255#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 254#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 253#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 244#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 245#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 250#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 251#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 248#L552-1 [2021-10-21 19:42:14,206 INFO L793 eck$LassoCheckResult]: Loop: 248#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 249#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 238#L552-3 goto; 239#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 248#L552-1 [2021-10-21 19:42:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751228, now seen corresponding path program 4 times [2021-10-21 19:42:14,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612720197] [2021-10-21 19:42:14,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,208 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,241 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,263 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 3 times [2021-10-21 19:42:14,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116627999] [2021-10-21 19:42:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,270 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:14,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,289 INFO L82 PathProgramCache]: Analyzing trace with hash 112465226, now seen corresponding path program 2 times [2021-10-21 19:42:14,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,290 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996106858] [2021-10-21 19:42:14,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,291 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:14,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:14,423 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996106858] [2021-10-21 19:42:14,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996106858] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:14,424 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672950157] [2021-10-21 19:42:14,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:42:14,424 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:14,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:14,426 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:14,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-21 19:42:14,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:42:14,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:14,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:42:14,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:14,529 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:14,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:14,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:14,631 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:14,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:14,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672950157] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:14,686 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:14,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2021-10-21 19:42:14,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152454035] [2021-10-21 19:42:14,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:14,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-21 19:42:14,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2021-10-21 19:42:14,792 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:14,890 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2021-10-21 19:42:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-21 19:42:14,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2021-10-21 19:42:14,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:14,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 21 states and 23 transitions. [2021-10-21 19:42:14,896 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:14,896 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:14,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2021-10-21 19:42:14,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:14,897 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-10-21 19:42:14,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2021-10-21 19:42:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-10-21 19:42:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2021-10-21 19:42:14,901 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-10-21 19:42:14,902 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2021-10-21 19:42:14,902 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-21 19:42:14,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2021-10-21 19:42:14,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:14,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:14,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:14,905 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 1, 1, 1] [2021-10-21 19:42:14,905 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:14,906 INFO L791 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 346#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 351#L552-3 goto; 361#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 359#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 347#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 348#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 354#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 349#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 350#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 358#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 356#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 352#L552-1 [2021-10-21 19:42:14,906 INFO L793 eck$LassoCheckResult]: Loop: 352#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 353#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 341#L552-3 goto; 342#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 352#L552-1 [2021-10-21 19:42:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1381845472, now seen corresponding path program 5 times [2021-10-21 19:42:14,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,907 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350297680] [2021-10-21 19:42:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,907 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,930 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,960 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 4 times [2021-10-21 19:42:14,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47838166] [2021-10-21 19:42:14,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,973 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:14,978 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 320887590, now seen corresponding path program 3 times [2021-10-21 19:42:14,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:14,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287553235] [2021-10-21 19:42:14,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:14,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:15,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:15,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287553235] [2021-10-21 19:42:15,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287553235] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:15,151 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913886562] [2021-10-21 19:42:15,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-21 19:42:15,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:15,181 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:15,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-21 19:42:15,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-10-21 19:42:15,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:15,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 15 conjunts are in the unsatisfiable core [2021-10-21 19:42:15,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:15,292 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:15,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:15,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:15,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:15,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:15,478 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:15,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913886562] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:15,487 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:15,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2021-10-21 19:42:15,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336133043] [2021-10-21 19:42:15,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-10-21 19:42:15,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-21 19:42:15,585 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:15,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:15,711 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2021-10-21 19:42:15,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-21 19:42:15,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2021-10-21 19:42:15,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:15,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 24 states and 26 transitions. [2021-10-21 19:42:15,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:15,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:15,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-10-21 19:42:15,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:15,716 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-10-21 19:42:15,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-10-21 19:42:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-21 19:42:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 23 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2021-10-21 19:42:15,718 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-10-21 19:42:15,718 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-10-21 19:42:15,718 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-10-21 19:42:15,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2021-10-21 19:42:15,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:15,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:15,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:15,720 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 1, 1, 1] [2021-10-21 19:42:15,720 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:15,720 INFO L791 eck$LassoCheckResult]: Stem: 468#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 469#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 474#L552-3 goto; 484#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 483#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 478#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 470#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 471#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 487#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 472#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 473#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 477#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 479#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 486#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 485#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 481#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 475#L552-1 [2021-10-21 19:42:15,720 INFO L793 eck$LassoCheckResult]: Loop: 475#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 476#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 464#L552-3 goto; 465#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 475#L552-1 [2021-10-21 19:42:15,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:15,721 INFO L82 PathProgramCache]: Analyzing trace with hash 703087812, now seen corresponding path program 6 times [2021-10-21 19:42:15,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:15,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111211949] [2021-10-21 19:42:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:15,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:15,735 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:15,755 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 5 times [2021-10-21 19:42:15,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:15,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604229008] [2021-10-21 19:42:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:15,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:15,770 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:15,776 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1091176502, now seen corresponding path program 4 times [2021-10-21 19:42:15,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:15,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788780354] [2021-10-21 19:42:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:15,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:15,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:15,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788780354] [2021-10-21 19:42:15,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788780354] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:15,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786194677] [2021-10-21 19:42:15,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-21 19:42:15,949 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:15,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:15,951 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:15,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-10-21 19:42:16,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-21 19:42:16,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:16,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:42:16,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:16,060 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-10-21 19:42:16,061 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-10-21 19:42:16,065 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-10-21 19:42:16,177 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:16,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:16,278 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:16,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:16,384 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:16,384 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:16,480 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:16,480 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:16,588 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-21 19:42:16,589 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-10-21 19:42:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:16,597 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786194677] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:16,597 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:16,597 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2021-10-21 19:42:16,597 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175356044] [2021-10-21 19:42:16,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:16,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-21 19:42:16,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-10-21 19:42:16,687 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:16,902 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2021-10-21 19:42:16,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:42:16,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2021-10-21 19:42:16,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:16,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 29 transitions. [2021-10-21 19:42:16,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:16,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:16,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 29 transitions. [2021-10-21 19:42:16,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:16,906 INFO L681 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-10-21 19:42:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 29 transitions. [2021-10-21 19:42:16,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2021-10-21 19:42:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:16,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2021-10-21 19:42:16,909 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-10-21 19:42:16,909 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 29 transitions. [2021-10-21 19:42:16,909 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-10-21 19:42:16,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 29 transitions. [2021-10-21 19:42:16,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:16,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:16,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:16,911 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 1, 1, 1] [2021-10-21 19:42:16,911 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:16,911 INFO L791 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 612#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 617#L552-3 goto; 626#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 625#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 621#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 613#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 614#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 620#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 615#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 616#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 633#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 632#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 631#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 630#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 629#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 628#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 627#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 623#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 618#L552-1 [2021-10-21 19:42:16,911 INFO L793 eck$LassoCheckResult]: Loop: 618#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 619#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 607#L552-3 goto; 608#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 618#L552-1 [2021-10-21 19:42:16,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:16,912 INFO L82 PathProgramCache]: Analyzing trace with hash -866483296, now seen corresponding path program 7 times [2021-10-21 19:42:16,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:16,912 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139063176] [2021-10-21 19:42:16,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:16,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:16,925 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:16,941 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 6 times [2021-10-21 19:42:16,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:16,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068479506] [2021-10-21 19:42:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:16,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:16,947 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:16,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:16,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1312123046, now seen corresponding path program 5 times [2021-10-21 19:42:16,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:16,952 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296889176] [2021-10-21 19:42:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:16,953 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:17,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:17,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296889176] [2021-10-21 19:42:17,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296889176] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:17,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619607909] [2021-10-21 19:42:17,147 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-21 19:42:17,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:17,147 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:17,149 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:17,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-10-21 19:42:17,266 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-10-21 19:42:17,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:17,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-21 19:42:17,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:17,292 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:17,292 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:17,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:17,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:17,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:17,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:17,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:17,568 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:17,577 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:17,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619607909] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:17,577 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:17,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2021-10-21 19:42:17,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050999077] [2021-10-21 19:42:17,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:17,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-10-21 19:42:17,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:42:17,677 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. cyclomatic complexity: 4 Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:17,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:17,874 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-10-21 19:42:17,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-21 19:42:17,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2021-10-21 19:42:17,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:17,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 32 transitions. [2021-10-21 19:42:17,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:17,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:17,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 32 transitions. [2021-10-21 19:42:17,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:17,877 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-10-21 19:42:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 32 transitions. [2021-10-21 19:42:17,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2021-10-21 19:42:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2021-10-21 19:42:17,879 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-10-21 19:42:17,880 INFO L587 BuchiCegarLoop]: Abstraction has 30 states and 32 transitions. [2021-10-21 19:42:17,880 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-10-21 19:42:17,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 32 transitions. [2021-10-21 19:42:17,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:17,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:17,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:17,881 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 1, 1, 1] [2021-10-21 19:42:17,881 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:17,881 INFO L791 eck$LassoCheckResult]: Stem: 770#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 771#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 780#L552-3 goto; 790#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 789#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 784#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 776#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 777#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 799#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 778#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 779#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 783#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 785#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 798#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 797#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 796#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 795#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 794#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 793#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 792#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 791#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 787#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 781#L552-1 [2021-10-21 19:42:17,882 INFO L793 eck$LassoCheckResult]: Loop: 781#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 782#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 772#L552-3 goto; 773#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 781#L552-1 [2021-10-21 19:42:17,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:17,882 INFO L82 PathProgramCache]: Analyzing trace with hash -650410172, now seen corresponding path program 8 times [2021-10-21 19:42:17,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:17,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578884157] [2021-10-21 19:42:17,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:17,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:17,896 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:17,920 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 7 times [2021-10-21 19:42:17,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:17,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719682372] [2021-10-21 19:42:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:17,921 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:17,929 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:17,940 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:17,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 904133194, now seen corresponding path program 6 times [2021-10-21 19:42:17,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:17,942 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420057858] [2021-10-21 19:42:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:17,942 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:18,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:18,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420057858] [2021-10-21 19:42:18,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420057858] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:18,246 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118049956] [2021-10-21 19:42:18,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-21 19:42:18,246 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:18,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:18,252 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:18,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-10-21 19:42:18,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2021-10-21 19:42:18,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:18,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 18 conjunts are in the unsatisfiable core [2021-10-21 19:42:18,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:18,419 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:18,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:18,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,496 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,529 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,633 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:18,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:18,676 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 8 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:18,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118049956] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:18,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:18,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 24 [2021-10-21 19:42:18,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100225766] [2021-10-21 19:42:18,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-10-21 19:42:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2021-10-21 19:42:18,769 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. cyclomatic complexity: 4 Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:19,015 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2021-10-21 19:42:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-21 19:42:19,017 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2021-10-21 19:42:19,017 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:19,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2021-10-21 19:42:19,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:19,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:19,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2021-10-21 19:42:19,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:19,018 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-10-21 19:42:19,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2021-10-21 19:42:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-10-21 19:42:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2021-10-21 19:42:19,021 INFO L704 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-10-21 19:42:19,021 INFO L587 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2021-10-21 19:42:19,021 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-10-21 19:42:19,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 35 transitions. [2021-10-21 19:42:19,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:19,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:19,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:19,024 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 1, 1, 1] [2021-10-21 19:42:19,024 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:19,025 INFO L791 eck$LassoCheckResult]: Stem: 953#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 954#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 963#L552-3 goto; 972#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 971#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 967#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 959#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 960#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 966#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 961#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 962#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 985#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 984#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 983#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 982#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 981#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 980#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 979#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 978#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 977#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 976#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 975#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 974#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 973#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 969#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 964#L552-1 [2021-10-21 19:42:19,025 INFO L793 eck$LassoCheckResult]: Loop: 964#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 965#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 955#L552-3 goto; 956#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 964#L552-1 [2021-10-21 19:42:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1771949792, now seen corresponding path program 9 times [2021-10-21 19:42:19,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:19,028 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742810211] [2021-10-21 19:42:19,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:19,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:19,037 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:19,069 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:19,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:19,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 8 times [2021-10-21 19:42:19,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:19,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639093909] [2021-10-21 19:42:19,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:19,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:19,080 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:19,086 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:19,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:19,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1235899942, now seen corresponding path program 7 times [2021-10-21 19:42:19,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:19,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545564270] [2021-10-21 19:42:19,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:19,087 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:19,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:19,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545564270] [2021-10-21 19:42:19,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545564270] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:19,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147926183] [2021-10-21 19:42:19,365 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-21 19:42:19,365 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:19,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:19,367 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:19,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-10-21 19:42:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:19,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-21 19:42:19,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:19,551 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:19,551 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:19,594 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,627 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,664 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,766 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,811 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:19,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 9 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:19,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147926183] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:19,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:19,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 27 [2021-10-21 19:42:19,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974678556] [2021-10-21 19:42:20,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:20,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-10-21 19:42:20,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=523, Unknown=0, NotChecked=0, Total=702 [2021-10-21 19:42:20,006 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. cyclomatic complexity: 4 Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:20,316 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-10-21 19:42:20,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-10-21 19:42:20,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2021-10-21 19:42:20,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:20,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 36 states and 38 transitions. [2021-10-21 19:42:20,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:20,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:20,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 38 transitions. [2021-10-21 19:42:20,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:20,318 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-10-21 19:42:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 38 transitions. [2021-10-21 19:42:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-10-21 19:42:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-10-21 19:42:20,321 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-10-21 19:42:20,321 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-10-21 19:42:20,321 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-10-21 19:42:20,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2021-10-21 19:42:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:20,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:20,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:20,323 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 1, 1, 1] [2021-10-21 19:42:20,323 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:20,323 INFO L791 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1161#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1166#L552-3 goto; 1176#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1175#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1170#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1162#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1163#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1191#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1164#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1165#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1169#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1171#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1190#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1189#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1188#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1187#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1186#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1185#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1184#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1183#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1182#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1181#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1180#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1179#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1178#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1177#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1173#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1167#L552-1 [2021-10-21 19:42:20,323 INFO L793 eck$LassoCheckResult]: Loop: 1167#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1168#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1156#L552-3 goto; 1157#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1167#L552-1 [2021-10-21 19:42:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1286793668, now seen corresponding path program 10 times [2021-10-21 19:42:20,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:20,324 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827723944] [2021-10-21 19:42:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:20,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:20,338 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:20,355 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:20,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:20,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 9 times [2021-10-21 19:42:20,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:20,356 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136616049] [2021-10-21 19:42:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:20,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:20,361 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:20,365 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -2115625782, now seen corresponding path program 8 times [2021-10-21 19:42:20,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:20,366 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356927240] [2021-10-21 19:42:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:20,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:20,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:20,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356927240] [2021-10-21 19:42:20,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356927240] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:20,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033067588] [2021-10-21 19:42:20,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:42:20,677 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:20,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:20,678 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:20,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-21 19:42:20,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:42:20,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:20,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-21 19:42:20,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:20,887 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:20,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:20,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:20,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,168 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,262 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:21,307 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 10 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:21,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033067588] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:21,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:21,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2021-10-21 19:42:21,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690477948] [2021-10-21 19:42:21,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-21 19:42:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:42:21,407 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand has 30 states, 30 states have (on average 2.0) internal successors, (60), 30 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:21,687 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2021-10-21 19:42:21,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-21 19:42:21,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2021-10-21 19:42:21,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:21,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 39 states and 41 transitions. [2021-10-21 19:42:21,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:21,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:21,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 41 transitions. [2021-10-21 19:42:21,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:21,690 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-10-21 19:42:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 41 transitions. [2021-10-21 19:42:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2021-10-21 19:42:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 38 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2021-10-21 19:42:21,693 INFO L704 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-10-21 19:42:21,693 INFO L587 BuchiCegarLoop]: Abstraction has 39 states and 41 transitions. [2021-10-21 19:42:21,693 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-10-21 19:42:21,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 41 transitions. [2021-10-21 19:42:21,694 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:21,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:21,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:21,695 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 1, 1, 1] [2021-10-21 19:42:21,695 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:21,695 INFO L791 eck$LassoCheckResult]: Stem: 1383#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1384#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1389#L552-3 goto; 1399#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1398#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1393#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1385#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1386#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1417#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1387#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1388#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1392#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1394#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1416#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1415#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1414#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1413#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1412#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1411#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1410#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1409#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1408#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1407#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1406#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1405#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1404#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1403#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1402#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1401#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1400#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1396#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1390#L552-1 [2021-10-21 19:42:21,695 INFO L793 eck$LassoCheckResult]: Loop: 1390#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1391#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1379#L552-3 goto; 1380#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1390#L552-1 [2021-10-21 19:42:21,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:21,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2007908704, now seen corresponding path program 11 times [2021-10-21 19:42:21,696 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:21,696 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954009259] [2021-10-21 19:42:21,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:21,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:21,712 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:21,731 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 10 times [2021-10-21 19:42:21,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:21,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812345929] [2021-10-21 19:42:21,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:21,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:21,751 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:21,756 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1981227942, now seen corresponding path program 9 times [2021-10-21 19:42:21,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:21,756 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936764273] [2021-10-21 19:42:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:21,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:22,033 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:22,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936764273] [2021-10-21 19:42:22,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936764273] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:22,033 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015392222] [2021-10-21 19:42:22,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-21 19:42:22,033 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:22,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:22,035 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:22,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-10-21 19:42:22,253 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-10-21 19:42:22,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:42:22,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-21 19:42:22,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:22,278 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-10-21 19:42:22,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2021-10-21 19:42:22,281 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2021-10-21 19:42:22,359 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,360 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,437 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,437 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,525 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,614 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,690 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,691 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,808 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,808 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,903 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,903 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:22,991 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:22,991 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:23,072 INFO L354 Elim1Store]: treesize reduction 39, result has 15.2 percent of original size [2021-10-21 19:42:23,072 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 27 [2021-10-21 19:42:23,155 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-10-21 19:42:23,156 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2021-10-21 19:42:23,163 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 11 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:23,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015392222] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:23,163 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:23,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 33 [2021-10-21 19:42:23,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020753568] [2021-10-21 19:42:23,255 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-10-21 19:42:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-10-21 19:42:23,257 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. cyclomatic complexity: 4 Second operand has 33 states, 33 states have (on average 2.0) internal successors, (66), 33 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:23,727 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2021-10-21 19:42:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-21 19:42:23,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 46 transitions. [2021-10-21 19:42:23,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:23,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 44 transitions. [2021-10-21 19:42:23,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2021-10-21 19:42:23,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:23,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 44 transitions. [2021-10-21 19:42:23,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:23,729 INFO L681 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-10-21 19:42:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 44 transitions. [2021-10-21 19:42:23,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2021-10-21 19:42:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 41 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2021-10-21 19:42:23,732 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-10-21 19:42:23,732 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 44 transitions. [2021-10-21 19:42:23,732 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-10-21 19:42:23,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 44 transitions. [2021-10-21 19:42:23,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:23,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:23,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:23,734 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 1, 1, 1] [2021-10-21 19:42:23,734 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:23,734 INFO L791 eck$LassoCheckResult]: Stem: 1626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1627#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 1632#L552-3 goto; 1642#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1641#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1636#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1628#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1629#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1663#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1630#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1631#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1635#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1637#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1662#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1661#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1660#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1659#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1658#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1657#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1656#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1655#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1654#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1653#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1652#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1651#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1650#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1649#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1648#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1647#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1646#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1645#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1644#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1643#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 1639#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1633#L552-1 [2021-10-21 19:42:23,734 INFO L793 eck$LassoCheckResult]: Loop: 1633#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1634#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 1622#L552-3 goto; 1623#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 1633#L552-1 [2021-10-21 19:42:23,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:23,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1598657468, now seen corresponding path program 12 times [2021-10-21 19:42:23,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:23,735 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792299442] [2021-10-21 19:42:23,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:23,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,751 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:23,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:23,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 11 times [2021-10-21 19:42:23,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:23,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651956304] [2021-10-21 19:42:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:23,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:23,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,796 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,801 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:23,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1264869194, now seen corresponding path program 10 times [2021-10-21 19:42:23,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:23,802 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327784193] [2021-10-21 19:42:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:23,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,820 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:23,841 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:32,547 WARN L207 SmtUtils]: Spent 8.62 s on a formula simplification. DAG size of input: 204 DAG size of output: 172 [2021-10-21 19:42:32,690 INFO L210 LassoAnalysis]: Preferences: [2021-10-21 19:42:32,691 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-21 19:42:32,691 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-21 19:42:32,691 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-21 19:42:32,691 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-21 19:42:32,691 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:32,691 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-21 19:42:32,691 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-21 19:42:32,691 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Continue1-alloca.i_Iteration12_Lasso [2021-10-21 19:42:32,691 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-21 19:42:32,691 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-10-21 19:42:32,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:32,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-21 19:42:33,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-10-21 19:42:33,219 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-10-21 19:42:33,220 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,228 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-10-21 19:42:33,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:42:33,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:42:33,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:42:33,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,269 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,270 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,271 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-10-21 19:42:33,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-21 19:42:33,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-21 19:42:33,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-21 19:42:33,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,303 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,304 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-10-21 19:42:33,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,341 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,363 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2021-10-21 19:42:33,363 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,364 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-10-21 19:42:33,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,406 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-10-21 19:42:33,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,447 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,447 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-10-21 19:42:33,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,500 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-10-21 19:42:33,500 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,502 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-10-21 19:42:33,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,533 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,534 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-10-21 19:42:33,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-10-21 19:42:33,569 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,570 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,571 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-10-21 19:42:33,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-10-21 19:42:33,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-21 19:42:33,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-21 19:42:33,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-21 19:42:33,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-21 19:42:33,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-10-21 19:42:33,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-10-21 19:42:33,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-21 19:42:33,597 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2021-10-21 19:42:33,597 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-10-21 19:42:33,597 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-21 19:42:33,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:33,599 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-21 19:42:33,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-10-21 19:42:33,603 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-21 19:42:33,612 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2021-10-21 19:42:33,612 INFO L513 LassoAnalysis]: Proved termination. [2021-10-21 19:42:33,612 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem4) = -41*ULTIMATE.start_main_#t~mem4 + 790 Supporting invariants [-40*ULTIMATE.start_main_#t~mem4 + 41*v_rep(select (select #memory_int ULTIMATE.start_main_~i~0.base) ULTIMATE.start_main_~i~0.offset)_2 >= 0] [2021-10-21 19:42:33,631 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:33,679 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2021-10-21 19:42:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:33,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-21 19:42:33,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:33,754 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:33,754 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:33,815 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:33,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:33,913 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:33,961 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,019 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,075 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,235 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,291 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:34,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 19:42:34,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:34,349 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-10-21 19:42:34,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:34,494 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-21 19:42:34,495 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-10-21 19:42:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:34,648 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2021-10-21 19:42:34,648 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:34,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 45 transitions. Complement of second has 6 states. [2021-10-21 19:42:34,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-21 19:42:34,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:34,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2021-10-21 19:42:34,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2021-10-21 19:42:34,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:34,705 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-10-21 19:42:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:34,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-21 19:42:34,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:34,793 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:34,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:34,847 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,900 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:34,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,003 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,173 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,227 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,335 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:35,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 19:42:35,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:35,402 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-10-21 19:42:35,475 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-21 19:42:35,476 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-10-21 19:42:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:35,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 3 loop predicates [2021-10-21 19:42:35,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:35,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 45 transitions. Complement of second has 6 states. [2021-10-21 19:42:35,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-21 19:42:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2021-10-21 19:42:35,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 34 letters. Loop has 4 letters. [2021-10-21 19:42:35,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:35,641 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-10-21 19:42:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:35,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-21 19:42:35,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:35,714 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:35,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:35,765 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,820 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,867 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:35,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,081 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:36,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-21 19:42:36,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:36,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2021-10-21 19:42:36,419 INFO L354 Elim1Store]: treesize reduction 18, result has 60.9 percent of original size [2021-10-21 19:42:36,419 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 53 [2021-10-21 19:42:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:36,517 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 3 loop predicates [2021-10-21 19:42:36,517 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4 Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:36,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 44 transitions. cyclomatic complexity: 4. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 69 states and 75 transitions. Complement of second has 49 states. [2021-10-21 19:42:36,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 12 stem states 2 non-accepting loop states 2 accepting loop states [2021-10-21 19:42:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2021-10-21 19:42:36,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 4 letters. [2021-10-21 19:42:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 38 letters. Loop has 4 letters. [2021-10-21 19:42:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 56 transitions. Stem has 34 letters. Loop has 8 letters. [2021-10-21 19:42:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-21 19:42:36,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2021-10-21 19:42:36,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:36,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 49 states and 53 transitions. [2021-10-21 19:42:36,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-10-21 19:42:36,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2021-10-21 19:42:36,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2021-10-21 19:42:36,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-10-21 19:42:36,799 INFO L681 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2021-10-21 19:42:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2021-10-21 19:42:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2021-10-21 19:42:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2021-10-21 19:42:36,802 INFO L704 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-10-21 19:42:36,802 INFO L587 BuchiCegarLoop]: Abstraction has 47 states and 50 transitions. [2021-10-21 19:42:36,802 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-10-21 19:42:36,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 50 transitions. [2021-10-21 19:42:36,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-10-21 19:42:36,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-21 19:42:36,805 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-21 19:42:36,806 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 11, 1, 1, 1] [2021-10-21 19:42:36,806 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-10-21 19:42:36,808 INFO L791 eck$LassoCheckResult]: Stem: 2355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 2356#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~post6, main_#t~mem7, main_#t~mem8, main_#t~post9, main_#t~mem4, main_#t~mem10, main_~i~0.base, main_~i~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~i~0.base, main_~i~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~i~0.base, main_~i~0.offset, 4);call write~int(0, main_~c~0.base, main_~c~0.offset, 4); 2351#L552-3 goto; 2352#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2361#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2362#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2357#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2358#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2363#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2359#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2360#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2397#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2396#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2395#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2394#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2393#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2392#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2391#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2390#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2389#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2388#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2387#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2386#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2385#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2384#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2383#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2382#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2381#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2380#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2379#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2378#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2377#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2376#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2354#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2365#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2366#L554 assume main_#t~mem7 <= 10;havoc main_#t~mem7; 2367#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2368#L552-1 [2021-10-21 19:42:36,808 INFO L793 eck$LassoCheckResult]: Loop: 2368#L552-1 assume !!(main_#t~mem4 < 20);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~i~0.base, main_~i~0.offset, 4);main_#t~post6 := main_#t~mem5;call write~int(1 + main_#t~post6, main_~i~0.base, main_~i~0.offset, 4);havoc main_#t~mem5;havoc main_#t~post6;call main_#t~mem7 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2370#L554 assume !(main_#t~mem7 <= 10);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post9 := main_#t~mem8;call write~int(1 + main_#t~post9, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~mem8;havoc main_#t~post9; 2371#L552-3 goto; 2374#L554-1 call main_#t~mem4 := read~int(main_~i~0.base, main_~i~0.offset, 4); 2368#L552-1 [2021-10-21 19:42:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1287728160, now seen corresponding path program 13 times [2021-10-21 19:42:36,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:36,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717857030] [2021-10-21 19:42:36,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:36,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 146 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:37,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:42:37,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717857030] [2021-10-21 19:42:37,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717857030] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:37,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343224432] [2021-10-21 19:42:37,141 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-10-21 19:42:37,142 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:42:37,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:42:37,143 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:42:37,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2021-10-21 19:42:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:42:37,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 22 conjunts are in the unsatisfiable core [2021-10-21 19:42:37,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:42:37,513 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-10-21 19:42:37,513 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2021-10-21 19:42:37,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,606 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,648 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,692 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,737 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,851 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:37,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-10-21 19:42:38,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2021-10-21 19:42:38,048 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 11 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:42:38,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343224432] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:42:38,048 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:42:38,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 36 [2021-10-21 19:42:38,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491168611] [2021-10-21 19:42:38,049 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-10-21 19:42:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:42:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1297543, now seen corresponding path program 12 times [2021-10-21 19:42:38,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:42:38,049 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989939085] [2021-10-21 19:42:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:42:38,050 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:42:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:38,055 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:42:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:42:38,059 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:42:38,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:42:38,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-10-21 19:42:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2021-10-21 19:42:38,144 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. cyclomatic complexity: 6 Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 19:42:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:42:38,620 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-10-21 19:42:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-10-21 19:42:38,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2021-10-21 19:42:38,621 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-21 19:42:38,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2021-10-21 19:42:38,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-21 19:42:38,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-21 19:42:38,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-21 19:42:38,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-21 19:42:38,622 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:42:38,622 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:42:38,622 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 19:42:38,622 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-10-21 19:42:38,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-21 19:42:38,622 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-21 19:42:38,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-21 19:42:38,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.10 07:42:38 BoogieIcfgContainer [2021-10-21 19:42:38,628 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-21 19:42:38,628 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:42:38,628 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:42:38,628 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:42:38,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:42:10" (3/4) ... [2021-10-21 19:42:38,633 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-21 19:42:38,633 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:42:38,633 INFO L168 Benchmark]: Toolchain (without parser) took 28725.91 ms. Allocated memory was 92.3 MB in the beginning and 249.6 MB in the end (delta: 157.3 MB). Free memory was 55.0 MB in the beginning and 114.5 MB in the end (delta: -59.5 MB). Peak memory consumption was 97.6 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,634 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 92.3 MB. Free memory was 65.1 MB in the beginning and 65.1 MB in the end (delta: 21.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:38,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.62 ms. Allocated memory was 92.3 MB in the beginning and 142.6 MB in the end (delta: 50.3 MB). Free memory was 54.7 MB in the beginning and 110.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.13 ms. Allocated memory is still 142.6 MB. Free memory was 110.1 MB in the beginning and 108.9 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:38,635 INFO L168 Benchmark]: Boogie Preprocessor took 41.14 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,635 INFO L168 Benchmark]: RCFGBuilder took 292.68 ms. Allocated memory is still 142.6 MB. Free memory was 107.1 MB in the beginning and 97.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,636 INFO L168 Benchmark]: BuchiAutomizer took 27839.82 ms. Allocated memory was 142.6 MB in the beginning and 249.6 MB in the end (delta: 107.0 MB). Free memory was 97.5 MB in the beginning and 114.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 92.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:42:38,636 INFO L168 Benchmark]: Witness Printer took 4.62 ms. Allocated memory is still 249.6 MB. Free memory is still 114.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:42:38,639 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 92.3 MB. Free memory was 65.1 MB in the beginning and 65.1 MB in the end (delta: 21.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 469.62 ms. Allocated memory was 92.3 MB in the beginning and 142.6 MB in the end (delta: 50.3 MB). Free memory was 54.7 MB in the beginning and 110.1 MB in the end (delta: -55.4 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.13 ms. Allocated memory is still 142.6 MB. Free memory was 110.1 MB in the beginning and 108.9 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.14 ms. Allocated memory is still 142.6 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 292.68 ms. Allocated memory is still 142.6 MB. Free memory was 107.1 MB in the beginning and 97.5 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 27839.82 ms. Allocated memory was 142.6 MB in the beginning and 249.6 MB in the end (delta: 107.0 MB). Free memory was 97.5 MB in the beginning and 114.5 MB in the end (delta: -16.9 MB). Peak memory consumption was 92.0 MB. Max. memory is 16.1 GB. * Witness Printer took 4.62 ms. Allocated memory is still 249.6 MB. Free memory is still 114.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 19 + -2 * unknown-#memory_int-unknown[i][i] and consists of 4 locations. One nondeterministic module has affine ranking function -41 * aux-i-aux + 790 and consists of 16 locations. 11 modules have a trivial ranking function, the largest among these consists of 36 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.7s and 14 iterations. TraceHistogramMax:12. Analysis of lassos took 21.6s. Construction of modules took 1.2s. Büchi inclusion checks took 4.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 11. Automata minimization 46.9ms AutomataMinimizationTime, 12 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 12. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 76 SDtfs, 75 SDslu, 339 SDs, 0 SdLazy, 2198 SolverSat, 209 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1293.8ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc10 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital250 mio100 ax107 hnf100 lsp89 ukn47 mio100 lsp42 div100 bol100 ite100 ukn100 eq175 hnf89 smp91 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 1 VariablesLoop: 2 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! [2021-10-21 19:42:38,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:38,872 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:39,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:39,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:39,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:39,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-10-21 19:42:39,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-10-21 19:42:40,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2021-10-21 19:42:40,272 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-10-21 19:42:40,472 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-10-21 19:42:40,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdaa1667-d42b-4fb4-abbe-56902f54a1d5/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...