./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f94b0933f59bdad08e4dd8bfb3357d68983a62fb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:32:00,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:32:00,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:32:00,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:32:00,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:32:00,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:32:00,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:32:00,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:32:00,628 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:32:00,633 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:32:00,634 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:32:00,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:32:00,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:32:00,639 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:32:00,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:32:00,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:32:00,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:32:00,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:32:00,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:32:00,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:32:00,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:32:00,661 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:32:00,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:32:00,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:32:00,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:32:00,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:32:00,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:32:00,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:32:00,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:32:00,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:32:00,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:32:00,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:32:00,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:32:00,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:32:00,686 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:32:00,686 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:32:00,687 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:32:00,687 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:32:00,687 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:32:00,688 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:32:00,689 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:32:00,690 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:32:00,723 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:32:00,723 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:32:00,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:32:00,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:32:00,725 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:32:00,726 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:32:00,726 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:32:00,726 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:32:00,726 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:32:00,727 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:32:00,727 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:32:00,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:32:00,728 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:32:00,728 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:32:00,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:32:00,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:32:00,729 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:32:00,729 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:32:00,729 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:32:00,730 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:32:00,730 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:32:00,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:32:00,731 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:32:00,731 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:32:00,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:32:00,731 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:32:00,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:32:00,732 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:32:00,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:32:00,733 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:32:00,734 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:32:00,734 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_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/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_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f94b0933f59bdad08e4dd8bfb3357d68983a62fb [2021-10-11 00:32:01,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:32:01,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:32:01,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:32:01,035 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:32:01,035 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:32:01,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2021-10-11 00:32:01,110 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/data/a5d683e27/29369eb559df4282a463c74f2d30b23f/FLAG4f7941bcf [2021-10-11 00:32:01,649 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:32:01,649 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2021-10-11 00:32:01,660 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/data/a5d683e27/29369eb559df4282a463c74f2d30b23f/FLAG4f7941bcf [2021-10-11 00:32:02,003 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/data/a5d683e27/29369eb559df4282a463c74f2d30b23f [2021-10-11 00:32:02,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:32:02,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:32:02,009 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:02,009 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:32:02,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:32:02,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd4d40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02, skipping insertion in model container [2021-10-11 00:32:02,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:32:02,066 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:32:02,302 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2021-10-11 00:32:02,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:02,313 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:32:02,394 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2021-10-11 00:32:02,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:32:02,412 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:32:02,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02 WrapperNode [2021-10-11 00:32:02,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:32:02,414 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:02,414 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:32:02,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:32:02,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:32:02,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:32:02,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:32:02,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:32:02,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... [2021-10-11 00:32:02,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:32:02,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:32:02,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:32:02,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:32:02,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:32:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:32:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:32:02,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:32:03,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:32:03,247 INFO L299 CfgBuilder]: Removed 23 assume(true) statements. [2021-10-11 00:32:03,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03 BoogieIcfgContainer [2021-10-11 00:32:03,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:32:03,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:32:03,250 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:32:03,253 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:32:03,254 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,254 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:32:02" (1/3) ... [2021-10-11 00:32:03,255 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ceb6a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:32:03, skipping insertion in model container [2021-10-11 00:32:03,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:32:02" (2/3) ... [2021-10-11 00:32:03,256 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ceb6a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:32:03, skipping insertion in model container [2021-10-11 00:32:03,256 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:32:03,256 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03" (3/3) ... [2021-10-11 00:32:03,258 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2021-10-11 00:32:03,309 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:32:03,309 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:32:03,309 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:32:03,310 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:32:03,310 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:32:03,310 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:32:03,310 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:32:03,310 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:32:03,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2021-10-11 00:32:03,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-10-11 00:32:03,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:03,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:03,361 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,362 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,362 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:32:03,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2021-10-11 00:32:03,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-10-11 00:32:03,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:03,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:03,370 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,371 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:03,378 INFO L794 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 34#L198true assume !(0 == ~r1~0);init_~tmp~0 := 0; 32#L198-1true init_#res := init_~tmp~0; 52#L323true main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 44#L22true assume !(0 == assume_abort_if_not_~cond); 18#L21true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 17#L395-2true [2021-10-11 00:32:03,379 INFO L796 eck$LassoCheckResult]: Loop: 17#L395-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 57#L71true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 86#L75true assume !(node1_~m1~0 != ~nomsg~0); 83#L75-1true ~mode1~0 := 0; 51#L71-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 48#L99true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 8#L102true assume !(node2_~m2~0 != ~nomsg~0); 5#L102-1true ~mode2~0 := 0; 45#L99-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 9#L124true assume !(0 != ~mode3~0 % 256); 61#L137true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 58#L137-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 4#L124-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 20#L149true assume !(0 != ~mode4~0 % 256); 66#L162true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite10 := ~send4~0; 64#L162-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 79#L149-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 93#L174true assume !(0 != ~mode5~0 % 256); 33#L187true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 50#L187-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 89#L174-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 77#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 82#L331-1true check_#res := check_~tmp~1; 38#L351true main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 41#L425true assume !(0 == assert_~arg % 256); 3#L420true main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 17#L395-2true [2021-10-11 00:32:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2021-10-11 00:32:03,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:03,394 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788333990] [2021-10-11 00:32:03,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:03,638 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-11 00:32:03,638 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788333990] [2021-10-11 00:32:03,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:03,641 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:03,642 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748374365] [2021-10-11 00:32:03,646 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:32:03,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:03,650 INFO L82 PathProgramCache]: Analyzing trace with hash 2127186332, now seen corresponding path program 1 times [2021-10-11 00:32:03,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:03,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175085012] [2021-10-11 00:32:03,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:03,870 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-11 00:32:03,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175085012] [2021-10-11 00:32:03,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:03,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:03,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316282429] [2021-10-11 00:32:03,876 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:03,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:03,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:03,894 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2021-10-11 00:32:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,009 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2021-10-11 00:32:04,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:04,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2021-10-11 00:32:04,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:32:04,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2021-10-11 00:32:04,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-10-11 00:32:04,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-10-11 00:32:04,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2021-10-11 00:32:04,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,024 INFO L692 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-10-11 00:32:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2021-10-11 00:32:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-10-11 00:32:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-10-11 00:32:04,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2021-10-11 00:32:04,077 INFO L715 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-10-11 00:32:04,077 INFO L595 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2021-10-11 00:32:04,077 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:32:04,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2021-10-11 00:32:04,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:32:04,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,082 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,082 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,083 INFO L794 eck$LassoCheckResult]: Stem: 265#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 231#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 232#L198 assume 0 == ~r1~0; 257#L199 assume ~id1~0 >= 0; 278#L200 assume 0 == ~st1~0; 223#L201 assume ~send1~0 == ~id1~0; 224#L202 assume 0 == ~mode1~0 % 256; 281#L203 assume ~id2~0 >= 0; 242#L204 assume 0 == ~st2~0; 243#L205 assume ~send2~0 == ~id2~0; 267#L206 assume 0 == ~mode2~0 % 256; 286#L207 assume ~id3~0 >= 0; 211#L208 assume 0 == ~st3~0; 212#L209 assume ~send3~0 == ~id3~0; 258#L210 assume 0 == ~mode3~0 % 256; 279#L211 assume ~id4~0 >= 0; 225#L212 assume 0 == ~st4~0; 226#L213 assume ~send4~0 == ~id4~0; 282#L214 assume 0 == ~mode4~0 % 256; 244#L215 assume ~id5~0 >= 0; 245#L216 assume 0 == ~st5~0; 268#L217 assume ~send5~0 == ~id5~0; 287#L218 assume 0 == ~mode5~0 % 256; 213#L219 assume ~id1~0 != ~id2~0; 214#L220 assume ~id1~0 != ~id3~0; 259#L221 assume ~id1~0 != ~id4~0; 280#L222 assume ~id1~0 != ~id5~0; 263#L223 assume ~id2~0 != ~id3~0; 264#L224 assume ~id2~0 != ~id4~0; 283#L225 assume ~id2~0 != ~id5~0; 247#L226 assume ~id3~0 != ~id4~0; 248#L227 assume ~id3~0 != ~id5~0; 269#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 253#L198-1 init_#res := init_~tmp~0; 254#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 266#L22 assume !(0 == assume_abort_if_not_~cond); 234#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 206#L395-2 [2021-10-11 00:32:04,083 INFO L796 eck$LassoCheckResult]: Loop: 206#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 233#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 276#L75 assume !(node1_~m1~0 != ~nomsg~0); 240#L75-1 ~mode1~0 := 0; 236#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 270#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 215#L102 assume !(node2_~m2~0 != ~nomsg~0); 209#L102-1 ~mode2~0 := 0; 210#L99-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 217#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 218#L127 assume !(node3_~m3~0 != ~nomsg~0); 227#L127-1 ~mode3~0 := 0; 207#L124-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 208#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 237#L152 assume !(node4_~m4~0 != ~nomsg~0); 251#L152-1 ~mode4~0 := 0; 285#L149-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 291#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 274#L177 assume !(node5_~m5~0 != ~nomsg~0); 273#L177-1 ~mode5~0 := 0; 272#L174-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 290#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 230#L331-1 check_#res := check_~tmp~1; 261#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 262#L425 assume !(0 == assert_~arg % 256); 205#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 206#L395-2 [2021-10-11 00:32:04,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2021-10-11 00:32:04,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753324663] [2021-10-11 00:32:04,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,115 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,163 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2129274822, now seen corresponding path program 1 times [2021-10-11 00:32:04,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365965575] [2021-10-11 00:32:04,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,301 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-11 00:32:04,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365965575] [2021-10-11 00:32:04,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:32:04,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837086266] [2021-10-11 00:32:04,305 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:04,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:04,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:32:04,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:32:04,309 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand 5 states. [2021-10-11 00:32:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,357 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2021-10-11 00:32:04,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:32:04,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2021-10-11 00:32:04,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:32:04,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2021-10-11 00:32:04,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2021-10-11 00:32:04,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2021-10-11 00:32:04,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2021-10-11 00:32:04,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,364 INFO L692 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-10-11 00:32:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2021-10-11 00:32:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2021-10-11 00:32:04,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-10-11 00:32:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2021-10-11 00:32:04,370 INFO L715 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-10-11 00:32:04,371 INFO L595 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2021-10-11 00:32:04,371 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:32:04,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2021-10-11 00:32:04,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:32:04,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,373 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,375 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,375 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,375 INFO L794 eck$LassoCheckResult]: Stem: 454#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 418#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 419#L198 assume 0 == ~r1~0; 446#L199 assume ~id1~0 >= 0; 465#L200 assume 0 == ~st1~0; 412#L201 assume ~send1~0 == ~id1~0; 413#L202 assume 0 == ~mode1~0 % 256; 470#L203 assume ~id2~0 >= 0; 428#L204 assume 0 == ~st2~0; 429#L205 assume ~send2~0 == ~id2~0; 456#L206 assume 0 == ~mode2~0 % 256; 475#L207 assume ~id3~0 >= 0; 400#L208 assume 0 == ~st3~0; 401#L209 assume ~send3~0 == ~id3~0; 447#L210 assume 0 == ~mode3~0 % 256; 468#L211 assume ~id4~0 >= 0; 414#L212 assume 0 == ~st4~0; 415#L213 assume ~send4~0 == ~id4~0; 471#L214 assume 0 == ~mode4~0 % 256; 433#L215 assume ~id5~0 >= 0; 434#L216 assume 0 == ~st5~0; 457#L217 assume ~send5~0 == ~id5~0; 476#L218 assume 0 == ~mode5~0 % 256; 402#L219 assume ~id1~0 != ~id2~0; 403#L220 assume ~id1~0 != ~id3~0; 448#L221 assume ~id1~0 != ~id4~0; 469#L222 assume ~id1~0 != ~id5~0; 452#L223 assume ~id2~0 != ~id3~0; 453#L224 assume ~id2~0 != ~id4~0; 472#L225 assume ~id2~0 != ~id5~0; 436#L226 assume ~id3~0 != ~id4~0; 437#L227 assume ~id3~0 != ~id5~0; 458#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 442#L198-1 init_#res := init_~tmp~0; 443#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 455#L22 assume !(0 == assume_abort_if_not_~cond); 423#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 395#L395-2 [2021-10-11 00:32:04,375 INFO L796 eck$LassoCheckResult]: Loop: 395#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 422#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 466#L75 assume !(node1_~m1~0 != ~nomsg~0); 431#L75-1 ~mode1~0 := 0; 425#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 459#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 404#L102 assume !(node2_~m2~0 != ~nomsg~0); 398#L102-1 ~mode2~0 := 0; 399#L99-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 406#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 407#L127 assume !(node3_~m3~0 != ~nomsg~0); 420#L127-1 ~mode3~0 := 0; 396#L124-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 397#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 426#L152 assume !(node4_~m4~0 != ~nomsg~0); 440#L152-1 ~mode4~0 := 0; 474#L149-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 480#L174 assume !(0 != ~mode5~0 % 256); 444#L187 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite11 := ~send5~0; 445#L187-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 461#L174-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 479#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 409#L332 assume ~r1~0 >= 5; 410#L336 assume ~r1~0 < 5;check_~tmp~1 := 1; 417#L331-1 check_#res := check_~tmp~1; 450#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 451#L425 assume !(0 == assert_~arg % 256); 394#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 395#L395-2 [2021-10-11 00:32:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2021-10-11 00:32:04,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801682260] [2021-10-11 00:32:04,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,503 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,509 INFO L82 PathProgramCache]: Analyzing trace with hash -991626720, now seen corresponding path program 1 times [2021-10-11 00:32:04,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152358365] [2021-10-11 00:32:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,550 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-11 00:32:04,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152358365] [2021-10-11 00:32:04,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:04,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820186565] [2021-10-11 00:32:04,552 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:32:04,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:04,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:04,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:04,553 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand 3 states. [2021-10-11 00:32:04,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:04,583 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2021-10-11 00:32:04,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:32:04,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2021-10-11 00:32:04,587 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-10-11 00:32:04,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2021-10-11 00:32:04,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2021-10-11 00:32:04,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2021-10-11 00:32:04,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2021-10-11 00:32:04,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:04,591 INFO L692 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-10-11 00:32:04,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2021-10-11 00:32:04,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-10-11 00:32:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-10-11 00:32:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2021-10-11 00:32:04,601 INFO L715 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-10-11 00:32:04,601 INFO L595 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2021-10-11 00:32:04,601 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:32:04,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2021-10-11 00:32:04,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-10-11 00:32:04,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:32:04,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:32:04,605 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,605 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:32:04,610 INFO L794 eck$LassoCheckResult]: Stem: 678#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(35);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 643#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~ret33, main_#t~ret34, main_#t~post35, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~id3~0 := main_#t~nondet21;havoc main_#t~nondet21;~st3~0 := main_#t~nondet22;havoc main_#t~nondet22;~send3~0 := main_#t~nondet23;havoc main_#t~nondet23;~mode3~0 := main_#t~nondet24;havoc main_#t~nondet24;~id4~0 := main_#t~nondet25;havoc main_#t~nondet25;~st4~0 := main_#t~nondet26;havoc main_#t~nondet26;~send4~0 := main_#t~nondet27;havoc main_#t~nondet27;~mode4~0 := main_#t~nondet28;havoc main_#t~nondet28;~id5~0 := main_#t~nondet29;havoc main_#t~nondet29;~st5~0 := main_#t~nondet30;havoc main_#t~nondet30;~send5~0 := main_#t~nondet31;havoc main_#t~nondet31;~mode5~0 := main_#t~nondet32;havoc main_#t~nondet32;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 644#L198 assume 0 == ~r1~0; 670#L199 assume ~id1~0 >= 0; 691#L200 assume 0 == ~st1~0; 635#L201 assume ~send1~0 == ~id1~0; 636#L202 assume 0 == ~mode1~0 % 256; 694#L203 assume ~id2~0 >= 0; 655#L204 assume 0 == ~st2~0; 656#L205 assume ~send2~0 == ~id2~0; 680#L206 assume 0 == ~mode2~0 % 256; 699#L207 assume ~id3~0 >= 0; 624#L208 assume 0 == ~st3~0; 625#L209 assume ~send3~0 == ~id3~0; 671#L210 assume 0 == ~mode3~0 % 256; 692#L211 assume ~id4~0 >= 0; 637#L212 assume 0 == ~st4~0; 638#L213 assume ~send4~0 == ~id4~0; 695#L214 assume 0 == ~mode4~0 % 256; 658#L215 assume ~id5~0 >= 0; 659#L216 assume 0 == ~st5~0; 681#L217 assume ~send5~0 == ~id5~0; 700#L218 assume 0 == ~mode5~0 % 256; 626#L219 assume ~id1~0 != ~id2~0; 627#L220 assume ~id1~0 != ~id3~0; 672#L221 assume ~id1~0 != ~id4~0; 693#L222 assume ~id1~0 != ~id5~0; 676#L223 assume ~id2~0 != ~id3~0; 677#L224 assume ~id2~0 != ~id4~0; 696#L225 assume ~id2~0 != ~id5~0; 660#L226 assume ~id3~0 != ~id4~0; 661#L227 assume ~id3~0 != ~id5~0; 682#L228 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 666#L198-1 init_#res := init_~tmp~0; 667#L323 main_#t~ret33 := init_#res;main_~i2~0 := main_#t~ret33;havoc main_#t~ret33;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 679#L22 assume !(0 == assume_abort_if_not_~cond); 646#L21 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 647#L395-2 [2021-10-11 00:32:04,610 INFO L796 eck$LassoCheckResult]: Loop: 647#L395-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 744#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 689#L75 assume !(node1_~m1~0 != ~nomsg~0); 653#L75-1 ~mode1~0 := 0; 705#L71-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 741#L99 assume !(0 != ~mode2~0 % 256); 737#L112 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 736#L112-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 734#L99-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 733#L124 assume !(0 != ~mode3~0 % 256); 729#L137 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 728#L137-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 726#L124-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 725#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 722#L152 assume !(node4_~m4~0 != ~nomsg~0); 720#L152-1 ~mode4~0 := 0; 718#L149-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 717#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 714#L177 assume !(node5_~m5~0 != ~nomsg~0); 712#L177-1 ~mode5~0 := 0; 710#L174-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 709#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 708#L332 assume !(~r1~0 >= 5); 706#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 707#L336 assume ~r1~0 < 5;check_~tmp~1 := 1; 748#L331-1 check_#res := check_~tmp~1; 747#L351 main_#t~ret34 := check_#res;main_~c1~0 := main_#t~ret34;havoc main_#t~ret34;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 746#L425 assume !(0 == assert_~arg % 256); 745#L420 main_#t~post35 := main_~i2~0;main_~i2~0 := 1 + main_#t~post35;havoc main_#t~post35; 647#L395-2 [2021-10-11 00:32:04,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2021-10-11 00:32:04,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651102095] [2021-10-11 00:32:04,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,675 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 180648827, now seen corresponding path program 1 times [2021-10-11 00:32:04,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025952449] [2021-10-11 00:32:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,689 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:32:04,701 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:32:04,708 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:32:04,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1618481079, now seen corresponding path program 1 times [2021-10-11 00:32:04,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:32:04,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670280355] [2021-10-11 00:32:04,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:32:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:04,774 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-11 00:32:04,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670280355] [2021-10-11 00:32:04,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:32:04,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:32:04,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717668156] [2021-10-11 00:32:05,313 WARN L197 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 148 [2021-10-11 00:32:05,920 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 134 [2021-10-11 00:32:05,933 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:32:05,934 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:32:05,934 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:32:05,934 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:32:05,935 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-11 00:32:05,935 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:05,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:32:05,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:32:05,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2021-10-11 00:32:05,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:32:05,936 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:32:05,969 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-11 00:32:05,977 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-11 00:32:05,985 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-11 00:32:05,993 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-11 00:32:06,004 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-11 00:32:06,008 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-11 00:32:06,011 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-11 00:32:06,015 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-11 00:32:06,024 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-11 00:32:06,027 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-11 00:32:06,045 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-11 00:32:06,052 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-11 00:32:06,055 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-11 00:32:06,061 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-11 00:32:06,068 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-11 00:32:06,299 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-10-11 00:32:06,300 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-11 00:32:06,308 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-11 00:32:06,312 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-11 00:32:06,819 WARN L197 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-10-11 00:32:06,866 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-11 00:32:13,521 WARN L197 SmtUtils]: Spent 6.47 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2021-10-11 00:32:13,577 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:32:13,578 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:13,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-11 00:32:13,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-11 00:32:13,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-10-11 00:32:13,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node2_#t~ite8=0} Honda state: {ULTIMATE.start_node2_#t~ite8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:13,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-11 00:32:13,629 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:32:13,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-11 00:32:13,690 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:13,857 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-11 00:32:13,859 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:32:13,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:32:13,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:32:13,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:32:13,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:32:13,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:13,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:32:13,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:32:13,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2021-10-11 00:32:13,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:32:13,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:32:13,863 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-11 00:32:13,880 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-11 00:32:13,887 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-11 00:32:13,894 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-11 00:32:13,896 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-11 00:32:13,899 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-11 00:32:13,902 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-11 00:32:13,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-11 00:32:13,922 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-11 00:32:13,925 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-11 00:32:13,932 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-11 00:32:13,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-11 00:32:13,942 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-11 00:32:13,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-11 00:32:13,956 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-11 00:32:13,963 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-11 00:32:14,198 WARN L197 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-10-11 00:32:14,199 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-11 00:32:14,202 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-11 00:32:14,800 WARN L197 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2021-10-11 00:32:14,814 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-10-11 00:32:21,141 WARN L197 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2021-10-11 00:32:21,170 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:32:21,174 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:21,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:32:21,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:32:21,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:32:21,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:32:21,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:32:21,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:32:21,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:32:21,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:32:21,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:21,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:32:21,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:32:21,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:32:21,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:32:21,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:32:21,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:32:21,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:32:21,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:32:21,235 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:32:21,239 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-11 00:32:21,240 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5854af02-6c3b-4aee-941f-a3e9d8aa49c7/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:32:21,254 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:32:21,254 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-11 00:32:21,254 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:32:21,255 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:32:21,277 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-11 00:32:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:32:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:21,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:32:21,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:32:21,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:32:21,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:32:21,511 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-11 00:32:21,514 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-11 00:32:21,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 3 states. [2021-10-11 00:32:21,578 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 224 states and 323 transitions. Complement of second has 4 states. [2021-10-11 00:32:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-11 00:32:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:32:21,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2021-10-11 00:32:21,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 29 letters. [2021-10-11 00:32:21,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:21,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 66 letters. Loop has 29 letters. [2021-10-11 00:32:21,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:21,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 58 letters. [2021-10-11 00:32:21,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:32:21,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 323 transitions. [2021-10-11 00:32:21,598 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:21,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2021-10-11 00:32:21,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:32:21,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:32:21,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:32:21,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:21,599 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:21,599 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:21,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:32:21,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:32:21,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:32:21,601 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2021-10-11 00:32:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:32:21,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-11 00:32:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:32:21,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-11 00:32:21,601 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:21,601 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:32:21,601 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:32:21,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:32:21,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:32:21,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:32:21,602 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:21,602 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:21,602 INFO L595 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:32:21,602 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:32:21,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:32:21,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:32:21,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-11 00:32:21,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:32:21 BoogieIcfgContainer [2021-10-11 00:32:21,610 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:32:21,613 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:32:21,613 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:32:21,613 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:32:21,614 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:32:03" (3/4) ... [2021-10-11 00:32:21,616 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-11 00:32:21,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:32:21,618 INFO L168 Benchmark]: Toolchain (without parser) took 19610.47 ms. Allocated memory was 130.0 MB in the beginning and 287.3 MB in the end (delta: 157.3 MB). Free memory was 90.6 MB in the beginning and 127.3 MB in the end (delta: -36.7 MB). Peak memory consumption was 120.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,623 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 130.0 MB. Free memory was 107.4 MB in the beginning and 107.4 MB in the end (delta: 60.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:32:21,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.30 ms. Allocated memory is still 130.0 MB. Free memory was 90.4 MB in the beginning and 100.6 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 130.0 MB. Free memory was 100.6 MB in the beginning and 98.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,625 INFO L168 Benchmark]: Boogie Preprocessor took 39.16 ms. Allocated memory is still 130.0 MB. Free memory was 98.5 MB in the beginning and 96.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,626 INFO L168 Benchmark]: RCFGBuilder took 738.59 ms. Allocated memory is still 130.0 MB. Free memory was 96.5 MB in the beginning and 57.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,627 INFO L168 Benchmark]: BuchiAutomizer took 18361.14 ms. Allocated memory was 130.0 MB in the beginning and 287.3 MB in the end (delta: 157.3 MB). Free memory was 57.5 MB in the beginning and 128.3 MB in the end (delta: -70.9 MB). Peak memory consumption was 87.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,629 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 287.3 MB. Free memory was 128.3 MB in the beginning and 127.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:32:21,638 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.21 ms. Allocated memory is still 130.0 MB. Free memory was 107.4 MB in the beginning and 107.4 MB in the end (delta: 60.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 404.30 ms. Allocated memory is still 130.0 MB. Free memory was 90.4 MB in the beginning and 100.6 MB in the end (delta: -10.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.82 ms. Allocated memory is still 130.0 MB. Free memory was 100.6 MB in the beginning and 98.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.16 ms. Allocated memory is still 130.0 MB. Free memory was 98.5 MB in the beginning and 96.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 738.59 ms. Allocated memory is still 130.0 MB. Free memory was 96.5 MB in the beginning and 57.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.8 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 18361.14 ms. Allocated memory was 130.0 MB in the beginning and 287.3 MB in the end (delta: 157.3 MB). Free memory was 57.5 MB in the beginning and 128.3 MB in the end (delta: -70.9 MB). Peak memory consumption was 87.3 MB. Max. memory is 16.1 GB. * Witness Printer took 3.89 ms. Allocated memory is still 287.3 MB. Free memory was 128.3 MB in the beginning and 127.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 19 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 17.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 550 SDtfs, 258 SDslu, 937 SDs, 0 SdLazy, 36 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital216 mio100 ax100 hnf100 lsp74 ukn69 mio100 lsp100 div155 bol100 ite100 ukn100 eq175 hnf71 smp100 dnf5255 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...