./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a --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 a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 16:55:15,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:55:15,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:55:15,946 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:55:15,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:55:15,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:55:15,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:55:15,952 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:55:15,954 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:55:15,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:55:15,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:55:15,967 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:55:15,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:55:15,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:55:15,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:55:15,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:55:15,979 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:55:15,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:55:15,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:55:15,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:55:15,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:55:15,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:55:15,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:55:15,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:55:15,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:55:15,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:55:15,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:55:15,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:55:15,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:55:15,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:55:15,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:55:15,999 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:55:16,000 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:55:16,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:55:16,002 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:55:16,002 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:55:16,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:55:16,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:55:16,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:55:16,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:55:16,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:55:16,007 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-21 16:55:16,037 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:55:16,037 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:55:16,037 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:55:16,038 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:55:16,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:55:16,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:55:16,040 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:55:16,040 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-21 16:55:16,040 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-21 16:55:16,040 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-21 16:55:16,041 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-21 16:55:16,041 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-21 16:55:16,041 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-21 16:55:16,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:55:16,042 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:55:16,042 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 16:55:16,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:55:16,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:55:16,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:55:16,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-21 16:55:16,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-21 16:55:16,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-21 16:55:16,043 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:55:16,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:55:16,044 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-21 16:55:16,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:55:16,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-21 16:55:16,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:55:16,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:55:16,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:55:16,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:55:16,047 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-21 16:55:16,047 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_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/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_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a 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 -> a44e961521da9b8f4535724e185f402d94bec27d495ab6df10e2b3c1ffa4513a [2022-11-21 16:55:16,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:55:16,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:55:16,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:55:16,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:55:16,357 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:55:16,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-11-21 16:55:19,567 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:55:19,800 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:55:19,801 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-11-21 16:55:19,811 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/data/ba2dc5b27/2000dff6e2b64a389cee0df231444a60/FLAG76061f901 [2022-11-21 16:55:19,826 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/data/ba2dc5b27/2000dff6e2b64a389cee0df231444a60 [2022-11-21 16:55:19,829 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:55:19,830 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:55:19,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:55:19,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:55:19,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:55:19,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:55:19" (1/1) ... [2022-11-21 16:55:19,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206633e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:19, skipping insertion in model container [2022-11-21 16:55:19,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:55:19" (1/1) ... [2022-11-21 16:55:19,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:55:19,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:55:20,125 WARN L237 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_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-11-21 16:55:20,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:55:20,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:55:20,222 WARN L237 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_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c[16936,16949] [2022-11-21 16:55:20,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:55:20,243 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:55:20,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20 WrapperNode [2022-11-21 16:55:20,244 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:55:20,245 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:55:20,245 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:55:20,245 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:55:20,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,323 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 392 [2022-11-21 16:55:20,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:55:20,324 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:55:20,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:55:20,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:55:20,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,393 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:55:20,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:55:20,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:55:20,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:55:20,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (1/1) ... [2022-11-21 16:55:20,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:55:20,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:55:20,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:55:20,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-21 16:55:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:55:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:55:20,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:55:20,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:55:20,589 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:55:20,591 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:55:21,199 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:55:21,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:55:21,210 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-21 16:55:21,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:21 BoogieIcfgContainer [2022-11-21 16:55:21,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:55:21,214 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-21 16:55:21,214 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-21 16:55:21,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-21 16:55:21,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:55:21,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 04:55:19" (1/3) ... [2022-11-21 16:55:21,233 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a0ab0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:55:21, skipping insertion in model container [2022-11-21 16:55:21,233 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:55:21,233 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:55:20" (2/3) ... [2022-11-21 16:55:21,234 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a0ab0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 04:55:21, skipping insertion in model container [2022-11-21 16:55:21,234 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-21 16:55:21,234 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:21" (3/3) ... [2022-11-21 16:55:21,235 INFO L332 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2022-11-21 16:55:21,314 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-21 16:55:21,314 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-21 16:55:21,315 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-21 16:55:21,315 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-21 16:55:21,315 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-21 16:55:21,315 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-21 16:55:21,315 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-21 16:55:21,316 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-21 16:55:21,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:21,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-21 16:55:21,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:55:21,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:55:21,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:21,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:21,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-21 16:55:21,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:21,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-11-21 16:55:21,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:55:21,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:55:21,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:21,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:21,387 INFO L748 eck$LassoCheckResult]: Stem: 100#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 36#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 25#L288true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 55#L288-1true init_#res#1 := init_~tmp~0#1; 40#L453true main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 38#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 84#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 74#L529-2true [2022-11-21 16:55:21,389 INFO L750 eck$LassoCheckResult]: Loop: 74#L529-2true assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 98#L84true assume !(0 != ~mode1~0 % 256); 44#L102true assume 0 != ~alive1~0 % 256;~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256); 37#L105-2true ~mode1~0 := 1; 24#L84-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 101#L119true assume !(0 != ~mode2~0 % 256); 15#L136true assume 0 != ~alive2~0 % 256;~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256); 17#L139-2true ~mode2~0 := 1; 42#L119-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 8#L153true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 111#L156true assume !(node3_~m3~0#1 != ~nomsg~0); 87#L156-1true ~mode3~0 := 0; 105#L153-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 103#L187true assume !(0 != ~mode4~0 % 256); 91#L204true assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 78#L207-2true ~mode4~0 := 1; 73#L187-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 77#L221true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 67#L224true assume !(node5_~m5~0#1 != ~nomsg~0); 102#L224-1true ~mode5~0 := 0; 51#L221-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 18#L255true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 30#L258true assume !(node6_~m6~0#1 != ~nomsg~0); 11#L258-1true ~mode6~0 := 0; 110#L255-2true assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 3#L461true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 45#L461-1true check_#res#1 := check_~tmp~1#1; 108#L473true main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 72#L562true assume !(0 == assert_~arg#1 % 256); 118#L557true assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 74#L529-2true [2022-11-21 16:55:21,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2022-11-21 16:55:21,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:21,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799506859] [2022-11-21 16:55:21,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:21,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:21,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:21,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:21,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799506859] [2022-11-21 16:55:21,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799506859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:21,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:55:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607813424] [2022-11-21 16:55:21,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:21,603 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:55:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2019514314, now seen corresponding path program 1 times [2022-11-21 16:55:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:21,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022552580] [2022-11-21 16:55:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:22,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:22,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022552580] [2022-11-21 16:55:22,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022552580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:22,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:22,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:55:22,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517798234] [2022-11-21 16:55:22,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:22,220 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:55:22,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:55:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:55:22,295 INFO L87 Difference]: Start difference. First operand has 120 states, 119 states have (on average 1.7563025210084033) internal successors, (209), 119 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:22,317 INFO L93 Difference]: Finished difference Result 120 states and 206 transitions. [2022-11-21 16:55:22,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 206 transitions. [2022-11-21 16:55:22,354 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:22,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 115 states and 201 transitions. [2022-11-21 16:55:22,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-21 16:55:22,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-21 16:55:22,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 201 transitions. [2022-11-21 16:55:22,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:55:22,375 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-21 16:55:22,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 201 transitions. [2022-11-21 16:55:22,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-21 16:55:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.7478260869565216) internal successors, (201), 114 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 201 transitions. [2022-11-21 16:55:22,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-21 16:55:22,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:55:22,439 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 201 transitions. [2022-11-21 16:55:22,439 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-21 16:55:22,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 201 transitions. [2022-11-21 16:55:22,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:22,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:55:22,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:55:22,445 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:22,445 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:22,449 INFO L748 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 309#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 297#L288 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 256#L288-1 init_#res#1 := init_~tmp~0#1; 312#L453 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 310#L22 assume !(0 == assume_abort_if_not_~cond#1); 311#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 352#L529-2 [2022-11-21 16:55:22,450 INFO L750 eck$LassoCheckResult]: Loop: 352#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 353#L84 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 357#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 306#L88-1 ~mode1~0 := 0; 295#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 296#L119 assume !(0 != ~mode2~0 % 256); 275#L136 assume 0 != ~alive2~0 % 256;~p2_new~0 := (if (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 <= 127 then (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 else (if ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0 then ~send2~0 else ~p2_new~0) % 256 - 256); 276#L139-2 ~mode2~0 := 1; 279#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 264#L153 assume !(0 != ~mode3~0 % 256); 265#L170 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 323#L173-2 ~mode3~0 := 1; 360#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 364#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 325#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 327#L190-1 ~mode4~0 := 0; 350#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 351#L221 assume !(0 != ~mode5~0 % 256); 292#L238 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 293#L241-2 ~mode5~0 := 1; 324#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 280#L255 assume !(0 != ~mode6~0 % 256); 281#L272 assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 313#L275-2 ~mode6~0 := 1; 273#L255-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 251#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 252#L461-1 check_#res#1 := check_~tmp~1#1; 318#L473 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 348#L562 assume !(0 == assert_~arg#1 % 256); 349#L557 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 352#L529-2 [2022-11-21 16:55:22,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:22,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2022-11-21 16:55:22,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:22,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830033698] [2022-11-21 16:55:22,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:22,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:22,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830033698] [2022-11-21 16:55:22,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830033698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:22,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:22,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:55:22,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358746575] [2022-11-21 16:55:22,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:22,507 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-21 16:55:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:22,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1849311369, now seen corresponding path program 1 times [2022-11-21 16:55:22,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:22,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081473789] [2022-11-21 16:55:22,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:22,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:22,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:22,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081473789] [2022-11-21 16:55:22,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081473789] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:22,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:22,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:55:22,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224055132] [2022-11-21 16:55:22,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:22,790 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:55:22,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:22,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:55:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:55:22,792 INFO L87 Difference]: Start difference. First operand 115 states and 201 transitions. cyclomatic complexity: 87 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:22,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:22,939 INFO L93 Difference]: Finished difference Result 118 states and 203 transitions. [2022-11-21 16:55:22,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 203 transitions. [2022-11-21 16:55:22,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:22,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 160 transitions. [2022-11-21 16:55:22,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-21 16:55:22,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-21 16:55:22,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 160 transitions. [2022-11-21 16:55:22,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:55:22,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-21 16:55:22,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 160 transitions. [2022-11-21 16:55:22,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-21 16:55:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.391304347826087) internal successors, (160), 114 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2022-11-21 16:55:22,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-21 16:55:22,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:55:22,960 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 160 transitions. [2022-11-21 16:55:22,960 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-21 16:55:22,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 160 transitions. [2022-11-21 16:55:22,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:22,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:55:22,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:55:22,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:22,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:22,969 INFO L748 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 556#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 544#L288 assume 0 == ~r1~0; 545#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 551#L290 assume ~id1~0 >= 0; 589#L291 assume 0 == ~st1~0; 590#L292 assume ~send1~0 == ~id1~0; 604#L293 assume 0 == ~mode1~0 % 256; 610#L294 assume ~id2~0 >= 0; 506#L295 assume 0 == ~st2~0; 507#L296 assume ~send2~0 == ~id2~0; 550#L297 assume 0 == ~mode2~0 % 256; 547#L298 assume ~id3~0 >= 0; 548#L299 assume 0 == ~st3~0; 554#L300 assume ~send3~0 == ~id3~0; 582#L301 assume 0 == ~mode3~0 % 256; 600#L302 assume ~id4~0 >= 0; 601#L303 assume 0 == ~st4~0; 607#L304 assume ~send4~0 == ~id4~0; 575#L305 assume 0 == ~mode4~0 % 256; 576#L306 assume ~id5~0 >= 0; 588#L307 assume 0 == ~st5~0; 514#L308 assume ~send5~0 == ~id5~0; 515#L309 assume 0 == ~mode5~0 % 256; 585#L310 assume ~id6~0 >= 0; 566#L311 assume 0 == ~st6~0; 567#L312 assume ~send6~0 == ~id6~0; 537#L313 assume 0 == ~mode6~0 % 256; 538#L314 assume ~id1~0 != ~id2~0; 562#L315 assume ~id1~0 != ~id3~0; 563#L316 assume ~id1~0 != ~id4~0; 504#L317 assume ~id1~0 != ~id5~0; 505#L318 assume ~id1~0 != ~id6~0; 613#L319 assume ~id2~0 != ~id3~0; 595#L320 assume ~id2~0 != ~id4~0; 577#L321 assume ~id2~0 != ~id5~0; 578#L322 assume ~id2~0 != ~id6~0; 502#L323 assume ~id3~0 != ~id4~0; 503#L324 assume ~id3~0 != ~id5~0; 522#L325 assume ~id3~0 != ~id6~0; 546#L326 assume ~id4~0 != ~id5~0; 532#L327 assume ~id4~0 != ~id6~0; 533#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 579#L288-1 init_#res#1 := init_~tmp~0#1; 559#L453 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 557#L22 assume !(0 == assume_abort_if_not_~cond#1); 558#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 602#L529-2 [2022-11-21 16:55:22,970 INFO L750 eck$LassoCheckResult]: Loop: 602#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 603#L84 assume !(0 != ~mode1~0 % 256); 564#L102 assume 0 != ~alive1~0 % 256;~p1_new~0 := (if (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 <= 127 then (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 else (if ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0 then ~send1~0 else ~p1_new~0) % 256 - 256); 531#L105-2 ~mode1~0 := 1; 542#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 543#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 568#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 536#L122-1 ~mode2~0 := 0; 526#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 511#L153 assume !(0 != ~mode3~0 % 256); 512#L170 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 570#L173-2 ~mode3~0 := 1; 608#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 612#L187 assume !(0 != ~mode4~0 % 256); 609#L204 assume 0 != ~alive4~0 % 256;~p4_new~0 := (if (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 <= 127 then (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 else (if ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0 then ~send4~0 else ~p4_new~0) % 256 - 256); 587#L207-2 ~mode4~0 := 1; 598#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 599#L221 assume !(0 != ~mode5~0 % 256); 539#L238 assume 0 != ~alive5~0 % 256;~p5_new~0 := (if (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 <= 127 then (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 else (if ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0 then ~send5~0 else ~p5_new~0) % 256 - 256); 540#L241-2 ~mode5~0 := 1; 571#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 527#L255 assume !(0 != ~mode6~0 % 256); 528#L272 assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 560#L275-2 ~mode6~0 := 1; 520#L255-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 499#L461 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; 500#L461-1 check_#res#1 := check_~tmp~1#1; 565#L473 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 596#L562 assume !(0 == assert_~arg#1 % 256); 597#L557 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 602#L529-2 [2022-11-21 16:55:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:22,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2022-11-21 16:55:22,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:22,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104190751] [2022-11-21 16:55:22,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:22,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,015 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:55:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:55:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:23,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1654481848, now seen corresponding path program 1 times [2022-11-21 16:55:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069301152] [2022-11-21 16:55:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:23,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:23,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069301152] [2022-11-21 16:55:23,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069301152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:23,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:23,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 16:55:23,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287068825] [2022-11-21 16:55:23,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:23,428 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-21 16:55:23,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:55:23,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 16:55:23,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 16:55:23,430 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. cyclomatic complexity: 46 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:55:23,484 INFO L93 Difference]: Finished difference Result 118 states and 162 transitions. [2022-11-21 16:55:23,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 162 transitions. [2022-11-21 16:55:23,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:23,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 115 states and 158 transitions. [2022-11-21 16:55:23,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2022-11-21 16:55:23,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 115 [2022-11-21 16:55:23,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 158 transitions. [2022-11-21 16:55:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:55:23,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-21 16:55:23,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 158 transitions. [2022-11-21 16:55:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-21 16:55:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 115 states have (on average 1.373913043478261) internal successors, (158), 114 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:55:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2022-11-21 16:55:23,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-21 16:55:23,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 16:55:23,504 INFO L428 stractBuchiCegarLoop]: Abstraction has 115 states and 158 transitions. [2022-11-21 16:55:23,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-21 16:55:23,504 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 158 transitions. [2022-11-21 16:55:23,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-11-21 16:55:23,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-21 16:55:23,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-21 16:55:23,512 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:23,512 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:55:23,512 INFO L748 eck$LassoCheckResult]: Stem: 856#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(48, 2);call #Ultimate.allocInit(12, 3);~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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0; 800#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~id1~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~st1~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~send1~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~mode1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~alive1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id2~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st2~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~alive2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~id3~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~st3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~send3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~alive3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id4~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~alive4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~id5~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~send5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~mode5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~alive5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~id6~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~st6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~send6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~mode6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~alive6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 788#L288 assume 0 == ~r1~0; 789#L289 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 795#L290 assume ~id1~0 >= 0; 834#L291 assume 0 == ~st1~0; 835#L292 assume ~send1~0 == ~id1~0; 849#L293 assume 0 == ~mode1~0 % 256; 855#L294 assume ~id2~0 >= 0; 750#L295 assume 0 == ~st2~0; 751#L296 assume ~send2~0 == ~id2~0; 794#L297 assume 0 == ~mode2~0 % 256; 791#L298 assume ~id3~0 >= 0; 792#L299 assume 0 == ~st3~0; 798#L300 assume ~send3~0 == ~id3~0; 827#L301 assume 0 == ~mode3~0 % 256; 845#L302 assume ~id4~0 >= 0; 846#L303 assume 0 == ~st4~0; 852#L304 assume ~send4~0 == ~id4~0; 820#L305 assume 0 == ~mode4~0 % 256; 821#L306 assume ~id5~0 >= 0; 833#L307 assume 0 == ~st5~0; 758#L308 assume ~send5~0 == ~id5~0; 759#L309 assume 0 == ~mode5~0 % 256; 830#L310 assume ~id6~0 >= 0; 811#L311 assume 0 == ~st6~0; 812#L312 assume ~send6~0 == ~id6~0; 781#L313 assume 0 == ~mode6~0 % 256; 782#L314 assume ~id1~0 != ~id2~0; 806#L315 assume ~id1~0 != ~id3~0; 807#L316 assume ~id1~0 != ~id4~0; 748#L317 assume ~id1~0 != ~id5~0; 749#L318 assume ~id1~0 != ~id6~0; 858#L319 assume ~id2~0 != ~id3~0; 840#L320 assume ~id2~0 != ~id4~0; 822#L321 assume ~id2~0 != ~id5~0; 823#L322 assume ~id2~0 != ~id6~0; 746#L323 assume ~id3~0 != ~id4~0; 747#L324 assume ~id3~0 != ~id5~0; 766#L325 assume ~id3~0 != ~id6~0; 790#L326 assume ~id4~0 != ~id5~0; 776#L327 assume ~id4~0 != ~id6~0; 777#L328 assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; 824#L288-1 init_#res#1 := init_~tmp~0#1; 803#L453 main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 801#L22 assume !(0 == assume_abort_if_not_~cond#1); 802#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 847#L529-2 [2022-11-21 16:55:23,513 INFO L750 eck$LassoCheckResult]: Loop: 847#L529-2 assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 848#L84 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#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 850#L88 assume !(node1_~m1~0#1 != ~nomsg~0); 797#L88-1 ~mode1~0 := 0; 786#L84-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 787#L119 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 813#L122 assume !(node2_~m2~0#1 != ~nomsg~0); 780#L122-1 ~mode2~0 := 0; 770#L119-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 755#L153 assume !(0 != ~mode3~0 % 256); 756#L170 assume 0 != ~alive3~0 % 256;~p3_new~0 := (if (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 <= 127 then (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 else (if ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0 then ~send3~0 else ~p3_new~0) % 256 - 256); 815#L173-2 ~mode3~0 := 1; 853#L153-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 857#L187 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 817#L190 assume !(node4_~m4~0#1 != ~nomsg~0); 819#L190-1 ~mode4~0 := 0; 843#L187-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 844#L221 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 836#L224 assume !(node5_~m5~0#1 != ~nomsg~0); 761#L224-1 ~mode5~0 := 0; 816#L221-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 771#L255 assume !(0 != ~mode6~0 % 256); 772#L272 assume 0 != ~alive6~0 % 256;~p6_new~0 := (if (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 <= 127 then (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 else (if ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0 then ~send6~0 else ~p6_new~0) % 256 - 256); 804#L275-2 ~mode6~0 := 1; 764#L255-2 assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 744#L461 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 745#L462 assume ~r1~0 < 6;check_~tmp~1#1 := 1; 809#L461-1 check_#res#1 := check_~tmp~1#1; 810#L473 main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 841#L562 assume !(0 == assert_~arg#1 % 256); 842#L557 assume { :end_inline_assert } true;main_#t~post37#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post37#1;havoc main_#t~post37#1; 847#L529-2 [2022-11-21 16:55:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2022-11-21 16:55:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:23,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50087731] [2022-11-21 16:55:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:23,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:23,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:55:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:55:23,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 416023801, now seen corresponding path program 1 times [2022-11-21 16:55:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:23,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331828013] [2022-11-21 16:55:23,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 16:55:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 16:55:23,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 16:55:23,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:55:23,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1291054680, now seen corresponding path program 1 times [2022-11-21 16:55:23,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:55:23,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893727683] [2022-11-21 16:55:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:55:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:55:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:55:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:55:23,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:55:23,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893727683] [2022-11-21 16:55:23,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893727683] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:55:23,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:55:23,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:55:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091008532] [2022-11-21 16:55:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:55:26,056 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:55:26,056 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:55:26,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:55:26,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:55:26,057 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-21 16:55:26,057 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:55:26,057 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:55:26,057 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:55:26,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-11-21 16:55:26,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:55:26,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:55:26,085 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,097 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,103 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,108 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,113 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,122 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,128 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,158 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,689 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,693 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:26,700 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:28,092 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2022-11-21 16:55:28,478 WARN L176 XnfTransformerHelper]: Simplifying disjunction of 6675 conjuctions. This might take some time... [2022-11-21 16:55:29,167 INFO L192 XnfTransformerHelper]: Simplified to disjunction of 418 conjuctions. [2022-11-21 16:55:56,655 WARN L233 SmtUtils]: Spent 27.31s on a formula simplification. DAG size of input: 382 DAG size of output: 178 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 16:55:56,731 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:55:56,732 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-21 16:55:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:55:56,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:55:56,738 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:55:56,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-21 16:55:56,760 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 16:55:56,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-21 16:55:56,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:55:56,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:55:56,797 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:55:56,798 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:55:56,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-21 16:55:56,811 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-21 16:55:56,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-21 16:55:56,948 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-21 16:55:56,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:55:56,958 INFO L210 LassoAnalysis]: Preferences: [2022-11-21 16:55:56,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-21 16:55:56,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-21 16:55:56,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-21 16:55:56,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-21 16:55:56,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:55:56,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-21 16:55:56,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-21 16:55:56,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2022-11-21 16:55:56,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-21 16:55:56,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-21 16:55:56,964 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:56,975 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:56,981 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:56,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:56,994 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,496 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,508 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,523 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,529 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,536 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,547 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,552 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,557 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,561 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:57,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-21 16:55:58,912 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2022-11-21 16:56:26,262 WARN L233 SmtUtils]: Spent 26.51s on a formula simplification. DAG size of input: 382 DAG size of output: 178 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-11-21 16:56:26,402 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-21 16:56:26,406 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-21 16:56:26,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:56:26,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:56:26,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:56:26,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:56:26,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:56:26,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:56:26,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:56:26,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:56:26,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:56:26,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:56:26,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:56:26,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-21 16:56:26,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:56:26,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:56:26,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:56:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:56:26,464 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:56:26,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:56:26,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:56:26,489 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:56:26,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:56:26,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:56:26,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:56:26,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-21 16:56:26,492 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:56:26,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:56:26,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-21 16:56:26,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:56:26,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:56:26,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:56:26,525 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:56:26,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-21 16:56:26,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-21 16:56:26,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-21 16:56:26,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-21 16:56:26,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-21 16:56:26,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-21 16:56:26,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-21 16:56:26,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-21 16:56:26,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-21 16:56:26,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-21 16:56:26,611 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-21 16:56:26,611 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-21 16:56:26,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-21 16:56:26,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:56:26,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-21 16:56:26,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-21 16:56:26,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-21 16:56:26,704 INFO L513 LassoAnalysis]: Proved termination. [2022-11-21 16:56:26,705 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 23 Supporting invariants [] [2022-11-21 16:56:26,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-21 16:56:26,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:56:26,715 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-21 16:56:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:56:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:56:26,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 16:56:26,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:56:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:56:26,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-21 16:56:26,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:56:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:56:27,078 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-11-21 16:56:27,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115 states and 158 transitions. cyclomatic complexity: 44 Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:56:27,156 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115 states and 158 transitions. cyclomatic complexity: 44. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 183 states and 270 transitions. Complement of second has 4 states. [2022-11-21 16:56:27,158 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 [2022-11-21 16:56:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:56:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-11-21 16:56:27,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 158 transitions. Stem has 47 letters. Loop has 31 letters. [2022-11-21 16:56:27,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:56:27,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 158 transitions. Stem has 78 letters. Loop has 31 letters. [2022-11-21 16:56:27,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:56:27,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 158 transitions. Stem has 47 letters. Loop has 62 letters. [2022-11-21 16:56:27,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-21 16:56:27,171 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 270 transitions. [2022-11-21 16:56:27,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-21 16:56:27,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 0 states and 0 transitions. [2022-11-21 16:56:27,175 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-21 16:56:27,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-21 16:56:27,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-21 16:56:27,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:56:27,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:56:27,176 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:56:27,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:56:27,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:56:27,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:56:27,177 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:56:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 16:56:27,177 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-11-21 16:56:27,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-11-21 16:56:27,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-21 16:56:27,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-11-21 16:56:27,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-21 16:56:27,178 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-21 16:56:27,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-21 16:56:27,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:56:27,178 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:56:27,179 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:56:27,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:56:27,181 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-21 16:56:27,181 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-21 16:56:27,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-21 16:56:27,182 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-21 16:56:27,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-21 16:56:27,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.11 04:56:27 BoogieIcfgContainer [2022-11-21 16:56:27,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-21 16:56:27,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 16:56:27,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 16:56:27,195 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 16:56:27,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:55:21" (3/4) ... [2022-11-21 16:56:27,199 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-21 16:56:27,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 16:56:27,200 INFO L158 Benchmark]: Toolchain (without parser) took 67369.13ms. Allocated memory was 132.1MB in the beginning and 249.6MB in the end (delta: 117.4MB). Free memory was 88.0MB in the beginning and 94.5MB in the end (delta: -6.5MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,201 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory was 97.3MB in the beginning and 97.3MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:56:27,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.69ms. Allocated memory is still 132.1MB. Free memory was 87.6MB in the beginning and 71.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.28ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 70.8MB in the beginning and 143.7MB in the end (delta: -72.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,205 INFO L158 Benchmark]: Boogie Preprocessor took 74.66ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 142.7MB in the end (delta: 961.7kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,210 INFO L158 Benchmark]: RCFGBuilder took 802.45ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 114.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,213 INFO L158 Benchmark]: BuchiAutomizer took 65979.18ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 113.3MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. [2022-11-21 16:56:27,214 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 249.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 16:56:27,216 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.36ms. Allocated memory is still 132.1MB. Free memory was 97.3MB in the beginning and 97.3MB in the end (delta: 31.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.69ms. Allocated memory is still 132.1MB. Free memory was 87.6MB in the beginning and 71.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.28ms. Allocated memory was 132.1MB in the beginning and 172.0MB in the end (delta: 39.8MB). Free memory was 70.8MB in the beginning and 143.7MB in the end (delta: -72.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.66ms. Allocated memory is still 172.0MB. Free memory was 143.7MB in the beginning and 142.7MB in the end (delta: 961.7kB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * RCFGBuilder took 802.45ms. Allocated memory is still 172.0MB. Free memory was 142.7MB in the beginning and 114.4MB in the end (delta: 28.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 65979.18ms. Allocated memory was 172.0MB in the beginning and 249.6MB in the end (delta: 77.6MB). Free memory was 113.3MB in the beginning and 94.5MB in the end (delta: 18.9MB). Peak memory consumption was 97.5MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 249.6MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * 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 23 + -2 * i2 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 65.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 64.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 1849 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1130 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 719 mSDtfsCounter, 26 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital311 mio100 ax100 hnf100 lsp223 ukn41 mio100 lsp100 div131 bol100 ite100 ukn100 eq171 hnf95 smp78 dnf11733 smp14 tf100 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 46ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-21 16:56:27,236 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:56:27,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd48ed64-fc5d-4f68-9b77-ff0b1a8a6b41/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE