./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.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.ufo.UNBOUNDED.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 e3fe12f9ba7a27693660ab3b9c436489448c0880075d8a5a83d98427fc7a74d3 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:45,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:45,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:45,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:22:45,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:22:45,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:22:45,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:22:45,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:22:45,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:22:45,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:22:45,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:22:45,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:22:45,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:22:45,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:22:45,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:22:45,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:22:45,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:22:45,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:22:45,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:22:45,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:22:45,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:22:45,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:22:45,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:22:45,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:22:45,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:22:45,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:22:45,262 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:22:45,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:22:45,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:22:45,264 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:22:45,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:22:45,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:22:45,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:22:45,267 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:22:45,268 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:22:45,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:22:45,269 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:22:45,269 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:22:45,269 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:22:45,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:22:45,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:22:45,272 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:45,300 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:22:45,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:22:45,302 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:22:45,302 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:22:45,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:22:45,303 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:22:45,303 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:22:45,303 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:22:45,304 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:22:45,304 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:22:45,304 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:22:45,304 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:22:45,305 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:22:45,305 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:22:45,305 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:22:45,305 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:22:45,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:22:45,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:22:45,306 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:22:45,307 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:22:45,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:22:45,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:22:45,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:22:45,307 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:22:45,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:22:45,308 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:22:45,309 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:22:45,309 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 -> e3fe12f9ba7a27693660ab3b9c436489448c0880075d8a5a83d98427fc7a74d3 [2021-12-15 17:22:45,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:22:45,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:22:45,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:22:45,559 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:22:45,560 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:22:45,561 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.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:45,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad388259a/f4f3383c581f430db587b91d10481af1/FLAGc8fe9752a [2021-12-15 17:22:45,950 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:22:45,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:45,961 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad388259a/f4f3383c581f430db587b91d10481af1/FLAGc8fe9752a [2021-12-15 17:22:46,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad388259a/f4f3383c581f430db587b91d10481af1 [2021-12-15 17:22:46,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:22:46,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:22:46,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:46,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:22:46,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:22:46,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:46" (1/1) ... [2021-12-15 17:22:46,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365e7328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:46, skipping insertion in model container [2021-12-15 17:22:46,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:22:46" (1/1) ... [2021-12-15 17:22:46,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:22:46,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:22:46,567 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.ufo.UNBOUNDED.pals.c[6899,6912] [2021-12-15 17:22:46,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:46,579 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:22:46,618 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.ufo.UNBOUNDED.pals.c[6899,6912] [2021-12-15 17:22:46,618 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:22:46,637 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:22:46,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:46 WrapperNode [2021-12-15 17:22:46,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:22:46,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:46,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:22:46,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:22:46,645 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:46" (1/1) ... [2021-12-15 17:22:46,661 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:46" (1/1) ... [2021-12-15 17:22:46,692 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 241 [2021-12-15 17:22:46,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:22:46,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:22:46,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:22:46,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:22:46,700 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:46" (1/1) ... [2021-12-15 17:22:46,701 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:46" (1/1) ... [2021-12-15 17:22:46,710 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:46" (1/1) ... [2021-12-15 17:22:46,711 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:46" (1/1) ... [2021-12-15 17:22:46,714 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:46" (1/1) ... [2021-12-15 17:22:46,718 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:46" (1/1) ... [2021-12-15 17:22:46,719 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:46" (1/1) ... [2021-12-15 17:22:46,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:22:46,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:22:46,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:22:46,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:22:46,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:46" (1/1) ... [2021-12-15 17:22:46,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:22:46,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:22:46,757 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:46,758 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:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:22:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:22:46,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:22:46,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:22:46,874 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:22:46,888 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:22:47,181 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:22:47,186 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:22:47,186 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:22:47,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:47 BoogieIcfgContainer [2021-12-15 17:22:47,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:22:47,189 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:22:47,189 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:22:47,191 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:22:47,192 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:47,192 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:22:46" (1/3) ... [2021-12-15 17:22:47,193 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1131ec10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:47, skipping insertion in model container [2021-12-15 17:22:47,193 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:47,193 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:22:46" (2/3) ... [2021-12-15 17:22:47,194 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1131ec10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:22:47, skipping insertion in model container [2021-12-15 17:22:47,194 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:22:47,194 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:22:47" (3/3) ... [2021-12-15 17:22:47,195 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c [2021-12-15 17:22:47,223 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:22:47,223 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:22:47,223 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:22:47,224 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:22:47,224 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:22:47,224 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:22:47,224 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:22:47,224 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:22:47,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 79 states have internal predecessors, (131), 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:47,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2021-12-15 17:22:47,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:47,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:47,255 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:47,255 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:47,255 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:22:47,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 80 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 79 states have internal predecessors, (131), 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:47,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2021-12-15 17:22:47,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:47,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:47,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:47,260 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:47,264 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(47, 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; 41#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_~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; 13#L165true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 17#L165-1true init_#res#1 := init_~tmp~0#1; 8#L234true 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 45#L22true assume 0 == assume_abort_if_not_~cond#1;assume false; 34#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 15#L289-2true [2021-12-15 17:22:47,265 INFO L793 eck$LassoCheckResult]: Loop: 15#L289-2true assume !false;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; 73#L60true assume !(0 != ~mode1~0 % 256); 63#L81true assume !(0 != ~alive1~0 % 256); 54#L84true assume !(~send1~0 != ~id1~0); 31#L84-2true ~mode1~0 := 1; 25#L60-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; 38#L98true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 59#L101true assume !(node2_~m2~0#1 != ~nomsg~0); 24#L101-1true ~mode2~0 := 0; 16#L98-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; 70#L132true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 40#L135true assume !(node3_~m3~0#1 != ~nomsg~0); 14#L135-1true ~mode3~0 := 0; 20#L132-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; 78#L242true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 51#L242-1true check_#res#1 := check_~tmp~1#1; 61#L254true 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; 75#L312true assume !(0 == assert_~arg#1 % 256); 11#L307true assume { :end_inline_assert } true; 15#L289-2true [2021-12-15 17:22:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-12-15 17:22:47,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074727955] [2021-12-15 17:22:47,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,363 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:47,363 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074727955] [2021-12-15 17:22:47,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074727955] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,364 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:22:47,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690908068] [2021-12-15 17:22:47,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:47,369 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1813654554, now seen corresponding path program 1 times [2021-12-15 17:22:47,370 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969518917] [2021-12-15 17:22:47,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,526 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:47,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969518917] [2021-12-15 17:22:47,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969518917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,527 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:47,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566539484] [2021-12-15 17:22:47,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:47,528 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:47,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:47,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:22:47,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:22:47,548 INFO L87 Difference]: Start difference. First operand has 80 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 79 states have internal predecessors, (131), 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:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:47,556 INFO L93 Difference]: Finished difference Result 76 states and 124 transitions. [2021-12-15 17:22:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:22:47,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 124 transitions. [2021-12-15 17:22:47,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 123 transitions. [2021-12-15 17:22:47,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-15 17:22:47,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-15 17:22:47,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 123 transitions. [2021-12-15 17:22:47,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:47,572 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 123 transitions. [2021-12-15 17:22:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 123 transitions. [2021-12-15 17:22:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-15 17:22:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 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:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 123 transitions. [2021-12-15 17:22:47,591 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 123 transitions. [2021-12-15 17:22:47,591 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 123 transitions. [2021-12-15 17:22:47,591 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:22:47,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 123 transitions. [2021-12-15 17:22:47,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:47,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:47,593 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:22:47,594 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:47,594 INFO L791 eck$LassoCheckResult]: Stem: 236#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(47, 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; 223#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_~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; 187#L165 assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 169#L165-1 init_#res#1 := init_~tmp~0#1; 176#L234 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 177#L22 assume !(0 == assume_abort_if_not_~cond#1); 218#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 183#L289-2 [2021-12-15 17:22:47,594 INFO L793 eck$LassoCheckResult]: Loop: 183#L289-2 assume !false;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; 191#L60 assume !(0 != ~mode1~0 % 256); 239#L81 assume !(0 != ~alive1~0 % 256); 234#L84 assume !(~send1~0 != ~id1~0); 175#L84-2 ~mode1~0 := 1; 204#L60-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; 205#L98 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 220#L101 assume !(node2_~m2~0#1 != ~nomsg~0); 203#L101-1 ~mode2~0 := 0; 192#L98-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; 193#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 222#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 189#L135-1 ~mode3~0 := 0; 190#L132-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; 199#L242 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 185#L242-1 check_#res#1 := check_~tmp~1#1; 231#L254 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; 237#L312 assume !(0 == assert_~arg#1 % 256); 182#L307 assume { :end_inline_assert } true; 183#L289-2 [2021-12-15 17:22:47,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-12-15 17:22:47,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790899895] [2021-12-15 17:22:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,624 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:47,624 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790899895] [2021-12-15 17:22:47,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790899895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:47,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537515011] [2021-12-15 17:22:47,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:47,626 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:22:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1813654554, now seen corresponding path program 2 times [2021-12-15 17:22:47,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341751009] [2021-12-15 17:22:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,627 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,681 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:47,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341751009] [2021-12-15 17:22:47,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341751009] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:47,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275355761] [2021-12-15 17:22:47,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:47,682 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:47,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:47,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:47,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:47,683 INFO L87 Difference]: Start difference. First operand 75 states and 123 transitions. cyclomatic complexity: 49 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:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:47,723 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2021-12-15 17:22:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:47,724 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2021-12-15 17:22:47,725 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 106 transitions. [2021-12-15 17:22:47,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-15 17:22:47,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-15 17:22:47,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 106 transitions. [2021-12-15 17:22:47,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:47,727 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 106 transitions. [2021-12-15 17:22:47,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 106 transitions. [2021-12-15 17:22:47,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-15 17:22:47,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 74 states have internal predecessors, (106), 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:47,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2021-12-15 17:22:47,730 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 106 transitions. [2021-12-15 17:22:47,730 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 106 transitions. [2021-12-15 17:22:47,730 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:22:47,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 106 transitions. [2021-12-15 17:22:47,731 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:47,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:47,733 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:47,734 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:47,734 INFO L791 eck$LassoCheckResult]: Stem: 404#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(47, 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; 391#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_~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; 354#L165 assume 0 == ~r1~0 % 256; 355#L166 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 370#L167 assume ~id1~0 >= 0; 345#L168 assume 0 == ~st1~0; 346#L169 assume ~send1~0 == ~id1~0; 409#L170 assume 0 == ~mode1~0 % 256; 394#L171 assume ~id2~0 >= 0; 392#L172 assume 0 == ~st2~0; 393#L173 assume ~send2~0 == ~id2~0; 406#L174 assume 0 == ~mode2~0 % 256; 337#L175 assume ~id3~0 >= 0; 338#L176 assume 0 == ~st3~0; 395#L177 assume ~send3~0 == ~id3~0; 384#L178 assume 0 == ~mode3~0 % 256; 385#L179 assume ~id1~0 != ~id2~0; 335#L180 assume ~id1~0 != ~id3~0; 336#L181 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 361#L165-1 init_#res#1 := init_~tmp~0#1; 343#L234 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 344#L22 assume !(0 == assume_abort_if_not_~cond#1); 386#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 350#L289-2 [2021-12-15 17:22:47,734 INFO L793 eck$LassoCheckResult]: Loop: 350#L289-2 assume !false;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; 358#L60 assume !(0 != ~mode1~0 % 256); 407#L81 assume !(0 != ~alive1~0 % 256); 402#L84 assume !(~send1~0 != ~id1~0); 342#L84-2 ~mode1~0 := 1; 372#L60-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; 373#L98 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 388#L101 assume !(node2_~m2~0#1 != ~nomsg~0); 371#L101-1 ~mode2~0 := 0; 359#L98-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; 360#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 390#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 356#L135-1 ~mode3~0 := 0; 357#L132-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; 367#L242 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 352#L242-1 check_#res#1 := check_~tmp~1#1; 399#L254 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; 405#L312 assume !(0 == assert_~arg#1 % 256); 349#L307 assume { :end_inline_assert } true; 350#L289-2 [2021-12-15 17:22:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-12-15 17:22:47,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906397247] [2021-12-15 17:22:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,740 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,781 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1813654554, now seen corresponding path program 3 times [2021-12-15 17:22:47,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994260730] [2021-12-15 17:22:47,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,841 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:47,841 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994260730] [2021-12-15 17:22:47,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994260730] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,841 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:22:47,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999221893] [2021-12-15 17:22:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:47,842 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:22:47,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:22:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:22:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:22:47,843 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. cyclomatic complexity: 32 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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:47,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:22:47,867 INFO L93 Difference]: Finished difference Result 78 states and 108 transitions. [2021-12-15 17:22:47,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:22:47,868 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 108 transitions. [2021-12-15 17:22:47,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 104 transitions. [2021-12-15 17:22:47,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2021-12-15 17:22:47,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2021-12-15 17:22:47,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 104 transitions. [2021-12-15 17:22:47,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:22:47,870 INFO L681 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2021-12-15 17:22:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 104 transitions. [2021-12-15 17:22:47,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2021-12-15 17:22:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 74 states have internal predecessors, (104), 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:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2021-12-15 17:22:47,872 INFO L704 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2021-12-15 17:22:47,872 INFO L587 BuchiCegarLoop]: Abstraction has 75 states and 104 transitions. [2021-12-15 17:22:47,872 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:22:47,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 104 transitions. [2021-12-15 17:22:47,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 52 [2021-12-15 17:22:47,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:22:47,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:22:47,873 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:47,874 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, 1] [2021-12-15 17:22:47,874 INFO L791 eck$LassoCheckResult]: Stem: 569#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(47, 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; 556#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_~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; 519#L165 assume 0 == ~r1~0 % 256; 520#L166 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 535#L167 assume ~id1~0 >= 0; 510#L168 assume 0 == ~st1~0; 511#L169 assume ~send1~0 == ~id1~0; 574#L170 assume 0 == ~mode1~0 % 256; 559#L171 assume ~id2~0 >= 0; 557#L172 assume 0 == ~st2~0; 558#L173 assume ~send2~0 == ~id2~0; 571#L174 assume 0 == ~mode2~0 % 256; 502#L175 assume ~id3~0 >= 0; 503#L176 assume 0 == ~st3~0; 560#L177 assume ~send3~0 == ~id3~0; 549#L178 assume 0 == ~mode3~0 % 256; 550#L179 assume ~id1~0 != ~id2~0; 500#L180 assume ~id1~0 != ~id3~0; 501#L181 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 526#L165-1 init_#res#1 := init_~tmp~0#1; 508#L234 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 509#L22 assume !(0 == assume_abort_if_not_~cond#1); 551#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 515#L289-2 [2021-12-15 17:22:47,874 INFO L793 eck$LassoCheckResult]: Loop: 515#L289-2 assume !false;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; 523#L60 assume !(0 != ~mode1~0 % 256); 572#L81 assume !(0 != ~alive1~0 % 256); 567#L84 assume !(~send1~0 != ~id1~0); 507#L84-2 ~mode1~0 := 1; 537#L60-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; 538#L98 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 553#L101 assume !(node2_~m2~0#1 != ~nomsg~0); 536#L101-1 ~mode2~0 := 0; 524#L98-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; 525#L132 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 555#L135 assume !(node3_~m3~0#1 != ~nomsg~0); 521#L135-1 ~mode3~0 := 0; 522#L132-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; 532#L242 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 516#L243 assume ~r1~0 % 256 < 3;check_~tmp~1#1 := 1; 517#L242-1 check_#res#1 := check_~tmp~1#1; 564#L254 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#L312 assume !(0 == assert_~arg#1 % 256); 514#L307 assume { :end_inline_assert } true; 515#L289-2 [2021-12-15 17:22:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-12-15 17:22:47,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722940115] [2021-12-15 17:22:47,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,875 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,884 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,896 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,896 INFO L85 PathProgramCache]: Analyzing trace with hash -772043579, now seen corresponding path program 1 times [2021-12-15 17:22:47,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004619969] [2021-12-15 17:22:47,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,913 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:22:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:22:47,932 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:22:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:22:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash 796488354, now seen corresponding path program 1 times [2021-12-15 17:22:47,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:22:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105569151] [2021-12-15 17:22:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:22:47,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:22:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:22:47,970 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:47,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:22:47,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105569151] [2021-12-15 17:22:47,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105569151] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:22:47,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:22:47,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:22:47,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717110099] [2021-12-15 17:22:47,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:22:48,287 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:48,290 INFO L158 Benchmark]: Toolchain (without parser) took 1931.92ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 69.8MB in the beginning and 67.9MB in the end (delta: 1.9MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2021-12-15 17:22:48,291 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 98.6MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:48,291 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.27ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 69.5MB in the beginning and 98.5MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:22:48,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.28ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:22:48,292 INFO L158 Benchmark]: Boogie Preprocessor took 26.99ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 94.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:22:48,292 INFO L158 Benchmark]: RCFGBuilder took 466.17ms. Allocated memory is still 125.8MB. Free memory was 94.9MB in the beginning and 79.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:22:48,293 INFO L158 Benchmark]: BuchiAutomizer took 1100.36ms. Allocated memory is still 125.8MB. Free memory was 79.0MB in the beginning and 67.9MB in the end (delta: 11.1MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2021-12-15 17:22:48,294 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.16ms. Allocated memory is still 98.6MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.27ms. Allocated memory was 98.6MB in the beginning and 125.8MB in the end (delta: 27.3MB). Free memory was 69.5MB in the beginning and 98.5MB in the end (delta: -29.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.28ms. Allocated memory is still 125.8MB. Free memory was 98.5MB in the beginning and 96.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.99ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 94.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 466.17ms. Allocated memory is still 125.8MB. Free memory was 94.9MB in the beginning and 79.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1100.36ms. Allocated memory is still 125.8MB. Free memory was 79.0MB in the beginning and 67.9MB in the end (delta: 11.1MB). Peak memory consumption was 13.5MB. 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:48,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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