./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 776db5900df2e210f2c2746932f1a55f834fc2cb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:29:44,713 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:29:44,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:29:44,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:29:44,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:29:44,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:29:44,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:29:44,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:29:44,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:29:44,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:29:44,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:29:44,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:29:44,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:29:44,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:29:44,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:29:44,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:29:44,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:29:44,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:29:44,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:29:44,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:29:44,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:29:44,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:29:44,783 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:29:44,784 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:29:44,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:29:44,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:29:44,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:29:44,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:29:44,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:29:44,800 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:29:44,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:29:44,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:29:44,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:29:44,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:29:44,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:29:44,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:29:44,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:29:44,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:29:44,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:29:44,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:29:44,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:29:44,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-10-11 00:29:44,855 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:29:44,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:29:44,856 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:29:44,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:29:44,857 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:29:44,857 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-10-11 00:29:44,858 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-10-11 00:29:44,858 INFO L138 SettingsManager]: * Use old map elimination=false [2021-10-11 00:29:44,858 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-10-11 00:29:44,858 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-10-11 00:29:44,858 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-10-11 00:29:44,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:29:44,859 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:29:44,859 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-11 00:29:44,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:29:44,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:29:44,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:29:44,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-10-11 00:29:44,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-10-11 00:29:44,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-10-11 00:29:44,861 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:29:44,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:29:44,861 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-10-11 00:29:44,861 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:29:44,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-10-11 00:29:44,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:29:44,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:29:44,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:29:44,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:29:44,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:29:44,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-10-11 00:29:44,864 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_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 776db5900df2e210f2c2746932f1a55f834fc2cb [2021-10-11 00:29:45,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:29:45,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:29:45,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:29:45,242 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:29:45,243 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:29:45,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:45,322 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/data/cfa2e5113/36a977f42e7b43bbaabc3771a154460c/FLAG91339a968 [2021-10-11 00:29:45,931 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:29:45,932 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:45,949 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/data/cfa2e5113/36a977f42e7b43bbaabc3771a154460c/FLAG91339a968 [2021-10-11 00:29:46,246 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/data/cfa2e5113/36a977f42e7b43bbaabc3771a154460c [2021-10-11 00:29:46,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:29:46,250 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:29:46,252 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:46,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:29:46,256 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:29:46,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33776d75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46, skipping insertion in model container [2021-10-11 00:29:46,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:29:46,324 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:29:46,584 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2021-10-11 00:29:46,584 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:46,595 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:29:46,650 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c[6691,6704] [2021-10-11 00:29:46,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:29:46,672 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:29:46,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46 WrapperNode [2021-10-11 00:29:46,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:29:46,675 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:46,675 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:29:46,675 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:29:46,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:29:46,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:29:46,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:29:46,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:29:46,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,802 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... [2021-10-11 00:29:46,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:29:46,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:29:46,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:29:46,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:29:46,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:29:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:29:46,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:29:46,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:29:47,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:29:47,711 INFO L299 CfgBuilder]: Removed 17 assume(true) statements. [2021-10-11 00:29:47,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:47 BoogieIcfgContainer [2021-10-11 00:29:47,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:29:47,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-10-11 00:29:47,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-10-11 00:29:47,721 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-10-11 00:29:47,722 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:47,734 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 11.10 12:29:46" (1/3) ... [2021-10-11 00:29:47,735 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1382886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:47, skipping insertion in model container [2021-10-11 00:29:47,735 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:47,735 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:29:46" (2/3) ... [2021-10-11 00:29:47,736 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1382886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 11.10 12:29:47, skipping insertion in model container [2021-10-11 00:29:47,736 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-10-11 00:29:47,736 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:47" (3/3) ... [2021-10-11 00:29:47,738 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2021-10-11 00:29:47,805 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-10-11 00:29:47,805 INFO L360 BuchiCegarLoop]: Hoare is false [2021-10-11 00:29:47,805 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-10-11 00:29:47,805 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:29:47,805 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:29:47,806 INFO L364 BuchiCegarLoop]: Difference is false [2021-10-11 00:29:47,806 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:29:47,806 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-10-11 00:29:47,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2021-10-11 00:29:47,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2021-10-11 00:29:47,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:47,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:47,857 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:47,857 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:47,857 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2021-10-11 00:29:47,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states. [2021-10-11 00:29:47,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2021-10-11 00:29:47,863 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:47,864 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:47,865 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:47,865 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:47,873 INFO L794 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 6#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 57#L156true assume !(0 == ~r1~0);init_~tmp~0 := 0; 55#L156-1true init_#res := init_~tmp~0; 70#L225true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 40#L272true assume 0 == main_~i2~0;assume false; 52#L272-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 69#L280-2true [2021-10-11 00:29:47,874 INFO L796 eck$LassoCheckResult]: Loop: 69#L280-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 76#L57true assume !(0 != ~mode1~0 % 256); 67#L75true assume !(0 != ~alive1~0 % 256); 46#L75-2true ~mode1~0 := 1; 73#L57-2true havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 54#L89true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 23#L92true assume !(node2_~m2~0 != ~nomsg~0); 22#L92-1true ~mode2~0 := 0; 50#L89-2true havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 56#L123true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 45#L126true assume !(node3_~m3~0 != ~nomsg~0); 44#L126-1true ~mode3~0 := 0; 77#L123-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 63#L233true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 61#L233-1true check_#res := check_~tmp~1; 30#L245true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38#L304true assume !(0 == assert_~arg % 256); 12#L299true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 69#L280-2true [2021-10-11 00:29:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-10-11 00:29:47,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:47,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546847863] [2021-10-11 00:29:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:48,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546847863] [2021-10-11 00:29:48,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:48,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:29:48,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944057330] [2021-10-11 00:29:48,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:29:48,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780898, now seen corresponding path program 1 times [2021-10-11 00:29:48,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213850245] [2021-10-11 00:29:48,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:48,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:48,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213850245] [2021-10-11 00:29:48,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:48,209 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:48,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125305361] [2021-10-11 00:29:48,211 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:48,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:48,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-11 00:29:48,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-11 00:29:48,232 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 2 states. [2021-10-11 00:29:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:48,256 INFO L93 Difference]: Finished difference Result 75 states and 120 transitions. [2021-10-11 00:29:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:29:48,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 120 transitions. [2021-10-11 00:29:48,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 70 states and 115 transitions. [2021-10-11 00:29:48,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-10-11 00:29:48,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-10-11 00:29:48,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 115 transitions. [2021-10-11 00:29:48,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:48,281 INFO L692 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-10-11 00:29:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 115 transitions. [2021-10-11 00:29:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-10-11 00:29:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 00:29:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 115 transitions. [2021-10-11 00:29:48,329 INFO L715 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-10-11 00:29:48,329 INFO L595 BuchiCegarLoop]: Abstraction has 70 states and 115 transitions. [2021-10-11 00:29:48,330 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2021-10-11 00:29:48,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 115 transitions. [2021-10-11 00:29:48,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:48,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:48,337 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,337 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,337 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 172#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 173#L156 assume !(0 == ~r1~0);init_~tmp~0 := 0; 162#L156-1 init_#res := init_~tmp~0; 224#L225 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 213#L272 assume !(0 == main_~i2~0); 214#L272-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 183#L280-2 [2021-10-11 00:29:48,338 INFO L796 eck$LassoCheckResult]: Loop: 183#L280-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 230#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 225#L61 assume !(node1_~m1~0 != ~nomsg~0); 167#L61-1 ~mode1~0 := 0; 218#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 223#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 197#L92 assume !(node2_~m2~0 != ~nomsg~0); 196#L92-1 ~mode2~0 := 0; 179#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 221#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 217#L126 assume !(node3_~m3~0 != ~nomsg~0); 170#L126-1 ~mode3~0 := 0; 211#L123-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 227#L233 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 186#L233-1 check_#res := check_~tmp~1; 205#L245 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 206#L304 assume !(0 == assert_~arg % 256); 182#L299 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 183#L280-2 [2021-10-11 00:29:48,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-10-11 00:29:48,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317588379] [2021-10-11 00:29:48,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:48,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317588379] [2021-10-11 00:29:48,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:48,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:48,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372570028] [2021-10-11 00:29:48,439 INFO L799 eck$LassoCheckResult]: stem already infeasible [2021-10-11 00:29:48,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1181507580, now seen corresponding path program 1 times [2021-10-11 00:29:48,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352937454] [2021-10-11 00:29:48,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:48,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352937454] [2021-10-11 00:29:48,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:48,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:48,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149428924] [2021-10-11 00:29:48,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:48,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:48,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:48,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:48,585 INFO L87 Difference]: Start difference. First operand 70 states and 115 transitions. cyclomatic complexity: 46 Second operand 5 states. [2021-10-11 00:29:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:48,674 INFO L93 Difference]: Finished difference Result 120 states and 192 transitions. [2021-10-11 00:29:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:29:48,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 192 transitions. [2021-10-11 00:29:48,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 117 states and 173 transitions. [2021-10-11 00:29:48,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2021-10-11 00:29:48,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2021-10-11 00:29:48,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 173 transitions. [2021-10-11 00:29:48,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:48,683 INFO L692 BuchiCegarLoop]: Abstraction has 117 states and 173 transitions. [2021-10-11 00:29:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 173 transitions. [2021-10-11 00:29:48,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2021-10-11 00:29:48,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 00:29:48,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2021-10-11 00:29:48,689 INFO L715 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2021-10-11 00:29:48,689 INFO L595 BuchiCegarLoop]: Abstraction has 70 states and 98 transitions. [2021-10-11 00:29:48,689 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2021-10-11 00:29:48,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 98 transitions. [2021-10-11 00:29:48,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:48,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:48,707 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,707 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,707 INFO L794 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 376#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 377#L156 assume 0 == ~r1~0; 366#L157 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 367#L158 assume ~id1~0 >= 0; 403#L159 assume 0 == ~st1~0; 380#L160 assume ~send1~0 == ~id1~0; 381#L161 assume 0 == ~mode1~0 % 256; 412#L162 assume ~id2~0 >= 0; 427#L163 assume 0 == ~st2~0; 394#L164 assume ~send2~0 == ~id2~0; 395#L165 assume 0 == ~mode2~0 % 256; 399#L166 assume ~id3~0 >= 0; 420#L167 assume 0 == ~st3~0; 368#L168 assume ~send3~0 == ~id3~0; 369#L169 assume 0 == ~mode3~0 % 256; 404#L170 assume ~id1~0 != ~id2~0; 382#L171 assume ~id1~0 != ~id3~0; 383#L172 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 413#L156-1 init_#res := init_~tmp~0; 429#L225 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 417#L272 assume !(0 == main_~i2~0); 418#L272-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 387#L280-2 [2021-10-11 00:29:48,708 INFO L796 eck$LassoCheckResult]: Loop: 387#L280-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 435#L57 assume !(0 != ~mode1~0 % 256); 433#L75 assume !(0 != ~alive1~0 % 256); 379#L75-2 ~mode1~0 := 1; 423#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 428#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 401#L92 assume !(node2_~m2~0 != ~nomsg~0); 400#L92-1 ~mode2~0 := 0; 385#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 426#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 422#L126 assume !(node3_~m3~0 != ~nomsg~0); 374#L126-1 ~mode3~0 := 0; 416#L123-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 432#L233 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 392#L233-1 check_#res := check_~tmp~1; 409#L245 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 410#L304 assume !(0 == assert_~arg % 256); 386#L299 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 387#L280-2 [2021-10-11 00:29:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-10-11 00:29:48,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130305201] [2021-10-11 00:29:48,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:48,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:48,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:48,826 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:48,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1582780898, now seen corresponding path program 2 times [2021-10-11 00:29:48,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093671020] [2021-10-11 00:29:48,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:48,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093671020] [2021-10-11 00:29:48,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:48,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:29:48,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378120317] [2021-10-11 00:29:48,908 INFO L811 eck$LassoCheckResult]: loop already infeasible [2021-10-11 00:29:48,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:48,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:29:48,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:29:48,910 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. cyclomatic complexity: 29 Second operand 5 states. [2021-10-11 00:29:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:48,965 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2021-10-11 00:29:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:29:48,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 100 transitions. [2021-10-11 00:29:48,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 70 states and 96 transitions. [2021-10-11 00:29:48,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2021-10-11 00:29:48,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2021-10-11 00:29:48,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 96 transitions. [2021-10-11 00:29:48,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:48,971 INFO L692 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-10-11 00:29:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 96 transitions. [2021-10-11 00:29:48,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2021-10-11 00:29:48,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2021-10-11 00:29:48,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2021-10-11 00:29:48,976 INFO L715 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-10-11 00:29:48,976 INFO L595 BuchiCegarLoop]: Abstraction has 70 states and 96 transitions. [2021-10-11 00:29:48,977 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2021-10-11 00:29:48,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 96 transitions. [2021-10-11 00:29:48,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2021-10-11 00:29:48,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-10-11 00:29:48,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-10-11 00:29:48,979 INFO L853 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,980 INFO L854 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:29:48,980 INFO L794 eck$LassoCheckResult]: Stem: 566#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(49);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 528#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 529#L156 assume 0 == ~r1~0; 521#L157 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 522#L158 assume ~id1~0 >= 0; 558#L159 assume 0 == ~st1~0; 535#L160 assume ~send1~0 == ~id1~0; 536#L161 assume 0 == ~mode1~0 % 256; 567#L162 assume ~id2~0 >= 0; 582#L163 assume 0 == ~st2~0; 549#L164 assume ~send2~0 == ~id2~0; 550#L165 assume 0 == ~mode2~0 % 256; 554#L166 assume ~id3~0 >= 0; 575#L167 assume 0 == ~st3~0; 523#L168 assume ~send3~0 == ~id3~0; 524#L169 assume 0 == ~mode3~0 % 256; 559#L170 assume ~id1~0 != ~id2~0; 539#L171 assume ~id1~0 != ~id3~0; 540#L172 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 568#L156-1 init_#res := init_~tmp~0; 584#L225 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 572#L272 assume !(0 == main_~i2~0); 573#L272-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 538#L280-2 [2021-10-11 00:29:48,980 INFO L796 eck$LassoCheckResult]: Loop: 538#L280-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 590#L57 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 585#L61 assume !(node1_~m1~0 != ~nomsg~0); 526#L61-1 ~mode1~0 := 0; 578#L57-2 havoc node2_#t~ite8, node2_#t~ite9, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 583#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 556#L92 assume !(node2_~m2~0 != ~nomsg~0); 555#L92-1 ~mode2~0 := 0; 542#L89-2 havoc node3_#t~ite10, node3_#t~ite11, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 581#L123 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 577#L126 assume !(node3_~m3~0 != ~nomsg~0); 531#L126-1 ~mode3~0 := 0; 571#L123-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 587#L233 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 563#L234 assume ~r1~0 < 3;check_~tmp~1 := 1; 547#L233-1 check_#res := check_~tmp~1; 564#L245 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 565#L304 assume !(0 == assert_~arg % 256); 537#L299 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 538#L280-2 [2021-10-11 00:29:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-10-11 00:29:48,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:48,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070436777] [2021-10-11 00:29:48,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:49,001 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:49,034 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:49,052 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:49,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1644643412, now seen corresponding path program 1 times [2021-10-11 00:29:49,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:49,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115238909] [2021-10-11 00:29:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:49,069 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:29:49,078 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:29:49,083 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:29:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:49,084 INFO L82 PathProgramCache]: Analyzing trace with hash 309767895, now seen corresponding path program 1 times [2021-10-11 00:29:49,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:29:49,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833946173] [2021-10-11 00:29:49,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:29:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:49,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833946173] [2021-10-11 00:29:49,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:29:49,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:29:49,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91330226] [2021-10-11 00:29:49,425 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 97 [2021-10-11 00:29:49,730 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-10-11 00:29:49,742 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:29:49,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:29:49,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:29:49,744 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:29:49,744 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-10-11 00:29:49,744 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:49,744 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:29:49,744 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:29:49,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-10-11 00:29:49,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:29:49,745 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:29:49,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:49,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,232 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-10-11 00:29:50,500 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:29:50,500 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:29:50,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-10-11 00:29:50,516 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:50,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-10-11 00:29:50,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-10-11 00:29:50,625 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-10-11 00:29:50,626 INFO L210 LassoAnalysis]: Preferences: [2021-10-11 00:29:50,627 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-10-11 00:29:50,627 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-10-11 00:29:50,627 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-10-11 00:29:50,627 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-10-11 00:29:50,627 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:50,627 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-10-11 00:29:50,627 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-10-11 00:29:50,627 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-10-11 00:29:50,628 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-10-11 00:29:50,628 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2021-10-11 00:29:50,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:50,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-10-11 00:29:51,299 INFO L292 LassoAnalysis]: Preprocessing complete. [2021-10-11 00:29:51,303 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-10-11 00:29:51,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2021-10-11 00:29:51,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-10-11 00:29:51,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-10-11 00:29:51,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-10-11 00:29:51,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-10-11 00:29:51,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-10-11 00:29:51,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-10-11 00:29:51,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:51,331 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-10-11 00:29:51,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-10-11 00:29:51,359 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b210b7a2-48cb-42ba-b8ad-468af84c1bd8/bin/uautomizer-Z5i5R5N3CC/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-10-11 00:29:51,393 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-10-11 00:29:51,393 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-10-11 00:29:51,394 INFO L510 LassoAnalysis]: Proved termination. [2021-10-11 00:29:51,394 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2021-10-11 00:29:51,423 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-10-11 00:29:51,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:29:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:51,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-11 00:29:51,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:29:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:29:51,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 00:29:51,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 00:29:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:29:51,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-10-11 00:29:51,647 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27 Second operand 3 states. [2021-10-11 00:29:51,711 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 96 transitions. cyclomatic complexity: 27. Second operand 3 states. Result 117 states and 170 transitions. Complement of second has 4 states. [2021-10-11 00:29:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-10-11 00:29:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-10-11 00:29:51,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2021-10-11 00:29:51,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 19 letters. [2021-10-11 00:29:51,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:51,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 42 letters. Loop has 19 letters. [2021-10-11 00:29:51,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:51,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 96 transitions. Stem has 23 letters. Loop has 38 letters. [2021-10-11 00:29:51,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-10-11 00:29:51,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 170 transitions. [2021-10-11 00:29:51,725 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:51,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 0 states and 0 transitions. [2021-10-11 00:29:51,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:29:51,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:29:51,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:29:51,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:51,726 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:51,726 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:51,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:29:51,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:29:51,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:29:51,727 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2021-10-11 00:29:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:29:51,728 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-10-11 00:29:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-11 00:29:51,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-10-11 00:29:51,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:51,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-10-11 00:29:51,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-10-11 00:29:51,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-10-11 00:29:51,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-10-11 00:29:51,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-10-11 00:29:51,731 INFO L692 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:51,731 INFO L715 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:51,731 INFO L595 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-11 00:29:51,731 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2021-10-11 00:29:51,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-10-11 00:29:51,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-10-11 00:29:51,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-10-11 00:29:51,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 11.10 12:29:51 BoogieIcfgContainer [2021-10-11 00:29:51,741 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-10-11 00:29:51,744 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:29:51,744 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:29:51,744 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:29:51,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:29:47" (3/4) ... [2021-10-11 00:29:51,747 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-11 00:29:51,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:29:51,748 INFO L168 Benchmark]: Toolchain (without parser) took 5497.53 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 53.2 MB in the beginning and 71.6 MB in the end (delta: -18.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:51,748 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 69.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:51,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.26 ms. Allocated memory is still 94.4 MB. Free memory was 53.0 MB in the beginning and 66.6 MB in the end (delta: -13.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:51,750 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.38 ms. Allocated memory is still 94.4 MB. Free memory was 66.6 MB in the beginning and 64.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:51,750 INFO L168 Benchmark]: Boogie Preprocessor took 55.87 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 62.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:51,751 INFO L168 Benchmark]: RCFGBuilder took 907.04 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 31.4 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:51,751 INFO L168 Benchmark]: BuchiAutomizer took 4025.24 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 31.4 MB in the beginning and 71.6 MB in the end (delta: -40.2 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:29:51,752 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 136.3 MB. Free memory is still 71.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:29:51,755 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 94.4 MB. Free memory is still 69.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 422.26 ms. Allocated memory is still 94.4 MB. Free memory was 53.0 MB in the beginning and 66.6 MB in the end (delta: -13.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 75.38 ms. Allocated memory is still 94.4 MB. Free memory was 66.6 MB in the beginning and 64.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.87 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 62.9 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 907.04 ms. Allocated memory is still 94.4 MB. Free memory was 62.9 MB in the beginning and 31.4 MB in the end (delta: 31.4 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 4025.24 ms. Allocated memory was 94.4 MB in the beginning and 136.3 MB in the end (delta: 41.9 MB). Free memory was 31.4 MB in the beginning and 71.6 MB in the end (delta: -40.2 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * Witness Printer took 3.13 ms. Allocated memory is still 136.3 MB. Free memory is still 71.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 47 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 70 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 421 SDtfs, 173 SDslu, 664 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital122 mio100 ax100 hnf100 lsp31 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 89ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...