./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.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 52f795f47ad9dd0b1b0499f649b5f623fed211e53433ed6d87534c63dbfae98b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:22:59,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:22:59,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:22:59,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:00,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:00,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:00,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:00,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:00,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:00,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:00,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:00,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:00,012 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:00,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:00,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:00,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:00,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:00,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:00,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:00,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:00,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:00,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:00,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:00,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:00,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:00,024 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:00,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:00,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:00,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:00,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:00,026 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:00,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:00,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:00,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:00,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:00,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:00,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:00,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:00,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:00,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:00,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:00,035 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:00,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:00,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:00,055 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:00,055 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:00,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:00,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:00,056 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:00,057 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:00,057 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:00,057 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:00,057 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:00,057 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:00,057 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:00,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:00,058 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:00,059 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:00,059 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:00,059 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:00,059 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:00,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:00,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:00,059 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:00,060 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:00,060 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 -> 52f795f47ad9dd0b1b0499f649b5f623fed211e53433ed6d87534c63dbfae98b [2021-12-15 17:23:00,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:00,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:00,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:00,277 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:00,279 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:00,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:00,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d18c6b1f/509185c9491c40a2a305de691d29b546/FLAG5e92ecfa0 [2021-12-15 17:23:00,721 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:00,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:00,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d18c6b1f/509185c9491c40a2a305de691d29b546/FLAG5e92ecfa0 [2021-12-15 17:23:01,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d18c6b1f/509185c9491c40a2a305de691d29b546 [2021-12-15 17:23:01,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:01,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:01,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:01,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:01,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:01,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:01" (1/1) ... [2021-12-15 17:23:01,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e570b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:01, skipping insertion in model container [2021-12-15 17:23:01,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:01" (1/1) ... [2021-12-15 17:23:01,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:01,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:01,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c[8305,8318] [2021-12-15 17:23:01,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:01,368 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:01,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.UNBOUNDED.pals.c[8305,8318] [2021-12-15 17:23:01,402 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:01,419 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:01,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:01 WrapperNode [2021-12-15 17:23:01,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:01,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:01,425 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:01,425 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:01,430 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:01" (1/1) ... [2021-12-15 17:23:01,435 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:01" (1/1) ... [2021-12-15 17:23:01,467 INFO L137 Inliner]: procedures = 24, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 260 [2021-12-15 17:23:01,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:01,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:01,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:01,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:01,474 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:01" (1/1) ... [2021-12-15 17:23:01,475 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:01" (1/1) ... [2021-12-15 17:23:01,477 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:01" (1/1) ... [2021-12-15 17:23:01,483 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:01" (1/1) ... [2021-12-15 17:23:01,487 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:01" (1/1) ... [2021-12-15 17:23:01,493 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:01" (1/1) ... [2021-12-15 17:23:01,494 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:01" (1/1) ... [2021-12-15 17:23:01,498 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:01,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:01,499 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:01,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:01,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:01" (1/1) ... [2021-12-15 17:23:01,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:01,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:01,526 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:01,535 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:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:01,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:01,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:01,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:01,607 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:01,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:01,818 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:01,823 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:01,823 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:01,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:01 BoogieIcfgContainer [2021-12-15 17:23:01,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:01,825 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:01,825 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:01,827 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:01,828 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:01" (1/3) ... [2021-12-15 17:23:01,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10bd032a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:01, skipping insertion in model container [2021-12-15 17:23:01,829 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:01" (2/3) ... [2021-12-15 17:23:01,829 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10bd032a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:01, skipping insertion in model container [2021-12-15 17:23:01,829 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:01,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:01" (3/3) ... [2021-12-15 17:23:01,830 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:01,860 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:01,861 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:01,861 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:01,861 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:01,861 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:01,861 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:01,861 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:01,861 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:01,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 77 states have internal predecessors, (130), 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:01,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-12-15 17:23:01,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,896 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:01,896 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] [2021-12-15 17:23:01,896 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:01,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 77 states have internal predecessors, (130), 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:01,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-12-15 17:23:01,900 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:01,900 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:01,901 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:01,901 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] [2021-12-15 17:23:01,906 INFO L791 eck$LassoCheckResult]: Stem: 57#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 16#L167true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 52#L167-1true init_#res#1 := init_~tmp~0#1; 76#L260true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 46#L22true assume !(0 == assume_abort_if_not_~cond#1); 31#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 12#L326-2true [2021-12-15 17:23:01,907 INFO L793 eck$LassoCheckResult]: Loop: 12#L326-2true assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 17#L64true assume !(0 != ~mode1~0 % 256); 62#L81true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 24#L81-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 80#L64-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 38#L93true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 47#L96true assume !(node2_~m2~0#1 != ~nomsg~0); 6#L96-1true ~mode2~0 := 0; 33#L93-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 23#L118true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 25#L121true assume !(node3_~m3~0#1 != ~nomsg~0); 40#L121-1true ~mode3~0 := 0; 64#L118-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 36#L143true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 18#L146true assume !(node4_~m4~0#1 != ~nomsg~0); 19#L146-1true ~mode4~0 := 0; 11#L143-2true assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 21#L268true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 5#L268-1true check_#res#1 := check_~tmp~1#1; 27#L288true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 39#L352true assume !(0 == assert_~arg#1 % 256); 51#L347true assume { :end_inline_assert } true; 12#L326-2true [2021-12-15 17:23:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2021-12-15 17:23:01,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:01,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462980162] [2021-12-15 17:23:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:01,917 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,088 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:02,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462980162] [2021-12-15 17:23:02,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462980162] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:02,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630144711] [2021-12-15 17:23:02,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:02,094 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,095 INFO L85 PathProgramCache]: Analyzing trace with hash -395474062, now seen corresponding path program 1 times [2021-12-15 17:23:02,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986449850] [2021-12-15 17:23:02,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,095 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,210 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:02,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986449850] [2021-12-15 17:23:02,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986449850] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:02,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986160654] [2021-12-15 17:23:02,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:02,214 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:02,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:02,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:02,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:02,243 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 77 states have internal predecessors, (130), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:23:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:02,319 INFO L93 Difference]: Finished difference Result 77 states and 125 transitions. [2021-12-15 17:23:02,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:02,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 125 transitions. [2021-12-15 17:23:02,332 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:23:02,334 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 73 states and 99 transitions. [2021-12-15 17:23:02,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-15 17:23:02,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-15 17:23:02,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 99 transitions. [2021-12-15 17:23:02,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:02,336 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-15 17:23:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 99 transitions. [2021-12-15 17:23:02,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 17:23:02,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.356164383561644) internal successors, (99), 72 states have internal predecessors, (99), 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:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2021-12-15 17:23:02,355 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-15 17:23:02,355 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 99 transitions. [2021-12-15 17:23:02,355 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:02,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 99 transitions. [2021-12-15 17:23:02,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:23:02,356 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:02,356 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:02,357 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] [2021-12-15 17:23:02,357 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] [2021-12-15 17:23:02,357 INFO L791 eck$LassoCheckResult]: Stem: 240#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 203#L167 assume 0 == ~r1~0 % 256; 181#L168 assume ~id1~0 >= 0; 182#L169 assume 0 == ~st1~0; 243#L170 assume ~send1~0 == ~id1~0; 233#L171 assume 0 == ~mode1~0 % 256; 231#L172 assume ~id2~0 >= 0; 232#L173 assume 0 == ~st2~0; 242#L174 assume ~send2~0 == ~id2~0; 179#L175 assume 0 == ~mode2~0 % 256; 180#L176 assume ~id3~0 >= 0; 237#L177 assume 0 == ~st3~0; 217#L178 assume ~send3~0 == ~id3~0; 218#L179 assume 0 == ~mode3~0 % 256; 175#L180 assume ~id4~0 >= 0; 176#L181 assume 0 == ~st4~0; 213#L182 assume ~send4~0 == ~id4~0; 216#L183 assume 0 == ~mode4~0 % 256; 192#L184 assume ~id1~0 != ~id2~0; 193#L185 assume ~id1~0 != ~id3~0; 221#L186 assume ~id1~0 != ~id4~0; 241#L187 assume ~id2~0 != ~id3~0; 194#L188 assume ~id2~0 != ~id4~0; 195#L189 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 204#L167-1 init_#res#1 := init_~tmp~0#1; 238#L260 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 234#L22 assume !(0 == assume_abort_if_not_~cond#1); 219#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 190#L326-2 [2021-12-15 17:23:02,358 INFO L793 eck$LassoCheckResult]: Loop: 190#L326-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 191#L64 assume !(0 != ~mode1~0 % 256); 199#L81 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 210#L81-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 206#L64-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 224#L93 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 225#L96 assume !(node2_~m2~0#1 != ~nomsg~0); 177#L96-1 ~mode2~0 := 0; 178#L93-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 207#L118 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 208#L121 assume !(node3_~m3~0#1 != ~nomsg~0); 197#L121-1 ~mode3~0 := 0; 215#L118-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 222#L143 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 200#L146 assume !(node4_~m4~0#1 != ~nomsg~0); 201#L146-1 ~mode4~0 := 0; 188#L143-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 189#L268 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 173#L268-1 check_#res#1 := check_~tmp~1#1; 174#L288 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 212#L352 assume !(0 == assert_~arg#1 % 256); 227#L347 assume { :end_inline_assert } true; 190#L326-2 [2021-12-15 17:23:02,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2021-12-15 17:23:02,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773248303] [2021-12-15 17:23:02,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:02,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,443 INFO L85 PathProgramCache]: Analyzing trace with hash -395474062, now seen corresponding path program 2 times [2021-12-15 17:23:02,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942601962] [2021-12-15 17:23:02,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,537 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:02,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942601962] [2021-12-15 17:23:02,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942601962] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:02,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018172371] [2021-12-15 17:23:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:02,539 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:02,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:02,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:02,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:02,540 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. cyclomatic complexity: 27 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:02,577 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2021-12-15 17:23:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:02,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2021-12-15 17:23:02,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:23:02,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 96 transitions. [2021-12-15 17:23:02,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-15 17:23:02,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-15 17:23:02,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 96 transitions. [2021-12-15 17:23:02,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:02,580 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 96 transitions. [2021-12-15 17:23:02,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 96 transitions. [2021-12-15 17:23:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-15 17:23:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 72 states have internal predecessors, (96), 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:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2021-12-15 17:23:02,583 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 96 transitions. [2021-12-15 17:23:02,583 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 96 transitions. [2021-12-15 17:23:02,584 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:02,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 96 transitions. [2021-12-15 17:23:02,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-15 17:23:02,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:02,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:02,585 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] [2021-12-15 17:23:02,585 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] [2021-12-15 17:23:02,585 INFO L791 eck$LassoCheckResult]: Stem: 401#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 359#L167 assume 0 == ~r1~0 % 256; 342#L168 assume ~id1~0 >= 0; 343#L169 assume 0 == ~st1~0; 404#L170 assume ~send1~0 == ~id1~0; 394#L171 assume 0 == ~mode1~0 % 256; 392#L172 assume ~id2~0 >= 0; 393#L173 assume 0 == ~st2~0; 403#L174 assume ~send2~0 == ~id2~0; 340#L175 assume 0 == ~mode2~0 % 256; 341#L176 assume ~id3~0 >= 0; 398#L177 assume 0 == ~st3~0; 378#L178 assume ~send3~0 == ~id3~0; 379#L179 assume 0 == ~mode3~0 % 256; 334#L180 assume ~id4~0 >= 0; 335#L181 assume 0 == ~st4~0; 373#L182 assume ~send4~0 == ~id4~0; 375#L183 assume 0 == ~mode4~0 % 256; 353#L184 assume ~id1~0 != ~id2~0; 354#L185 assume ~id1~0 != ~id3~0; 381#L186 assume ~id1~0 != ~id4~0; 402#L187 assume ~id2~0 != ~id3~0; 355#L188 assume ~id2~0 != ~id4~0; 356#L189 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 360#L167-1 init_#res#1 := init_~tmp~0#1; 399#L260 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 395#L22 assume !(0 == assume_abort_if_not_~cond#1); 380#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 351#L326-2 [2021-12-15 17:23:02,585 INFO L793 eck$LassoCheckResult]: Loop: 351#L326-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 352#L64 assume !(0 != ~mode1~0 % 256); 362#L81 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 371#L81-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 367#L64-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 385#L93 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 386#L96 assume !(node2_~m2~0#1 != ~nomsg~0); 338#L96-1 ~mode2~0 := 0; 339#L93-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 368#L118 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 369#L121 assume !(node3_~m3~0#1 != ~nomsg~0); 358#L121-1 ~mode3~0 := 0; 377#L118-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 383#L143 assume !(0 != ~mode4~0 % 256); 384#L156 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 389#L156-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 349#L143-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 350#L268 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 366#L269 assume ~r1~0 % 256 >= 4; 397#L273 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 336#L268-1 check_#res#1 := check_~tmp~1#1; 337#L288 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 374#L352 assume !(0 == assert_~arg#1 % 256); 388#L347 assume { :end_inline_assert } true; 351#L326-2 [2021-12-15 17:23:02,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2021-12-15 17:23:02,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894957820] [2021-12-15 17:23:02,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,654 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:02,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1256409576, now seen corresponding path program 1 times [2021-12-15 17:23:02,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842968971] [2021-12-15 17:23:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,696 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:02,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842968971] [2021-12-15 17:23:02,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842968971] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:02,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91794390] [2021-12-15 17:23:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:02,698 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:02,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:02,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:02,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:02,700 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:02,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:02,719 INFO L93 Difference]: Finished difference Result 111 states and 152 transitions. [2021-12-15 17:23:02,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:02,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 152 transitions. [2021-12-15 17:23:02,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2021-12-15 17:23:02,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 111 states and 152 transitions. [2021-12-15 17:23:02,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2021-12-15 17:23:02,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 111 [2021-12-15 17:23:02,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 111 states and 152 transitions. [2021-12-15 17:23:02,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:02,740 INFO L681 BuchiCegarLoop]: Abstraction has 111 states and 152 transitions. [2021-12-15 17:23:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states and 152 transitions. [2021-12-15 17:23:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2021-12-15 17:23:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 1.3669724770642202) internal successors, (149), 108 states have internal predecessors, (149), 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:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2021-12-15 17:23:02,746 INFO L704 BuchiCegarLoop]: Abstraction has 109 states and 149 transitions. [2021-12-15 17:23:02,746 INFO L587 BuchiCegarLoop]: Abstraction has 109 states and 149 transitions. [2021-12-15 17:23:02,746 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:02,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 149 transitions. [2021-12-15 17:23:02,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2021-12-15 17:23:02,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:02,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:02,748 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] [2021-12-15 17:23:02,748 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:02,748 INFO L791 eck$LassoCheckResult]: Stem: 593#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(32, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 552#L167 assume 0 == ~r1~0 % 256; 532#L168 assume ~id1~0 >= 0; 533#L169 assume 0 == ~st1~0; 596#L170 assume ~send1~0 == ~id1~0; 586#L171 assume 0 == ~mode1~0 % 256; 584#L172 assume ~id2~0 >= 0; 585#L173 assume 0 == ~st2~0; 595#L174 assume ~send2~0 == ~id2~0; 530#L175 assume 0 == ~mode2~0 % 256; 531#L176 assume ~id3~0 >= 0; 590#L177 assume 0 == ~st3~0; 569#L178 assume ~send3~0 == ~id3~0; 570#L179 assume 0 == ~mode3~0 % 256; 524#L180 assume ~id4~0 >= 0; 525#L181 assume 0 == ~st4~0; 564#L182 assume ~send4~0 == ~id4~0; 566#L183 assume 0 == ~mode4~0 % 256; 543#L184 assume ~id1~0 != ~id2~0; 544#L185 assume ~id1~0 != ~id3~0; 574#L186 assume ~id1~0 != ~id4~0; 594#L187 assume ~id2~0 != ~id3~0; 545#L188 assume ~id2~0 != ~id4~0; 546#L189 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 553#L167-1 init_#res#1 := init_~tmp~0#1; 591#L260 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#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; 587#L22 assume !(0 == assume_abort_if_not_~cond#1); 571#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 572#L326-2 [2021-12-15 17:23:02,748 INFO L793 eck$LassoCheckResult]: Loop: 572#L326-2 assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 628#L64 assume !(0 != ~mode1~0 % 256); 627#L81 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 626#L81-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 557#L64-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 625#L93 assume !(0 != ~mode2~0 % 256); 624#L106 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 619#L106-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 618#L93-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 616#L118 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 615#L121 assume !(node3_~m3~0#1 != ~nomsg~0); 612#L121-1 ~mode3~0 := 0; 610#L118-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 609#L143 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 608#L146 assume !(node4_~m4~0#1 != ~nomsg~0); 604#L146-1 ~mode4~0 := 0; 602#L143-2 assume { :end_inline_node4 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 601#L268 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 600#L269 assume !(~r1~0 % 256 >= 4); 588#L272 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 589#L273 assume ~r1~0 % 256 < 4;check_~tmp~1#1 := 1; 632#L268-1 check_#res#1 := check_~tmp~1#1; 631#L288 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 630#L352 assume !(0 == assert_~arg#1 % 256); 629#L347 assume { :end_inline_assert } true; 572#L326-2 [2021-12-15 17:23:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2021-12-15 17:23:02,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305637633] [2021-12-15 17:23:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:02,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1353296785, now seen corresponding path program 1 times [2021-12-15 17:23:02,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133531183] [2021-12-15 17:23:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,817 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:02,827 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:02,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:02,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1983560393, now seen corresponding path program 1 times [2021-12-15 17:23:02,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:02,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856007755] [2021-12-15 17:23:02,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:02,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:02,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:02,880 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:02,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:02,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856007755] [2021-12-15 17:23:02,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856007755] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:02,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:02,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:02,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900227828] [2021-12-15 17:23:02,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:03,451 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:03,454 INFO L158 Benchmark]: Toolchain (without parser) took 2334.08ms. Allocated memory is still 148.9MB. Free memory was 119.2MB in the beginning and 70.1MB in the end (delta: 49.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:03,454 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 39.7MB in the beginning and 39.7MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:03,455 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 148.9MB. Free memory was 118.8MB in the beginning and 123.1MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:23:03,455 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.51ms. Allocated memory is still 148.9MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:03,455 INFO L158 Benchmark]: Boogie Preprocessor took 30.16ms. Allocated memory is still 148.9MB. Free memory was 120.6MB in the beginning and 118.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:03,456 INFO L158 Benchmark]: RCFGBuilder took 325.38ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 102.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-12-15 17:23:03,456 INFO L158 Benchmark]: BuchiAutomizer took 1628.05ms. Allocated memory is still 148.9MB. Free memory was 102.3MB in the beginning and 70.1MB in the end (delta: 32.3MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2021-12-15 17:23:03,458 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.15ms. Allocated memory is still 81.8MB. Free memory was 39.7MB in the beginning and 39.7MB in the end (delta: 39.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.83ms. Allocated memory is still 148.9MB. Free memory was 118.8MB in the beginning and 123.1MB in the end (delta: -4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.51ms. Allocated memory is still 148.9MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.16ms. Allocated memory is still 148.9MB. Free memory was 120.6MB in the beginning and 118.9MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 325.38ms. Allocated memory is still 148.9MB. Free memory was 118.9MB in the beginning and 102.7MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1628.05ms. Allocated memory is still 148.9MB. Free memory was 102.3MB in the beginning and 70.1MB in the end (delta: 32.3MB). Peak memory consumption was 35.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:03,488 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