./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.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_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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_486cd37a-8c82-49e8-9a57-a54c55f173fb/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 ab0d7ed38d703b77ecce8ef936b571b5f0d8f70a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29:29,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:29:29,269 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:29:29,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:29:29,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:29:29,310 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:29:29,311 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:29:29,314 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:29:29,316 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:29:29,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:29:29,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:29:29,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:29:29,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:29:29,322 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:29:29,323 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:29:29,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:29:29,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:29:29,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:29:29,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:29:29,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:29:29,334 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:29:29,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:29:29,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:29:29,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:29:29,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:29:29,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:29:29,343 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:29:29,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:29:29,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:29:29,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:29:29,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:29:29,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:29:29,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:29:29,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:29:29,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:29:29,352 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:29:29,353 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:29:29,353 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:29:29,354 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:29:29,355 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:29:29,356 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:29:29,357 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:29:29,388 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:29:29,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:29:29,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:29:29,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:29:29,399 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:29:29,399 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:29:29,400 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:29:29,400 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:29:29,400 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:29:29,400 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:29:29,401 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:29:29,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:29:29,401 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:29:29,401 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:29:29,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:29:29,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:29:29,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:29:29,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:29:29,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:29:29,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:29:29,404 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:29:29,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:29:29,404 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:29:29,405 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:29:29,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:29:29,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:29:29,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:29:29,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:29:29,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:29:29,408 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:29:29,409 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:29:29,410 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_486cd37a-8c82-49e8-9a57-a54c55f173fb/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_486cd37a-8c82-49e8-9a57-a54c55f173fb/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 -> ab0d7ed38d703b77ecce8ef936b571b5f0d8f70a [2021-10-11 00:29:29,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:29:29,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:29:29,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:29:29,720 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:29:29,721 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:29:29,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:29,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/data/5c8f4e00a/4da6f13d5e704b408dee34b0ad97530e/FLAG53f21fd65 [2021-10-11 00:29:30,256 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:29:30,257 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:30,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/data/5c8f4e00a/4da6f13d5e704b408dee34b0ad97530e/FLAG53f21fd65 [2021-10-11 00:29:30,630 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/bin/uautomizer-Z5i5R5N3CC/data/5c8f4e00a/4da6f13d5e704b408dee34b0ad97530e [2021-10-11 00:29:30,633 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:29:30,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:29:30,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:30,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:29:30,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:29:30,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:30,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@468c8953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30, skipping insertion in model container [2021-10-11 00:29:30,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:30,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:29:30,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:29:30,890 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_486cd37a-8c82-49e8-9a57-a54c55f173fb/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2021-10-11 00:29:30,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:30,900 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:29:30,942 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_486cd37a-8c82-49e8-9a57-a54c55f173fb/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2021-10-11 00:29:30,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:30,960 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:29:30,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30 WrapperNode [2021-10-11 00:29:30,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:30,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:30,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:29:30,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:29:30,970 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:29:30" (1/1) ... [2021-10-11 00:29:30,980 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:29:30" (1/1) ... [2021-10-11 00:29:31,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:31,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:29:31,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:29:31,029 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:29:31,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,055 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... [2021-10-11 00:29:31,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:29:31,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:29:31,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:29:31,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:29:31,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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:29:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:29:31,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:29:31,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:29:31,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:29:31,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:29:31,717 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-10-11 00:29:31,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:31 BoogieIcfgContainer [2021-10-11 00:29:31,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:29:31,720 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:29:31,720 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:29:31,725 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:29:31,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:31,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:29:30" (1/3) ... [2021-10-11 00:29:31,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b3fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:31, skipping insertion in model container [2021-10-11 00:29:31,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:31,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:30" (2/3) ... [2021-10-11 00:29:31,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b3fdb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:31, skipping insertion in model container [2021-10-11 00:29:31,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:31,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:31" (3/3) ... [2021-10-11 00:29:31,730 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:31,776 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:29:31,776 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:29:31,776 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:29:31,776 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:29:31,776 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:29:31,776 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:29:31,776 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:29:31,777 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:29:31,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2021-10-11 00:29:31,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-10-11 00:29:31,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:31,812 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:31,819 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:31,819 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:31,819 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:29:31,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states. [2021-10-11 00:29:31,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-10-11 00:29:31,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:31,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:31,827 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:31,828 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:31,833 INFO L794 eck$LassoCheckResult]: Stem: 34#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(47);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;~alive1~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;~alive2~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;~alive3~0 := 0; 11#L-1true havoc main_#res;havoc 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~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 67#L159true assume !(0 == ~r1~0);init_~tmp~0 := 0; 44#L159-1true init_#res := init_~tmp~0; 57#L228true main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 30#L275true assume 0 == main_~i2~0;assume false; 27#L275-2true ~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;main_~i2~0 := 0; 56#L283-2true [2021-10-11 00:29:31,834 INFO L796 eck$LassoCheckResult]: Loop: 56#L283-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 80#L57true 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 65#L61true assume !(node1_~m1~0 != ~nomsg~0); 63#L61-1true ~mode1~0 := 0; 73#L57-2true havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 29#L92true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 33#L95true assume !(node2_~m2~0 != ~nomsg~0); 10#L95-1true ~mode2~0 := 0; 25#L92-2true havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 45#L126true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 49#L129true assume !(node3_~m3~0 != ~nomsg~0); 48#L129-1true ~mode3~0 := 0; 43#L126-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 72#L236true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 70#L236-1true check_#res := check_~tmp~1; 20#L248true main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14#L307true assume !(0 == assert_~arg % 256); 79#L302true main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 56#L283-2true [2021-10-11 00:29:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-10-11 00:29:31,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:31,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197213838] [2021-10-11 00:29:31,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:32,100 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:29:32,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197213838] [2021-10-11 00:29:32,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:32,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:29:32,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488460461] [2021-10-11 00:29:32,108 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:29:32,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 1 times [2021-10-11 00:29:32,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:32,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077085330] [2021-10-11 00:29:32,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:32,356 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:29:32,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077085330] [2021-10-11 00:29:32,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:32,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:32,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20365782] [2021-10-11 00:29:32,359 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:32,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:32,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 00:29:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 00:29:32,384 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2021-10-11 00:29:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:32,407 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2021-10-11 00:29:32,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:29:32,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2021-10-11 00:29:32,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:32,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2021-10-11 00:29:32,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-10-11 00:29:32,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-10-11 00:29:32,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2021-10-11 00:29:32,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:32,438 INFO L692 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-10-11 00:29:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2021-10-11 00:29:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-10-11 00:29:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 00:29:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2021-10-11 00:29:32,486 INFO L715 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-10-11 00:29:32,486 INFO L595 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-10-11 00:29:32,486 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:29:32,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2021-10-11 00:29:32,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:32,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:32,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:32,499 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:32,499 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:32,500 INFO L794 eck$LassoCheckResult]: Stem: 218#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(47);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;~alive1~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;~alive2~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;~alive3~0 := 0; 183#L-1 havoc main_#res;havoc 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~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 184#L159 assume !(0 == ~r1~0);init_~tmp~0 := 0; 170#L159-1 init_#res := init_~tmp~0; 227#L228 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 215#L275 assume !(0 == main_~i2~0); 211#L275-2 ~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;main_~i2~0 := 0; 212#L283-2 [2021-10-11 00:29:32,500 INFO L796 eck$LassoCheckResult]: Loop: 212#L283-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 235#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 238#L61 assume !(node1_~m1~0 != ~nomsg~0); 181#L61-1 ~mode1~0 := 0; 230#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 213#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 214#L95 assume !(node2_~m2~0 != ~nomsg~0); 178#L95-1 ~mode2~0 := 0; 179#L92-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 208#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 226#L129 assume !(node3_~m3~0 != ~nomsg~0); 202#L129-1 ~mode3~0 := 0; 172#L126-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 225#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 196#L236-1 check_#res := check_~tmp~1; 200#L248 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 187#L307 assume !(0 == assert_~arg % 256); 188#L302 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 212#L283-2 [2021-10-11 00:29:32,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:32,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-10-11 00:29:32,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:32,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953699681] [2021-10-11 00:29:32,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:32,590 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:29:32,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953699681] [2021-10-11 00:29:32,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:32,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:32,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866621295] [2021-10-11 00:29:32,592 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:29:32,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:32,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 2 times [2021-10-11 00:29:32,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:32,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828533684] [2021-10-11 00:29:32,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:32,728 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:29:32,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828533684] [2021-10-11 00:29:32,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:32,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:32,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657992367] [2021-10-11 00:29:32,730 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:32,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:32,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:32,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:32,737 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand 5 states. [2021-10-11 00:29:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:32,857 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2021-10-11 00:29:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:29:32,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2021-10-11 00:29:32,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:32,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2021-10-11 00:29:32,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-10-11 00:29:32,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-10-11 00:29:32,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2021-10-11 00:29:32,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:32,876 INFO L692 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2021-10-11 00:29:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2021-10-11 00:29:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2021-10-11 00:29:32,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 00:29:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2021-10-11 00:29:32,882 INFO L715 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-10-11 00:29:32,882 INFO L595 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-10-11 00:29:32,882 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:29:32,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2021-10-11 00:29:32,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:32,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:32,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:32,884 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] [2021-10-11 00:29:32,885 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:32,888 INFO L794 eck$LassoCheckResult]: Stem: 432#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(47);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;~alive1~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;~alive2~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;~alive3~0 := 0; 397#L-1 havoc main_#res;havoc 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~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 398#L159 assume 0 == ~r1~0; 403#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 404#L161 assume ~id1~0 >= 0; 433#L162 assume 0 == ~st1~0; 445#L163 assume ~send1~0 == ~id1~0; 418#L164 assume 0 == ~mode1~0 % 256; 419#L165 assume ~id2~0 >= 0; 423#L166 assume 0 == ~st2~0; 438#L167 assume ~send2~0 == ~id2~0; 390#L168 assume 0 == ~mode2~0 % 256; 391#L169 assume ~id3~0 >= 0; 430#L170 assume 0 == ~st3~0; 405#L171 assume ~send3~0 == ~id3~0; 406#L172 assume 0 == ~mode3~0 % 256; 434#L173 assume ~id1~0 != ~id2~0; 446#L174 assume ~id1~0 != ~id3~0; 381#L175 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 382#L159-1 init_#res := init_~tmp~0; 440#L228 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 429#L275 assume !(0 == main_~i2~0); 424#L275-2 ~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;main_~i2~0 := 0; 425#L283-2 [2021-10-11 00:29:32,889 INFO L796 eck$LassoCheckResult]: Loop: 425#L283-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 449#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 452#L61 assume !(node1_~m1~0 != ~nomsg~0); 393#L61-1 ~mode1~0 := 0; 444#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 427#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 428#L95 assume !(node2_~m2~0 != ~nomsg~0); 395#L95-1 ~mode2~0 := 0; 396#L92-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 422#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 441#L129 assume !(node3_~m3~0 != ~nomsg~0); 416#L129-1 ~mode3~0 := 0; 386#L126-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 439#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 413#L236-1 check_#res := check_~tmp~1; 414#L248 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 401#L307 assume !(0 == assert_~arg % 256); 402#L302 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 425#L283-2 [2021-10-11 00:29:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:32,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-10-11 00:29:32,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:32,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307102533] [2021-10-11 00:29:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:32,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:33,008 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,041 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:33,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:33,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 3 times [2021-10-11 00:29:33,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:33,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7492739] [2021-10-11 00:29:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:33,147 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:29:33,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7492739] [2021-10-11 00:29:33,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:33,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:33,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744611791] [2021-10-11 00:29:33,148 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:33,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:33,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:33,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:33,150 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand 5 states. [2021-10-11 00:29:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:33,224 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2021-10-11 00:29:33,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:29:33,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2021-10-11 00:29:33,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:33,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2021-10-11 00:29:33,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-10-11 00:29:33,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-10-11 00:29:33,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2021-10-11 00:29:33,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:33,237 INFO L692 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-10-11 00:29:33,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2021-10-11 00:29:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-10-11 00:29:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 00:29:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2021-10-11 00:29:33,243 INFO L715 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-10-11 00:29:33,243 INFO L595 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-10-11 00:29:33,243 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:29:33,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2021-10-11 00:29:33,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-10-11 00:29:33,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:33,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:33,245 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] [2021-10-11 00:29:33,245 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] [2021-10-11 00:29:33,245 INFO L794 eck$LassoCheckResult]: Stem: 593#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(47);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;~alive1~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;~alive2~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;~alive3~0 := 0; 558#L-1 havoc main_#res;havoc 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~ret29, main_#t~ret30, main_#t~post31, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet13;havoc main_#t~nondet13;~id1~0 := main_#t~nondet14;havoc main_#t~nondet14;~st1~0 := main_#t~nondet15;havoc main_#t~nondet15;~send1~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode1~0 := main_#t~nondet17;havoc main_#t~nondet17;~alive1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~alive2~0 := main_#t~nondet23;havoc main_#t~nondet23;~id3~0 := main_#t~nondet24;havoc main_#t~nondet24;~st3~0 := main_#t~nondet25;havoc main_#t~nondet25;~send3~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode3~0 := main_#t~nondet27;havoc main_#t~nondet27;~alive3~0 := main_#t~nondet28;havoc main_#t~nondet28;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 559#L159 assume 0 == ~r1~0; 564#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 565#L161 assume ~id1~0 >= 0; 594#L162 assume 0 == ~st1~0; 606#L163 assume ~send1~0 == ~id1~0; 579#L164 assume 0 == ~mode1~0 % 256; 580#L165 assume ~id2~0 >= 0; 584#L166 assume 0 == ~st2~0; 599#L167 assume ~send2~0 == ~id2~0; 551#L168 assume 0 == ~mode2~0 % 256; 552#L169 assume ~id3~0 >= 0; 591#L170 assume 0 == ~st3~0; 566#L171 assume ~send3~0 == ~id3~0; 567#L172 assume 0 == ~mode3~0 % 256; 595#L173 assume ~id1~0 != ~id2~0; 607#L174 assume ~id1~0 != ~id3~0; 544#L175 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 545#L159-1 init_#res := init_~tmp~0; 602#L228 main_#t~ret29 := init_#res;main_~i2~0 := main_#t~ret29;havoc main_#t~ret29; 590#L275 assume !(0 == main_~i2~0); 586#L275-2 ~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;main_~i2~0 := 0; 587#L283-2 [2021-10-11 00:29:33,245 INFO L796 eck$LassoCheckResult]: Loop: 587#L283-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_#t~ite8, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 610#L57 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 613#L61 assume !(node1_~m1~0 != ~nomsg~0); 554#L61-1 ~mode1~0 := 0; 605#L57-2 havoc node2_#t~ite9, node2_#t~ite10, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 588#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 589#L95 assume !(node2_~m2~0 != ~nomsg~0); 556#L95-1 ~mode2~0 := 0; 557#L92-2 havoc node3_#t~ite11, node3_#t~ite12, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 583#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 601#L129 assume !(node3_~m3~0 != ~nomsg~0); 577#L129-1 ~mode3~0 := 0; 547#L126-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 600#L236 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 569#L237 assume ~r1~0 < 3;check_~tmp~1 := 1; 571#L236-1 check_#res := check_~tmp~1; 575#L248 main_#t~ret30 := check_#res;main_~c1~0 := main_#t~ret30;havoc main_#t~ret30;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 562#L307 assume !(0 == assert_~arg % 256); 563#L302 main_#t~post31 := main_~i2~0;main_~i2~0 := 1 + main_#t~post31;havoc main_#t~post31; 587#L283-2 [2021-10-11 00:29:33,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:33,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-10-11 00:29:33,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:33,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088499643] [2021-10-11 00:29:33,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:33,273 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:33,307 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,316 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:33,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1995544096, now seen corresponding path program 1 times [2021-10-11 00:29:33,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:33,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442211795] [2021-10-11 00:29:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:33,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:33,347 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:33,366 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:33,366 INFO L82 PathProgramCache]: Analyzing trace with hash 964547683, now seen corresponding path program 1 times [2021-10-11 00:29:33,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:33,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839139079] [2021-10-11 00:29:33,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:33,417 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:29:33,418 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839139079] [2021-10-11 00:29:33,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:33,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:29:33,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632473792] [2021-10-11 00:29:33,705 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2021-10-11 00:29:33,952 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-10-11 00:29:33,963 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:29:33,964 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:29:33,964 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:29:33,964 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:29:33,964 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-11 00:29:33,964 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:33,965 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:29:33,965 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:29:33,965 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-10-11 00:29:33,965 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:29:33,965 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:29:33,988 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:29:34,001 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:29:34,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:29:34,007 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:29:34,013 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:29:34,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:29:34,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:29:34,036 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:29:34,039 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:29:34,050 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:29:34,053 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:29:34,062 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:29:34,096 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:29:34,104 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:29:34,110 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:29:34,113 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:29:34,144 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:29:34,667 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:29:34,668 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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) [2021-10-11 00:29:34,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-11 00:29:34,682 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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) [2021-10-11 00:29:34,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-11 00:29:34,751 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:34,806 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-11 00:29:34,808 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:29:34,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:29:34,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:29:34,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:29:34,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:29:34,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:34,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:29:34,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:29:34,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-10-11 00:29:34,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:29:34,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:29:34,812 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:29:34,819 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:29:34,822 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:29:34,828 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:29:34,831 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:29:34,838 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:29:34,841 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:29:34,849 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:29:34,852 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:29:34,855 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:29:34,857 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:29:34,864 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:29:34,870 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:29:34,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:29:34,890 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:29:34,917 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:29:34,919 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:29:35,450 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:29:35,455 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_486cd37a-8c82-49e8-9a57-a54c55f173fb/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:35,476 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:29:35,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:29:35,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:29:35,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:29:35,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:29:35,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:29:35,483 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:29:35,483 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-10-11 00:29:35,499 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:29:35,523 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-11 00:29:35,523 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_486cd37a-8c82-49e8-9a57-a54c55f173fb/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) [2021-10-11 00:29:35,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:29:35,574 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-11 00:29:35,575 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:29:35,575 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:35,608 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-11 00:29:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:35,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:29:35,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:29:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:35,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:29:35,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:29:35,898 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:29:35,902 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:29:35,903 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand 3 states. [2021-10-11 00:29:35,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 123 states and 180 transitions. Complement of second has 4 states. [2021-10-11 00:29:35,966 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:29:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:29:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2021-10-11 00:29:35,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2021-10-11 00:29:35,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:35,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2021-10-11 00:29:35,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:35,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2021-10-11 00:29:35,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:35,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2021-10-11 00:29:35,975 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:35,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2021-10-11 00:29:35,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:29:35,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:29:35,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:29:35,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:35,976 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:35,976 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:35,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:35,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:29:35,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:29:35,977 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2021-10-11 00:29:35,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:35,977 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-11 00:29:35,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:29:35,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-11 00:29:35,978 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:35,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:29:35,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:29:35,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:29:35,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:29:35,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:35,979 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:35,979 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:35,979 INFO L595 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:35,979 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:29:35,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:29:35,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:35,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-11 00:29:35,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:29:35 BoogieIcfgContainer [2021-10-11 00:29:35,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:29:35,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:29:35,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:29:35,987 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:29:35,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:31" (3/4) ... [2021-10-11 00:29:35,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-11 00:29:35,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:29:35,992 INFO L168 Benchmark]: Toolchain (without parser) took 5356.72 ms. Allocated memory was 86.0 MB in the beginning and 138.4 MB in the end (delta: 52.4 MB). Free memory was 49.0 MB in the beginning and 87.3 MB in the end (delta: -38.3 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:35,992 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 86.0 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:35,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.22 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 48.8 MB in the beginning and 84.0 MB in the end (delta: -35.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:35,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 81.9 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:29:35,995 INFO L168 Benchmark]: Boogie Preprocessor took 31.35 ms. Allocated memory is still 109.1 MB. Free memory was 81.9 MB in the beginning and 79.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:35,995 INFO L168 Benchmark]: RCFGBuilder took 658.53 ms. Allocated memory is still 109.1 MB. Free memory was 79.9 MB in the beginning and 47.8 MB in the end (delta: 32.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:35,996 INFO L168 Benchmark]: BuchiAutomizer took 4265.63 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 47.8 MB in the beginning and 87.3 MB in the end (delta: -39.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:35,996 INFO L168 Benchmark]: Witness Printer took 4.23 ms. Allocated memory is still 138.4 MB. Free memory is still 87.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:36,000 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.31 ms. Allocated memory is still 86.0 MB. Free memory is still 66.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 325.22 ms. Allocated memory was 86.0 MB in the beginning and 109.1 MB in the end (delta: 23.1 MB). Free memory was 48.8 MB in the beginning and 84.0 MB in the end (delta: -35.2 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.90 ms. Allocated memory is still 109.1 MB. Free memory was 84.0 MB in the beginning and 81.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 31.35 ms. Allocated memory is still 109.1 MB. Free memory was 81.9 MB in the beginning and 79.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 658.53 ms. Allocated memory is still 109.1 MB. Free memory was 79.9 MB in the beginning and 47.8 MB in the end (delta: 32.1 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4265.63 ms. Allocated memory was 109.1 MB in the beginning and 138.4 MB in the end (delta: 29.4 MB). Free memory was 47.8 MB in the beginning and 87.3 MB in the end (delta: -39.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.23 ms. Allocated memory is still 138.4 MB. Free memory is still 87.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 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 4.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 441 SDtfs, 260 SDslu, 699 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf100 lsp31 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 118ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...