./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_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_lcr.7_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 de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:23:08,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:23:08,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:23:08,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:23:08,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:23:08,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:23:08,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:23:08,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:23:08,386 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:23:08,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:23:08,387 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:23:08,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:23:08,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:23:08,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:23:08,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:23:08,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:23:08,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:23:08,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:23:08,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:23:08,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:23:08,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:23:08,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:23:08,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:23:08,396 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:23:08,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:23:08,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:23:08,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:23:08,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:23:08,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:23:08,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:23:08,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:23:08,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:23:08,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:23:08,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:23:08,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:23:08,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:23:08,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:23:08,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:23:08,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:23:08,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:23:08,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:23:08,406 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:08,419 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:23:08,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:23:08,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:23:08,424 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:23:08,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:23:08,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:23:08,425 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:23:08,425 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:23:08,426 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:23:08,426 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:23:08,426 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:23:08,426 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:23:08,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:23:08,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:23:08,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:23:08,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:23:08,428 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:23:08,428 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:23:08,428 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:23:08,429 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:23:08,429 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:23:08,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:23:08,429 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:23:08,429 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:23:08,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:23:08,430 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:23:08,430 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:23:08,430 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:23:08,430 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 -> de654b8e722eb26a01715e643a442ee96e677f28cab0e875133e4d1d7edb214d [2021-12-15 17:23:08,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:23:08,668 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:23:08,669 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:23:08,670 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:23:08,671 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:23:08,672 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:08,713 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6549af51b/1817a4387c5e459eab954e79ded3059d/FLAG3013b112d [2021-12-15 17:23:09,067 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:23:09,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:09,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6549af51b/1817a4387c5e459eab954e79ded3059d/FLAG3013b112d [2021-12-15 17:23:09,103 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6549af51b/1817a4387c5e459eab954e79ded3059d [2021-12-15 17:23:09,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:23:09,106 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:23:09,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:09,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:23:09,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:23:09,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:09" (1/1) ... [2021-12-15 17:23:09,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@151ec8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:09, skipping insertion in model container [2021-12-15 17:23:09,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:23:09" (1/1) ... [2021-12-15 17:23:09,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:23:09,143 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:23:09,414 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.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2021-12-15 17:23:09,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:09,439 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:23:09,547 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.7_overflow.ufo.UNBOUNDED.pals.c[20121,20134] [2021-12-15 17:23:09,547 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:23:09,563 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:23:09,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:09 WrapperNode [2021-12-15 17:23:09,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:23:09,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:09,565 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:23:09,565 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:23:09,586 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:09" (1/1) ... [2021-12-15 17:23:09,610 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:09" (1/1) ... [2021-12-15 17:23:09,660 INFO L137 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 426 [2021-12-15 17:23:09,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:23:09,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:23:09,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:23:09,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:23:09,681 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:09" (1/1) ... [2021-12-15 17:23:09,681 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:09" (1/1) ... [2021-12-15 17:23:09,684 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:09" (1/1) ... [2021-12-15 17:23:09,684 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:09" (1/1) ... [2021-12-15 17:23:09,688 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:09" (1/1) ... [2021-12-15 17:23:09,724 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:09" (1/1) ... [2021-12-15 17:23:09,725 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:09" (1/1) ... [2021-12-15 17:23:09,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:23:09,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:23:09,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:23:09,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:23:09,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:09" (1/1) ... [2021-12-15 17:23:09,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:23:09,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:23:09,790 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:09,815 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:09,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:23:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:23:09,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:23:09,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:23:09,912 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:23:09,914 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:23:10,262 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:23:10,268 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:23:10,268 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:23:10,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:10 BoogieIcfgContainer [2021-12-15 17:23:10,277 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:23:10,278 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:23:10,278 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:23:10,280 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:23:10,281 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:10,281 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:23:09" (1/3) ... [2021-12-15 17:23:10,281 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@196620a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:10, skipping insertion in model container [2021-12-15 17:23:10,282 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:10,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:23:09" (2/3) ... [2021-12-15 17:23:10,282 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@196620a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:23:10, skipping insertion in model container [2021-12-15 17:23:10,282 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:23:10,282 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:23:10" (3/3) ... [2021-12-15 17:23:10,283 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7_overflow.ufo.UNBOUNDED.pals.c [2021-12-15 17:23:10,321 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:23:10,322 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:23:10,322 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:23:10,322 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:23:10,322 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:23:10,322 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:23:10,322 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:23:10,323 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:23:10,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:10,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-12-15 17:23:10,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:10,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:10,374 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,374 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, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,374 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:23:10,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:10,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-12-15 17:23:10,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:10,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:10,407 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,408 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, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,413 INFO L791 eck$LassoCheckResult]: Stem: 116#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(41, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 41#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 60#L262true assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; 27#L262-1true init_#res#1 := init_~tmp~0#1; 42#L463true 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; 51#L24true assume !(0 == assume_abort_if_not_~cond#1); 17#L23true 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 54#L547-2true [2021-12-15 17:23:10,419 INFO L793 eck$LassoCheckResult]: Loop: 54#L547-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; 59#L87true assume !(0 != ~mode1~0 % 256); 117#L101true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 90#L101-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; 7#L87-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; 110#L113true assume !(0 != ~mode2~0 % 256); 78#L126true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 126#L126-2true ~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; 48#L113-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; 68#L138true assume !(0 != ~mode3~0 % 256); 86#L151true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 24#L151-2true ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 95#L138-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; 55#L163true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 96#L166true assume !(node4_~m4~0#1 != ~nomsg~0); 84#L166-1true ~mode4~0 := 0; 49#L163-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 19#L188true assume !(0 != ~mode5~0 % 256); 69#L201true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; 111#L201-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 10#L188-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 119#L213true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 104#L216true assume !(node6_~m6~0#1 != ~nomsg~0); 63#L216-1true ~mode6~0 := 0; 15#L213-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 28#L238true assume !(0 != ~mode7~0 % 256); 85#L251true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 53#L251-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 100#L238-2true assume { :end_inline_node7 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 26#L471true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 106#L471-1true check_#res#1 := check_~tmp~1#1; 6#L491true 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; 124#L582true assume !(0 == assert_~arg#1 % 256); 73#L577true assume { :end_inline_assert } true; 54#L547-2true [2021-12-15 17:23:10,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2021-12-15 17:23:10,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:10,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664575024] [2021-12-15 17:23:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:10,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:10,641 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:10,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:10,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664575024] [2021-12-15 17:23:10,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664575024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:10,642 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:10,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:10,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739086779] [2021-12-15 17:23:10,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:10,647 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:23:10,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1084182832, now seen corresponding path program 1 times [2021-12-15 17:23:10,647 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:10,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644463875] [2021-12-15 17:23:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:10,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:10,768 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:10,768 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:10,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644463875] [2021-12-15 17:23:10,769 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644463875] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:10,769 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:10,769 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:10,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75448144] [2021-12-15 17:23:10,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:10,770 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:10,771 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:10,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:10,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:10,796 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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:10,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:10,909 INFO L93 Difference]: Finished difference Result 126 states and 215 transitions. [2021-12-15 17:23:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:10,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 215 transitions. [2021-12-15 17:23:10,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-12-15 17:23:10,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 122 states and 162 transitions. [2021-12-15 17:23:10,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-12-15 17:23:10,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-12-15 17:23:10,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2021-12-15 17:23:10,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:10,935 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-12-15 17:23:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2021-12-15 17:23:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-12-15 17:23:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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:10,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2021-12-15 17:23:10,964 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-12-15 17:23:10,964 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-12-15 17:23:10,964 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:23:10,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2021-12-15 17:23:10,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-12-15 17:23:10,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:10,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:10,968 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,968 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, 1, 1, 1, 1, 1] [2021-12-15 17:23:10,968 INFO L791 eck$LassoCheckResult]: Stem: 391#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(41, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 336#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 337#L262 assume 0 == ~r1~0 % 256; 358#L263 assume ~id1~0 >= 0; 361#L264 assume 0 == ~st1~0; 362#L265 assume ~send1~0 == ~id1~0; 292#L266 assume 0 == ~mode1~0 % 256; 293#L267 assume ~id2~0 >= 0; 305#L268 assume 0 == ~st2~0; 306#L269 assume ~send2~0 == ~id2~0; 286#L270 assume 0 == ~mode2~0 % 256; 287#L271 assume ~id3~0 >= 0; 330#L272 assume 0 == ~st3~0; 340#L273 assume ~send3~0 == ~id3~0; 360#L274 assume 0 == ~mode3~0 % 256; 384#L275 assume ~id4~0 >= 0; 271#L276 assume 0 == ~st4~0; 272#L277 assume ~send4~0 == ~id4~0; 392#L278 assume 0 == ~mode4~0 % 256; 355#L279 assume ~id5~0 >= 0; 356#L280 assume 0 == ~st5~0; 298#L281 assume ~send5~0 == ~id5~0; 273#L282 assume 0 == ~mode5~0 % 256; 274#L283 assume ~id6~0 >= 0; 363#L284 assume 0 == ~st6~0; 364#L285 assume ~send6~0 == ~id6~0; 382#L286 assume 0 == ~mode6~0 % 256; 369#L287 assume ~id7~0 >= 0; 322#L288 assume 0 == ~st7~0; 323#L289 assume ~send7~0 == ~id7~0; 334#L290 assume 0 == ~mode7~0 % 256; 376#L291 assume ~id1~0 != ~id2~0; 377#L292 assume ~id1~0 != ~id3~0; 386#L293 assume ~id1~0 != ~id4~0; 390#L294 assume ~id1~0 != ~id5~0; 279#L295 assume ~id1~0 != ~id6~0; 280#L296 assume ~id1~0 != ~id7~0; 331#L297 assume ~id2~0 != ~id3~0; 328#L298 assume ~id2~0 != ~id4~0; 329#L299 assume ~id2~0 != ~id5~0; 335#L300 assume ~id2~0 != ~id6~0; 371#L301 assume ~id2~0 != ~id7~0; 380#L302 assume ~id3~0 != ~id4~0; 381#L303 assume ~id3~0 != ~id5~0; 388#L304 assume ~id3~0 != ~id6~0; 365#L305 assume ~id3~0 != ~id7~0; 366#L306 assume ~id4~0 != ~id5~0; 375#L307 assume ~id4~0 != ~id6~0; 288#L308 assume ~id4~0 != ~id7~0; 289#L309 assume ~id5~0 != ~id6~0; 374#L310 assume ~id5~0 != ~id7~0; 349#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 318#L262-1 init_#res#1 := init_~tmp~0#1; 319#L463 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; 338#L24 assume !(0 == assume_abort_if_not_~cond#1); 296#L23 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 297#L547-2 [2021-12-15 17:23:10,969 INFO L793 eck$LassoCheckResult]: Loop: 297#L547-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#L87 assume !(0 != ~mode1~0 % 256); 357#L101 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 383#L101-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; 277#L87-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; 278#L113 assume !(0 != ~mode2~0 % 256); 372#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 373#L126-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; 346#L113-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; 347#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 343#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 344#L141-1 ~mode3~0 := 0; 314#L138-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; 353#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 354#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 303#L166-1 ~mode4~0 := 0; 348#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 299#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 300#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 378#L191-1 ~mode5~0 := 0; 284#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 285#L213 assume !(0 != ~mode6~0 % 256); 290#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 291#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 294#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 295#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 320#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 325#L241-1 ~mode7~0 := 0; 351#L238-2 assume { :end_inline_node7 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 315#L471 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 316#L471-1 check_#res#1 := check_~tmp~1#1; 275#L491 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; 276#L582 assume !(0 == assert_~arg#1 % 256); 370#L577 assume { :end_inline_assert } true; 297#L547-2 [2021-12-15 17:23:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:10,969 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2021-12-15 17:23:10,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:10,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288776907] [2021-12-15 17:23:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:10,970 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,001 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,069 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:11,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1396560678, now seen corresponding path program 1 times [2021-12-15 17:23:11,072 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238810229] [2021-12-15 17:23:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:11,155 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:11,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:11,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238810229] [2021-12-15 17:23:11,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238810229] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:11,156 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:11,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-15 17:23:11,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480095624] [2021-12-15 17:23:11,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:11,157 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:11,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-15 17:23:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-15 17:23:11,159 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:11,205 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2021-12-15 17:23:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:23:11,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2021-12-15 17:23:11,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-12-15 17:23:11,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2021-12-15 17:23:11,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-12-15 17:23:11,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-12-15 17:23:11,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2021-12-15 17:23:11,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:11,214 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-12-15 17:23:11,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2021-12-15 17:23:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-12-15 17:23:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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:11,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2021-12-15 17:23:11,219 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-12-15 17:23:11,220 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-12-15 17:23:11,220 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:23:11,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2021-12-15 17:23:11,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-12-15 17:23:11,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:11,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:11,222 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:11,222 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:11,222 INFO L791 eck$LassoCheckResult]: Stem: 650#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(41, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 594#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 595#L262 assume 0 == ~r1~0 % 256; 617#L263 assume ~id1~0 >= 0; 620#L264 assume 0 == ~st1~0; 621#L265 assume ~send1~0 == ~id1~0; 551#L266 assume 0 == ~mode1~0 % 256; 552#L267 assume ~id2~0 >= 0; 564#L268 assume 0 == ~st2~0; 565#L269 assume ~send2~0 == ~id2~0; 545#L270 assume 0 == ~mode2~0 % 256; 546#L271 assume ~id3~0 >= 0; 588#L272 assume 0 == ~st3~0; 599#L273 assume ~send3~0 == ~id3~0; 619#L274 assume 0 == ~mode3~0 % 256; 643#L275 assume ~id4~0 >= 0; 530#L276 assume 0 == ~st4~0; 531#L277 assume ~send4~0 == ~id4~0; 651#L278 assume 0 == ~mode4~0 % 256; 614#L279 assume ~id5~0 >= 0; 615#L280 assume 0 == ~st5~0; 557#L281 assume ~send5~0 == ~id5~0; 532#L282 assume 0 == ~mode5~0 % 256; 533#L283 assume ~id6~0 >= 0; 622#L284 assume 0 == ~st6~0; 623#L285 assume ~send6~0 == ~id6~0; 641#L286 assume 0 == ~mode6~0 % 256; 628#L287 assume ~id7~0 >= 0; 580#L288 assume 0 == ~st7~0; 581#L289 assume ~send7~0 == ~id7~0; 592#L290 assume 0 == ~mode7~0 % 256; 635#L291 assume ~id1~0 != ~id2~0; 636#L292 assume ~id1~0 != ~id3~0; 645#L293 assume ~id1~0 != ~id4~0; 649#L294 assume ~id1~0 != ~id5~0; 538#L295 assume ~id1~0 != ~id6~0; 539#L296 assume ~id1~0 != ~id7~0; 589#L297 assume ~id2~0 != ~id3~0; 586#L298 assume ~id2~0 != ~id4~0; 587#L299 assume ~id2~0 != ~id5~0; 593#L300 assume ~id2~0 != ~id6~0; 630#L301 assume ~id2~0 != ~id7~0; 639#L302 assume ~id3~0 != ~id4~0; 640#L303 assume ~id3~0 != ~id5~0; 647#L304 assume ~id3~0 != ~id6~0; 624#L305 assume ~id3~0 != ~id7~0; 625#L306 assume ~id4~0 != ~id5~0; 634#L307 assume ~id4~0 != ~id6~0; 547#L308 assume ~id4~0 != ~id7~0; 548#L309 assume ~id5~0 != ~id6~0; 633#L310 assume ~id5~0 != ~id7~0; 608#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 576#L262-1 init_#res#1 := init_~tmp~0#1; 577#L463 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; 596#L24 assume !(0 == assume_abort_if_not_~cond#1); 555#L23 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 556#L547-2 [2021-12-15 17:23:11,223 INFO L793 eck$LassoCheckResult]: Loop: 556#L547-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; 611#L87 assume !(0 != ~mode1~0 % 256); 616#L101 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 642#L101-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; 536#L87-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; 537#L113 assume !(0 != ~mode2~0 % 256); 631#L126 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 632#L126-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; 605#L113-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; 606#L138 assume !(0 != ~mode3~0 % 256); 626#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 572#L151-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 573#L138-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; 612#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 613#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 562#L166-1 ~mode4~0 := 0; 607#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 558#L188 assume !(0 != ~mode5~0 % 256); 560#L201 assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; 627#L201-2 ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 543#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 544#L213 assume !(0 != ~mode6~0 % 256); 549#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 550#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 553#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 554#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 578#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 583#L241-1 ~mode7~0 := 0; 610#L238-2 assume { :end_inline_node7 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 574#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 575#L472 assume ~r1~0 % 256 >= 7; 591#L476 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 597#L471-1 check_#res#1 := check_~tmp~1#1; 534#L491 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; 535#L582 assume !(0 == assert_~arg#1 % 256); 629#L577 assume { :end_inline_assert } true; 556#L547-2 [2021-12-15 17:23:11,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,223 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2021-12-15 17:23:11,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137916973] [2021-12-15 17:23:11,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,243 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,281 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 605337792, now seen corresponding path program 1 times [2021-12-15 17:23:11,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944991455] [2021-12-15 17:23:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:11,334 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:11,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944991455] [2021-12-15 17:23:11,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944991455] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:11,335 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:11,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:11,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434363295] [2021-12-15 17:23:11,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:11,336 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:23:11,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:23:11,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:23:11,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:23:11,337 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:11,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:23:11,363 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2021-12-15 17:23:11,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:23:11,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2021-12-15 17:23:11,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-12-15 17:23:11,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2021-12-15 17:23:11,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2021-12-15 17:23:11,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2021-12-15 17:23:11,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2021-12-15 17:23:11,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:23:11,374 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-12-15 17:23:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2021-12-15 17:23:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-12-15 17:23:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2021-12-15 17:23:11,381 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-12-15 17:23:11,381 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-12-15 17:23:11,381 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:23:11,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2021-12-15 17:23:11,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-12-15 17:23:11,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:23:11,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:23:11,383 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:11,383 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-15 17:23:11,384 INFO L791 eck$LassoCheckResult]: Stem: 963#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(41, 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;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 904#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 905#L262 assume 0 == ~r1~0 % 256; 928#L263 assume ~id1~0 >= 0; 931#L264 assume 0 == ~st1~0; 932#L265 assume ~send1~0 == ~id1~0; 863#L266 assume 0 == ~mode1~0 % 256; 864#L267 assume ~id2~0 >= 0; 877#L268 assume 0 == ~st2~0; 878#L269 assume ~send2~0 == ~id2~0; 855#L270 assume 0 == ~mode2~0 % 256; 856#L271 assume ~id3~0 >= 0; 898#L272 assume 0 == ~st3~0; 908#L273 assume ~send3~0 == ~id3~0; 930#L274 assume 0 == ~mode3~0 % 256; 956#L275 assume ~id4~0 >= 0; 840#L276 assume 0 == ~st4~0; 841#L277 assume ~send4~0 == ~id4~0; 964#L278 assume 0 == ~mode4~0 % 256; 925#L279 assume ~id5~0 >= 0; 926#L280 assume 0 == ~st5~0; 867#L281 assume ~send5~0 == ~id5~0; 842#L282 assume 0 == ~mode5~0 % 256; 843#L283 assume ~id6~0 >= 0; 933#L284 assume 0 == ~st6~0; 934#L285 assume ~send6~0 == ~id6~0; 954#L286 assume 0 == ~mode6~0 % 256; 939#L287 assume ~id7~0 >= 0; 890#L288 assume 0 == ~st7~0; 891#L289 assume ~send7~0 == ~id7~0; 901#L290 assume 0 == ~mode7~0 % 256; 948#L291 assume ~id1~0 != ~id2~0; 949#L292 assume ~id1~0 != ~id3~0; 958#L293 assume ~id1~0 != ~id4~0; 962#L294 assume ~id1~0 != ~id5~0; 848#L295 assume ~id1~0 != ~id6~0; 849#L296 assume ~id1~0 != ~id7~0; 899#L297 assume ~id2~0 != ~id3~0; 896#L298 assume ~id2~0 != ~id4~0; 897#L299 assume ~id2~0 != ~id5~0; 903#L300 assume ~id2~0 != ~id6~0; 941#L301 assume ~id2~0 != ~id7~0; 952#L302 assume ~id3~0 != ~id4~0; 953#L303 assume ~id3~0 != ~id5~0; 960#L304 assume ~id3~0 != ~id6~0; 935#L305 assume ~id3~0 != ~id7~0; 936#L306 assume ~id4~0 != ~id5~0; 947#L307 assume ~id4~0 != ~id6~0; 859#L308 assume ~id4~0 != ~id7~0; 860#L309 assume ~id5~0 != ~id6~0; 946#L310 assume ~id5~0 != ~id7~0; 918#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 888#L262-1 init_#res#1 := init_~tmp~0#1; 889#L463 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; 906#L24 assume !(0 == assume_abort_if_not_~cond#1); 865#L23 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;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 866#L547-2 [2021-12-15 17:23:11,384 INFO L793 eck$LassoCheckResult]: Loop: 866#L547-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; 1017#L87 assume 0 != ~mode1~0 % 256;~r1~0 := 1 + ~r1~0 % 256;node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 881#L91 assume !(node1_~m1~0#1 != ~nomsg~0); 882#L91-1 ~mode1~0 := 0; 902#L87-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; 1014#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1011#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 1009#L116-1 ~mode2~0 := 0; 1007#L113-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; 1006#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1003#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 1001#L141-1 ~mode3~0 := 0; 999#L138-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; 998#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 995#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 993#L166-1 ~mode4~0 := 0; 991#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 990#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 987#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 985#L191-1 ~mode5~0 := 0; 983#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 982#L213 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 979#L216 assume !(node6_~m6~0#1 != ~nomsg~0); 977#L216-1 ~mode6~0 := 0; 975#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 974#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 972#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 969#L241-1 ~mode7~0 := 0; 967#L238-2 assume { :end_inline_node7 } 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;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 966#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 965#L472 assume !(~r1~0 % 256 >= 7); 944#L475 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 945#L476 assume ~r1~0 % 256 < 7;check_~tmp~1#1 := 1; 1021#L471-1 check_#res#1 := check_~tmp~1#1; 1020#L491 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; 1019#L582 assume !(0 == assert_~arg#1 % 256); 1018#L577 assume { :end_inline_assert } true; 866#L547-2 [2021-12-15 17:23:11,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,384 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2021-12-15 17:23:11,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29802233] [2021-12-15 17:23:11,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,385 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,399 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,447 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:11,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,447 INFO L85 PathProgramCache]: Analyzing trace with hash -984441775, now seen corresponding path program 1 times [2021-12-15 17:23:11,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362953552] [2021-12-15 17:23:11,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:23:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:23:11,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:23:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:23:11,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1657790688, now seen corresponding path program 1 times [2021-12-15 17:23:11,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:23:11,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103228813] [2021-12-15 17:23:11,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:23:11,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:23:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:23:11,519 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:11,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:23:11,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103228813] [2021-12-15 17:23:11,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103228813] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:23:11,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:23:11,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:23:11,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821320531] [2021-12-15 17:23:11,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:23:12,431 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:12,434 INFO L158 Benchmark]: Toolchain (without parser) took 3327.56ms. Allocated memory was 109.1MB in the beginning and 165.7MB in the end (delta: 56.6MB). Free memory was 69.6MB in the beginning and 129.6MB in the end (delta: -60.0MB). Peak memory consumption was 83.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,435 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 86.8MB in the beginning and 86.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:23:12,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.65ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 78.8MB in the end (delta: -9.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.47ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 75.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,436 INFO L158 Benchmark]: Boogie Preprocessor took 70.56ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,436 INFO L158 Benchmark]: RCFGBuilder took 545.32ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 50.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,437 INFO L158 Benchmark]: BuchiAutomizer took 2155.80ms. Allocated memory was 109.1MB in the beginning and 165.7MB in the end (delta: 56.6MB). Free memory was 50.3MB in the beginning and 129.6MB in the end (delta: -79.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2021-12-15 17:23:12,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory was 86.8MB in the beginning and 86.7MB in the end (delta: 117.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.65ms. Allocated memory is still 109.1MB. Free memory was 69.4MB in the beginning and 78.8MB in the end (delta: -9.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.47ms. Allocated memory is still 109.1MB. Free memory was 78.8MB in the beginning and 75.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.56ms. Allocated memory is still 109.1MB. Free memory was 75.8MB in the beginning and 73.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.32ms. Allocated memory is still 109.1MB. Free memory was 73.7MB in the beginning and 50.5MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 2155.80ms. Allocated memory was 109.1MB in the beginning and 165.7MB in the end (delta: 56.6MB). Free memory was 50.3MB in the beginning and 129.6MB in the end (delta: -79.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:23:12,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable