./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.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_opt-floodmax.3_overflow.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 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:20,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:20,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:20,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:20,348 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:20,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:20,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:20,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:20,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:20,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:20,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:20,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:20,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:20,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:20,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:20,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:20,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:20,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:20,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:20,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:20,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:20,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:20,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:20,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:20,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:20,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:20,418 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:20,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:20,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:20,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:20,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:20,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:20,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:20,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:20,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:20,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:20,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:20,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:20,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:20,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:20,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:20,429 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:23:20,449 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:20,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:20,450 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:20,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:20,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:20,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:20,473 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:20,473 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:20,473 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:20,473 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:20,474 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:20,474 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:20,474 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:20,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:20,475 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:20,475 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:20,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:20,476 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:20,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:20,476 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:20,476 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:20,476 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:20,477 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:20,477 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:20,478 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:20,478 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:20,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:20,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:20,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:20,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:20,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:20,480 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:20,481 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:20,481 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 -> 1f7b08d697525a6b6e4b6c32e081a52208b7f6ea0ef3da259b2ed32d3a516e9b [2021-12-15 17:23:20,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:20,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:20,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:20,810 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:20,811 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:20,812 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:20,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebe291fe/98dbfa8d62b8436a88a5715c3a6e3c41/FLAG51de6b5eb [2021-12-15 17:23:21,458 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:21,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:21,473 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebe291fe/98dbfa8d62b8436a88a5715c3a6e3c41/FLAG51de6b5eb [2021-12-15 17:23:21,842 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aebe291fe/98dbfa8d62b8436a88a5715c3a6e3c41 [2021-12-15 17:23:21,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:21,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:21,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:21,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:21,852 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:21,852 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:21" (1/1) ... [2021-12-15 17:23:21,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2c2ab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:21, skipping insertion in model container [2021-12-15 17:23:21,854 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:21" (1/1) ... [2021-12-15 17:23:21,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:21,902 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:22,358 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_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2021-12-15 17:23:22,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:22,374 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:22,513 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_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c[14467,14480] [2021-12-15 17:23:22,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:22,547 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:22,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22 WrapperNode [2021-12-15 17:23:22,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:22,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:22,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:22,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:22,569 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:23:22" (1/1) ... [2021-12-15 17:23:22,602 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:23:22" (1/1) ... [2021-12-15 17:23:22,657 INFO L137 Inliner]: procedures = 23, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 456 [2021-12-15 17:23:22,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:22,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:22,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:22,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:22,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,671 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:22,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:22,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:22,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:22,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (1/1) ... [2021-12-15 17:23:22,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:22,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:22,796 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:23:22,810 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:23:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:22,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:23,047 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:23,065 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:23,637 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:23,644 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:23,647 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:23,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:23 BoogieIcfgContainer [2021-12-15 17:23:23,651 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:23,652 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:23,652 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:23,655 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:23,656 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:23,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:21" (1/3) ... [2021-12-15 17:23:23,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b715956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:23, skipping insertion in model container [2021-12-15 17:23:23,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:23,657 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:22" (2/3) ... [2021-12-15 17:23:23,657 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b715956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:23, skipping insertion in model container [2021-12-15 17:23:23,657 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:23,658 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:23" (3/3) ... [2021-12-15 17:23:23,659 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:23,705 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:23,705 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:23,705 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:23,705 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:23,706 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:23,706 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:23,706 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:23,706 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:23,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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:23:23,759 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:23,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:23,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:23,776 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] [2021-12-15 17:23:23,777 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:23:23,777 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:23,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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:23:23,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2021-12-15 17:23:23,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:23,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:23,791 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] [2021-12-15 17:23:23,791 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:23:23,798 INFO L791 eck$LassoCheckResult]: Stem: 124#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 31#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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 68#L259true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 20#L262-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 34#L272true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 136#L275-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 120#L285true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 62#L288-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 23#L298true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 93#L301-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 41#L311true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 52#L314-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 10#L324true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 108#L327-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 74#L337true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 142#L337-1true init_#res#1 := init_~tmp___5~0#1; 105#L458true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 33#L22true assume !(0 == assume_abort_if_not_~cond#1); 94#L21true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 76#L569-2true [2021-12-15 17:23:23,804 INFO L793 eck$LassoCheckResult]: Loop: 76#L569-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 18#L83true assume !(0 != ~mode1~0 % 256); 15#L111true assume !(~r1~0 % 256 < 2); 113#L111-1true ~mode1~0 := 1; 116#L83-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 128#L134true assume !(0 != ~mode2~0 % 256); 25#L162true assume !(~r2~0 % 256 < 2); 40#L162-1true ~mode2~0 := 1; 60#L134-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 95#L185true assume !(0 != ~mode3~0 % 256); 133#L213true assume !(~r3~0 % 256 < 2); 123#L213-1true ~mode3~0 := 1; 39#L185-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 139#L466true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 71#L466-1true check_#res#1 := check_~tmp~1#1; 77#L514true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 119#L598true assume !(0 == assert_~arg#1 % 256); 75#L593true assume { :end_inline_assert } true; 76#L569-2true [2021-12-15 17:23:23,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2021-12-15 17:23:23,818 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:23,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903680915] [2021-12-15 17:23:23,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:23,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:24,083 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:23:24,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:24,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903680915] [2021-12-15 17:23:24,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903680915] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:24,087 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:24,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:24,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292725941] [2021-12-15 17:23:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:24,095 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:24,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,098 INFO L85 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2021-12-15 17:23:24,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542129890] [2021-12-15 17:23:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,099 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:24,248 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:23:24,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542129890] [2021-12-15 17:23:24,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542129890] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:24,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:24,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:24,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137457740] [2021-12-15 17:23:24,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:24,252 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:24,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:24,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:24,286 INFO L87 Difference]: Start difference. First operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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 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:23:24,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:24,368 INFO L93 Difference]: Finished difference Result 142 states and 243 transitions. [2021-12-15 17:23:24,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:24,373 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 243 transitions. [2021-12-15 17:23:24,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:24,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 137 states and 231 transitions. [2021-12-15 17:23:24,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2021-12-15 17:23:24,389 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2021-12-15 17:23:24,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2021-12-15 17:23:24,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:24,392 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2021-12-15 17:23:24,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2021-12-15 17:23:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-15 17:23:24,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 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:23:24,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2021-12-15 17:23:24,421 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2021-12-15 17:23:24,421 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2021-12-15 17:23:24,421 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:24,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2021-12-15 17:23:24,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:24,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:24,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:24,423 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] [2021-12-15 17:23:24,423 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, 1, 1, 1, 1, 1] [2021-12-15 17:23:24,424 INFO L791 eck$LassoCheckResult]: Stem: 432#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 356#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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 357#L259 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 336#L262-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 337#L272 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 303#L275-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 431#L285 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 339#L288-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 341#L298 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 342#L301-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 372#L311 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 364#L314-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 315#L324 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 317#L327-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 412#L337 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 314#L337-1 init_#res#1 := init_~tmp___5~0#1; 428#L458 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 360#L22 assume !(0 == assume_abort_if_not_~cond#1); 361#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 414#L569-2 [2021-12-15 17:23:24,424 INFO L793 eck$LassoCheckResult]: Loop: 414#L569-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 332#L83 assume !(0 != ~mode1~0 % 256); 327#L111 assume !(~r1~0 % 256 < 2); 329#L111-1 ~mode1~0 := 1; 331#L83-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 429#L134 assume !(0 != ~mode2~0 % 256); 346#L162 assume !(~r2~0 % 256 < 2); 324#L162-1 ~mode2~0 := 1; 371#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 397#L185 assume !(0 != ~mode3~0 % 256); 422#L213 assume !(~r3~0 % 256 < 2); 394#L213-1 ~mode3~0 := 1; 369#L185-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 370#L466 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 438#L467 assume ~st1~0 + ~nl1~0 <= 1; 433#L468 assume ~st2~0 + ~nl2~0 <= 1; 310#L469 assume ~st3~0 + ~nl3~0 <= 1; 311#L470 assume ~r1~0 % 256 >= 2; 384#L474 assume ~r1~0 % 256 < 2; 386#L479 assume ~r1~0 % 256 >= 2; 403#L484 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 401#L466-1 check_#res#1 := check_~tmp~1#1; 409#L514 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 415#L598 assume !(0 == assert_~arg#1 % 256); 413#L593 assume { :end_inline_assert } true; 414#L569-2 [2021-12-15 17:23:24,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2021-12-15 17:23:24,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030285862] [2021-12-15 17:23:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:24,485 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:23:24,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:24,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030285862] [2021-12-15 17:23:24,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030285862] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:24,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:24,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:24,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465558934] [2021-12-15 17:23:24,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:24,487 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:24,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2021-12-15 17:23:24,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885116845] [2021-12-15 17:23:24,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,488 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:24,513 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:23:24,513 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:24,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885116845] [2021-12-15 17:23:24,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885116845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:24,514 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:24,514 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:24,514 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070770970] [2021-12-15 17:23:24,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:24,515 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:24,515 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:24,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:24,516 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 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:23:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:24,568 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2021-12-15 17:23:24,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:24,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2021-12-15 17:23:24,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:24,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2021-12-15 17:23:24,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2021-12-15 17:23:24,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2021-12-15 17:23:24,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2021-12-15 17:23:24,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:24,573 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2021-12-15 17:23:24,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2021-12-15 17:23:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-12-15 17:23:24,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2021-12-15 17:23:24,580 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2021-12-15 17:23:24,580 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2021-12-15 17:23:24,580 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:24,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2021-12-15 17:23:24,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2021-12-15 17:23:24,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:24,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:24,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:24,582 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, 1, 1, 1, 1, 1] [2021-12-15 17:23:24,583 INFO L791 eck$LassoCheckResult]: Stem: 722#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 647#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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 648#L259 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 625#L262-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 626#L272 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 593#L275-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 721#L285 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 628#L288-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 630#L298 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 631#L301-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 662#L311 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 654#L314-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 607#L324 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 609#L327-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 701#L337 assume ~id1~0 != ~id2~0; 665#L338 assume ~id1~0 != ~id3~0; 666#L339 assume ~id2~0 != ~id3~0; 713#L340 assume ~id1~0 >= 0; 708#L341 assume ~id2~0 >= 0; 637#L342 assume ~id3~0 >= 0; 638#L343 assume 0 == ~r1~0 % 256; 633#L344 assume 0 == ~r2~0 % 256; 634#L345 assume 0 == ~r3~0 % 256; 655#L346 assume 0 != init_~r122~0#1 % 256; 656#L347 assume 0 != init_~r132~0#1 % 256; 720#L348 assume 0 != init_~r212~0#1 % 256; 706#L349 assume 0 != init_~r232~0#1 % 256; 707#L350 assume 0 != init_~r312~0#1 % 256; 694#L351 assume 0 != init_~r322~0#1 % 256; 695#L352 assume ~max1~0 == ~id1~0; 710#L353 assume ~max2~0 == ~id2~0; 677#L354 assume ~max3~0 == ~id3~0; 641#L355 assume 0 == ~st1~0; 642#L356 assume 0 == ~st2~0; 676#L357 assume 0 == ~st3~0; 602#L358 assume 0 == ~nl1~0; 603#L359 assume 0 == ~nl2~0; 610#L360 assume 0 == ~nl3~0; 611#L361 assume 0 == ~mode1~0 % 256; 699#L362 assume 0 == ~mode2~0 % 256; 726#L363 assume 0 == ~mode3~0 % 256; 727#L364 assume 0 != ~newmax1~0 % 256; 671#L365 assume 0 != ~newmax2~0 % 256; 672#L366 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 718#L337-1 init_#res#1 := init_~tmp___5~0#1; 716#L458 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 649#L22 assume !(0 == assume_abort_if_not_~cond#1); 650#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 703#L569-2 [2021-12-15 17:23:24,583 INFO L793 eck$LassoCheckResult]: Loop: 703#L569-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 621#L83 assume !(0 != ~mode1~0 % 256); 616#L111 assume !(~r1~0 % 256 < 2); 618#L111-1 ~mode1~0 := 1; 620#L83-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 719#L134 assume !(0 != ~mode2~0 % 256); 635#L162 assume !(~r2~0 % 256 < 2); 613#L162-1 ~mode2~0 := 1; 660#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 686#L185 assume !(0 != ~mode3~0 % 256); 711#L213 assume !(~r3~0 % 256 < 2); 683#L213-1 ~mode3~0 := 1; 658#L185-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 659#L466 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 728#L467 assume ~st1~0 + ~nl1~0 <= 1; 723#L468 assume ~st2~0 + ~nl2~0 <= 1; 600#L469 assume ~st3~0 + ~nl3~0 <= 1; 601#L470 assume ~r1~0 % 256 >= 2; 673#L474 assume ~r1~0 % 256 < 2; 675#L479 assume ~r1~0 % 256 >= 2; 692#L484 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 691#L466-1 check_#res#1 := check_~tmp~1#1; 698#L514 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 704#L598 assume !(0 == assert_~arg#1 % 256); 702#L593 assume { :end_inline_assert } true; 703#L569-2 [2021-12-15 17:23:24,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2021-12-15 17:23:24,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121085205] [2021-12-15 17:23:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,714 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:24,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2021-12-15 17:23:24,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637953726] [2021-12-15 17:23:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:24,741 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:23:24,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:24,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637953726] [2021-12-15 17:23:24,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637953726] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:24,742 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:24,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:24,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478889919] [2021-12-15 17:23:24,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:24,743 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:24,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:24,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:24,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:24,744 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:23:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:24,819 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2021-12-15 17:23:24,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:24,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 288 transitions. [2021-12-15 17:23:24,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2021-12-15 17:23:24,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 288 transitions. [2021-12-15 17:23:24,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2021-12-15 17:23:24,824 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2021-12-15 17:23:24,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 288 transitions. [2021-12-15 17:23:24,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:24,825 INFO L681 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2021-12-15 17:23:24,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 288 transitions. [2021-12-15 17:23:24,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2021-12-15 17:23:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 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:23:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2021-12-15 17:23:24,836 INFO L704 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2021-12-15 17:23:24,836 INFO L587 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2021-12-15 17:23:24,836 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:24,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. [2021-12-15 17:23:24,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2021-12-15 17:23:24,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:24,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:24,839 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:24,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:24,856 INFO L791 eck$LassoCheckResult]: Stem: 1068#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(50, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 982#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~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 983#L259 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 962#L262-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 963#L272 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 931#L275-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1067#L285 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 965#L288-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 967#L298 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 968#L301-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1000#L311 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 990#L314-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 942#L324 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 944#L327-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1041#L337 assume ~id1~0 != ~id2~0; 1003#L338 assume ~id1~0 != ~id3~0; 1004#L339 assume ~id2~0 != ~id3~0; 1059#L340 assume ~id1~0 >= 0; 1051#L341 assume ~id2~0 >= 0; 974#L342 assume ~id3~0 >= 0; 975#L343 assume 0 == ~r1~0 % 256; 970#L344 assume 0 == ~r2~0 % 256; 971#L345 assume 0 == ~r3~0 % 256; 993#L346 assume 0 != init_~r122~0#1 % 256; 994#L347 assume 0 != init_~r132~0#1 % 256; 1065#L348 assume 0 != init_~r212~0#1 % 256; 1049#L349 assume 0 != init_~r232~0#1 % 256; 1050#L350 assume 0 != init_~r312~0#1 % 256; 1034#L351 assume 0 != init_~r322~0#1 % 256; 1035#L352 assume ~max1~0 == ~id1~0; 1053#L353 assume ~max2~0 == ~id2~0; 1017#L354 assume ~max3~0 == ~id3~0; 976#L355 assume 0 == ~st1~0; 977#L356 assume 0 == ~st2~0; 1016#L357 assume 0 == ~st3~0; 940#L358 assume 0 == ~nl1~0; 941#L359 assume 0 == ~nl2~0; 948#L360 assume 0 == ~nl3~0; 949#L361 assume 0 == ~mode1~0 % 256; 1039#L362 assume 0 == ~mode2~0 % 256; 1077#L363 assume 0 == ~mode3~0 % 256; 1078#L364 assume 0 != ~newmax1~0 % 256; 1011#L365 assume 0 != ~newmax2~0 % 256; 1012#L366 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1064#L337-1 init_#res#1 := init_~tmp___5~0#1; 1062#L458 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#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; 986#L22 assume !(0 == assume_abort_if_not_~cond#1); 987#L21 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1054#L569-2 [2021-12-15 17:23:24,856 INFO L793 eck$LassoCheckResult]: Loop: 1054#L569-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1081#L83 assume !(0 != ~mode1~0 % 256); 1080#L111 assume ~r1~0 % 256 < 2; 1007#L112 assume !(0 != ~ep12~0 % 256); 985#L112-1 assume !(0 != ~ep13~0 % 256); 992#L111-1 ~mode1~0 := 1; 1115#L83-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1114#L134 assume !(0 != ~mode2~0 % 256); 1111#L162 assume !(~r2~0 % 256 < 2); 1101#L162-1 ~mode2~0 := 1; 1099#L134-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1098#L185 assume !(0 != ~mode3~0 % 256); 1095#L213 assume !(~r3~0 % 256 < 2); 1093#L213-1 ~mode3~0 := 1; 1092#L185-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1091#L466 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1090#L467 assume ~st1~0 + ~nl1~0 <= 1; 1089#L468 assume ~st2~0 + ~nl2~0 <= 1; 1088#L469 assume ~st3~0 + ~nl3~0 <= 1; 1087#L470 assume !(~r1~0 % 256 >= 2); 1072#L473 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1073#L474 assume ~r1~0 % 256 < 2; 1086#L479 assume !(~r1~0 % 256 >= 2); 1057#L483 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1058#L484 assume ~r1~0 % 256 < 2;check_~tmp~1#1 := 1; 1085#L466-1 check_#res#1 := check_~tmp~1#1; 1084#L514 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1083#L598 assume !(0 == assert_~arg#1 % 256); 1082#L593 assume { :end_inline_assert } true; 1054#L569-2 [2021-12-15 17:23:24,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,857 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2021-12-15 17:23:24,857 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801226613] [2021-12-15 17:23:24,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,953 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:24,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1983288549, now seen corresponding path program 1 times [2021-12-15 17:23:24,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074734966] [2021-12-15 17:23:24,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:24,993 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:24,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:24,997 INFO L85 PathProgramCache]: Analyzing trace with hash 2100705208, now seen corresponding path program 1 times [2021-12-15 17:23:24,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:24,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464067863] [2021-12-15 17:23:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:24,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:25,056 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:23:25,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:25,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464067863] [2021-12-15 17:23:25,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464067863] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:25,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:25,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:25,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604275733] [2021-12-15 17:23:25,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:26,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:23:26,132 INFO L158 Benchmark]: Toolchain (without parser) took 4282.73ms. Allocated memory was 83.9MB in the beginning and 144.7MB in the end (delta: 60.8MB). Free memory was 53.2MB in the beginning and 103.4MB in the end (delta: -50.3MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,132 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 83.9MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:26,132 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.00ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 54.1MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.56ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 51.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,133 INFO L158 Benchmark]: Boogie Preprocessor took 76.81ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,134 INFO L158 Benchmark]: RCFGBuilder took 914.91ms. Allocated memory was 83.9MB in the beginning and 119.5MB in the end (delta: 35.7MB). Free memory was 48.8MB in the beginning and 83.4MB in the end (delta: -34.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,135 INFO L158 Benchmark]: BuchiAutomizer took 2478.50ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 83.4MB in the beginning and 103.4MB in the end (delta: -20.0MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2021-12-15 17:23:26,138 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.23ms. Allocated memory is still 83.9MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.00ms. Allocated memory is still 83.9MB. Free memory was 53.0MB in the beginning and 54.1MB in the end (delta: -1.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.56ms. Allocated memory is still 83.9MB. Free memory was 54.1MB in the beginning and 51.2MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.81ms. Allocated memory is still 83.9MB. Free memory was 51.2MB in the beginning and 49.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 914.91ms. Allocated memory was 83.9MB in the beginning and 119.5MB in the end (delta: 35.7MB). Free memory was 48.8MB in the beginning and 83.4MB in the end (delta: -34.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2478.50ms. Allocated memory was 119.5MB in the beginning and 144.7MB in the end (delta: 25.2MB). Free memory was 83.4MB in the beginning and 103.4MB in the end (delta: -20.0MB). Peak memory consumption was 45.3MB. 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:23:26,215 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