./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:39,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:39,971 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:40,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:40,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:40,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:40,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:40,013 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:40,015 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:40,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:40,016 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:40,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:40,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:40,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:40,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:40,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:40,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:40,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:40,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:40,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:40,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:40,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:40,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:40,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:40,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:40,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:40,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:40,045 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:40,045 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:40,046 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:40,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:40,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:40,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:40,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:40,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:40,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:40,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:40,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:40,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:40,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:40,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:40,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:22:40,079 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:40,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:40,079 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:40,079 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:40,080 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:40,080 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:40,081 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:40,081 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:40,081 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:40,081 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:40,082 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:40,082 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:40,082 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:40,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:40,082 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:40,082 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:40,083 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:40,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:40,085 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:40,085 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:40,085 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:40,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:40,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:40,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:40,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:40,086 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:40,087 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:40,087 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> a5deaf1c7eecf4d76182f6b98ab14efecb2cf3c3c2e7d8162af75087f90c331b [2021-12-15 17:22:40,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:40,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:40,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:40,298 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:40,298 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:40,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:40,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255613aa2/1c7e998f15934b3ba4203ef2528ee1f5/FLAG788066033 [2021-12-15 17:22:40,676 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:40,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:40,682 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255613aa2/1c7e998f15934b3ba4203ef2528ee1f5/FLAG788066033 [2021-12-15 17:22:41,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/255613aa2/1c7e998f15934b3ba4203ef2528ee1f5 [2021-12-15 17:22:41,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:41,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:41,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:41,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:41,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:41,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c2ab12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41, skipping insertion in model container [2021-12-15 17:22:41,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:41,134 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:41,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2021-12-15 17:22:41,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:41,375 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:41,430 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c[6844,6857] [2021-12-15 17:22:41,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:41,464 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:41,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41 WrapperNode [2021-12-15 17:22:41,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:41,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:41,466 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:41,466 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:41,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,528 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2021-12-15 17:22:41,528 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:41,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:41,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:41,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:41,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,552 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,574 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:41,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:41,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:41,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:41,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (1/1) ... [2021-12-15 17:22:41,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:41,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:41,614 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:22:41,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:22:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:41,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:41,829 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:41,830 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:42,295 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:42,301 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:42,313 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:42,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:42 BoogieIcfgContainer [2021-12-15 17:22:42,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:42,316 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:42,316 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:42,319 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:42,330 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:42,330 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:41" (1/3) ... [2021-12-15 17:22:42,331 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b812684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:42, skipping insertion in model container [2021-12-15 17:22:42,331 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:42,331 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:41" (2/3) ... [2021-12-15 17:22:42,332 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b812684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:42, skipping insertion in model container [2021-12-15 17:22:42,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:42,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:42" (3/3) ... [2021-12-15 17:22:42,333 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c [2021-12-15 17:22:42,390 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:42,390 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:42,390 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:42,390 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:42,390 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:42,391 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:42,391 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:42,391 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:42,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:42,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:22:42,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:42,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:42,476 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:42,477 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:42,477 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:42,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:42,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-15 17:22:42,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:42,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:42,489 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:42,490 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:42,496 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 15#L161true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 7#L161-1true init_#res#1 := init_~tmp~0#1; 10#L230true main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 74#L277true assume 0 == main_~i2~0#1;assume false; 71#L277-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#1 := 0; 18#L285-2true [2021-12-15 17:22:42,497 INFO L793 eck$LassoCheckResult]: Loop: 18#L285-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 77#L57true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 4#L61true assume !(node1_~m1~0#1 != ~nomsg~0); 48#L61-1true ~mode1~0 := 0; 63#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 55#L94true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 9#L97true assume !(node2_~m2~0#1 != ~nomsg~0); 20#L97-1true ~mode2~0 := 0; 41#L94-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 62#L128true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 49#L131true assume !(node3_~m3~0#1 != ~nomsg~0); 34#L131-1true ~mode3~0 := 0; 78#L128-2true assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 32#L238true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 12#L238-1true check_#res#1 := check_~tmp~1#1; 28#L250true main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 19#L309true assume !(0 == assert_~arg#1 % 256); 36#L304true assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 18#L285-2true [2021-12-15 17:22:42,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-12-15 17:22:42,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:42,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393379679] [2021-12-15 17:22:42,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:42,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:42,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:42,721 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:42,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393379679] [2021-12-15 17:22:42,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393379679] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:42,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:42,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:42,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130673335] [2021-12-15 17:22:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:42,734 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:42,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 1 times [2021-12-15 17:22:42,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:42,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773341395] [2021-12-15 17:22:42,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:42,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:42,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773341395] [2021-12-15 17:22:42,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773341395] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:42,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:42,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:42,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466673025] [2021-12-15 17:22:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:42,975 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:42,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:43,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:43,031 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:43,052 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2021-12-15 17:22:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:43,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2021-12-15 17:22:43,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2021-12-15 17:22:43,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-15 17:22:43,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-15 17:22:43,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2021-12-15 17:22:43,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:43,069 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-15 17:22:43,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2021-12-15 17:22:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 17:22:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2021-12-15 17:22:43,115 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-15 17:22:43,115 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-15 17:22:43,115 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:43,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2021-12-15 17:22:43,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:43,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:43,125 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:43,125 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:43,140 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 191#L161 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 168#L161-1 init_#res#1 := init_~tmp~0#1; 175#L230 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 181#L277 assume !(0 == main_~i2~0#1); 239#L277-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#1 := 0; 197#L285-2 [2021-12-15 17:22:43,153 INFO L793 eck$LassoCheckResult]: Loop: 197#L285-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 198#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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 170#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 172#L61-1 ~mode1~0 := 0; 201#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 231#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 178#L97 assume !(node2_~m2~0#1 != ~nomsg~0); 180#L97-1 ~mode2~0 := 0; 199#L94-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 220#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 228#L131 assume !(node3_~m3~0#1 != ~nomsg~0); 194#L131-1 ~mode3~0 := 0; 215#L128-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 211#L238 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 182#L238-1 check_#res#1 := check_~tmp~1#1; 183#L250 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 195#L309 assume !(0 == assert_~arg#1 % 256); 196#L304 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 197#L285-2 [2021-12-15 17:22:43,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-12-15 17:22:43,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265652736] [2021-12-15 17:22:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:43,244 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:43,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265652736] [2021-12-15 17:22:43,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265652736] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:43,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:43,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:43,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378387174] [2021-12-15 17:22:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:43,248 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 2 times [2021-12-15 17:22:43,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240780496] [2021-12-15 17:22:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:43,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240780496] [2021-12-15 17:22:43,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240780496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:43,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:43,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:43,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513129882] [2021-12-15 17:22:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:43,348 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:43,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:43,349 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:43,399 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2021-12-15 17:22:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-15 17:22:43,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2021-12-15 17:22:43,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2021-12-15 17:22:43,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-12-15 17:22:43,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-12-15 17:22:43,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2021-12-15 17:22:43,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:43,404 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2021-12-15 17:22:43,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2021-12-15 17:22:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2021-12-15 17:22:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2021-12-15 17:22:43,409 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-12-15 17:22:43,409 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-12-15 17:22:43,409 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:43,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2021-12-15 17:22:43,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:43,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:43,411 INFO L842 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-12-15 17:22:43,411 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:43,411 INFO L791 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 405#L161 assume 0 == ~r1~0; 406#L162 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 432#L163 assume ~id1~0 >= 0; 414#L164 assume 0 == ~st1~0; 403#L165 assume ~send1~0 == ~id1~0; 404#L166 assume 0 == ~mode1~0 % 256; 416#L167 assume ~id2~0 >= 0; 388#L168 assume 0 == ~st2~0; 389#L169 assume ~send2~0 == ~id2~0; 452#L170 assume 0 == ~mode2~0 % 256; 440#L171 assume ~id3~0 >= 0; 437#L172 assume 0 == ~st3~0; 438#L173 assume ~send3~0 == ~id3~0; 450#L174 assume 0 == ~mode3~0 % 256; 381#L175 assume ~id1~0 != ~id2~0; 382#L176 assume ~id1~0 != ~id3~0; 444#L177 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 390#L161-1 init_#res#1 := init_~tmp~0#1; 391#L230 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 395#L277 assume !(0 == main_~i2~0#1); 453#L277-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#1 := 0; 409#L285-2 [2021-12-15 17:22:43,412 INFO L793 eck$LassoCheckResult]: Loop: 409#L285-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 410#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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 383#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 385#L61-1 ~mode1~0 := 0; 415#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 445#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 392#L97 assume !(node2_~m2~0#1 != ~nomsg~0); 394#L97-1 ~mode2~0 := 0; 413#L94-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 434#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 442#L131 assume !(node3_~m3~0#1 != ~nomsg~0); 408#L131-1 ~mode3~0 := 0; 429#L128-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 426#L238 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 399#L238-1 check_#res#1 := check_~tmp~1#1; 400#L250 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 411#L309 assume !(0 == assert_~arg#1 % 256); 412#L304 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 409#L285-2 [2021-12-15 17:22:43,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-12-15 17:22:43,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336227044] [2021-12-15 17:22:43,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,448 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:43,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 3 times [2021-12-15 17:22:43,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854385763] [2021-12-15 17:22:43,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,450 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:43,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:43,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854385763] [2021-12-15 17:22:43,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854385763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:43,525 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:43,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:43,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644216290] [2021-12-15 17:22:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:43,526 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:43,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:43,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:43,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:43,527 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:43,568 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2021-12-15 17:22:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:43,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2021-12-15 17:22:43,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2021-12-15 17:22:43,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-15 17:22:43,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-15 17:22:43,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2021-12-15 17:22:43,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:43,580 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-15 17:22:43,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2021-12-15 17:22:43,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 17:22:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:22:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2021-12-15 17:22:43,590 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-15 17:22:43,590 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-15 17:22:43,590 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:43,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2021-12-15 17:22:43,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-15 17:22:43,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:43,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:43,593 INFO L842 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-12-15 17:22:43,593 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:43,593 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 566#L161 assume 0 == ~r1~0; 567#L162 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 593#L163 assume ~id1~0 >= 0; 575#L164 assume 0 == ~st1~0; 564#L165 assume ~send1~0 == ~id1~0; 565#L166 assume 0 == ~mode1~0 % 256; 579#L167 assume ~id2~0 >= 0; 549#L168 assume 0 == ~st2~0; 550#L169 assume ~send2~0 == ~id2~0; 613#L170 assume 0 == ~mode2~0 % 256; 601#L171 assume ~id3~0 >= 0; 598#L172 assume 0 == ~st3~0; 599#L173 assume ~send3~0 == ~id3~0; 611#L174 assume 0 == ~mode3~0 % 256; 542#L175 assume ~id1~0 != ~id2~0; 543#L176 assume ~id1~0 != ~id3~0; 605#L177 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 551#L161-1 init_#res#1 := init_~tmp~0#1; 552#L230 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 556#L277 assume !(0 == main_~i2~0#1); 614#L277-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#1 := 0; 572#L285-2 [2021-12-15 17:22:43,594 INFO L793 eck$LassoCheckResult]: Loop: 572#L285-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 573#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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 544#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 546#L61-1 ~mode1~0 := 0; 576#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 606#L94 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 553#L97 assume !(node2_~m2~0#1 != ~nomsg~0); 555#L97-1 ~mode2~0 := 0; 574#L94-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 595#L128 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 603#L131 assume !(node3_~m3~0#1 != ~nomsg~0); 569#L131-1 ~mode3~0 := 0; 590#L128-2 assume { :end_inline_node3 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 586#L238 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 587#L239 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 557#L238-1 check_#res#1 := check_~tmp~1#1; 558#L250 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 570#L309 assume !(0 == assert_~arg#1 % 256); 571#L304 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 572#L285-2 [2021-12-15 17:22:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-12-15 17:22:43,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519003454] [2021-12-15 17:22:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,636 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:43,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1995544096, now seen corresponding path program 1 times [2021-12-15 17:22:43,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120915367] [2021-12-15 17:22:43,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,656 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:43,671 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:43,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:43,672 INFO L85 PathProgramCache]: Analyzing trace with hash 964547683, now seen corresponding path program 1 times [2021-12-15 17:22:43,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:43,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568990747] [2021-12-15 17:22:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:43,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:22:43,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568990747] [2021-12-15 17:22:43,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568990747] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:43,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:43,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:43,709 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322184367] [2021-12-15 17:22:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:44,127 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:834) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:22:44,142 INFO L158 Benchmark]: Toolchain (without parser) took 3038.67ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 54.8MB in the beginning and 79.0MB in the end (delta: -24.2MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,142 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:44,143 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.28ms. Allocated memory is still 96.5MB. Free memory was 54.6MB in the beginning and 66.0MB in the end (delta: -11.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,143 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.91ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,143 INFO L158 Benchmark]: Boogie Preprocessor took 49.05ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 62.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,144 INFO L158 Benchmark]: RCFGBuilder took 729.84ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.6MB in the end (delta: 443.6kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,144 INFO L158 Benchmark]: BuchiAutomizer took 1813.17ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 61.2MB in the beginning and 79.0MB in the end (delta: -17.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. [2021-12-15 17:22:44,146 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.20ms. Allocated memory is still 96.5MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.28ms. Allocated memory is still 96.5MB. Free memory was 54.6MB in the beginning and 66.0MB in the end (delta: -11.4MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.91ms. Allocated memory is still 96.5MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.05ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 62.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 729.84ms. Allocated memory is still 96.5MB. Free memory was 62.1MB in the beginning and 61.6MB in the end (delta: 443.6kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 1813.17ms. Allocated memory was 96.5MB in the beginning and 130.0MB in the end (delta: 33.6MB). Free memory was 61.2MB in the beginning and 79.0MB in the end (delta: -17.8MB). Peak memory consumption was 40.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:22:44,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable