./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy2.cil.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/systemc/toy2.cil.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 a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:21:22,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:21:22,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:21:22,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:21:22,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:21:22,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:21:22,477 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:21:22,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:21:22,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:21:22,481 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:21:22,482 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:21:22,483 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:21:22,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:21:22,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:21:22,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:21:22,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:21:22,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:21:22,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:21:22,489 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:21:22,491 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:21:22,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:21:22,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:21:22,494 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:21:22,495 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:21:22,497 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:21:22,497 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:21:22,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:21:22,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:21:22,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:21:22,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:21:22,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:21:22,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:21:22,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:21:22,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:21:22,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:21:22,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:21:22,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:21:22,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:21:22,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:21:22,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:21:22,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:21:22,506 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:21:22,524 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:21:22,525 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:21:22,525 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:21:22,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:21:22,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:21:22,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:21:22,527 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:21:22,527 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:21:22,527 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:21:22,527 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:21:22,527 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:21:22,527 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:21:22,528 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:21:22,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:21:22,528 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:21:22,528 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:21:22,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:21:22,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:21:22,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:21:22,530 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:21:22,530 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:21:22,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:21:22,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:21:22,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:21:22,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:21:22,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:21:22,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:21:22,532 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:21:22,532 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 -> a77d6f304c19846fdc8cd5bba9216d69953659ded966cffbf7faa285e2d864a4 [2021-12-15 17:21:22,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:21:22,745 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:21:22,748 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:21:22,749 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:21:22,749 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:21:22,751 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy2.cil.c [2021-12-15 17:21:22,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100ffb337/db6764db1c5d49a1b614117d6d88aaad/FLAGd64743693 [2021-12-15 17:21:23,192 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:21:23,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy2.cil.c [2021-12-15 17:21:23,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100ffb337/db6764db1c5d49a1b614117d6d88aaad/FLAGd64743693 [2021-12-15 17:21:23,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/100ffb337/db6764db1c5d49a1b614117d6d88aaad [2021-12-15 17:21:23,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:21:23,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:21:23,610 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:23,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:21:23,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:21:23,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378801f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23, skipping insertion in model container [2021-12-15 17:21:23,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,622 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:21:23,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:21:23,790 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/systemc/toy2.cil.c[698,711] [2021-12-15 17:21:23,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:23,849 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:21:23,858 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/systemc/toy2.cil.c[698,711] [2021-12-15 17:21:23,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:23,897 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:21:23,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23 WrapperNode [2021-12-15 17:21:23,898 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:23,899 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:23,899 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:21:23,899 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:21:23,913 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:21:23" (1/1) ... [2021-12-15 17:21:23,925 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:21:23" (1/1) ... [2021-12-15 17:21:23,951 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 356 [2021-12-15 17:21:23,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:23,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:21:23,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:21:23,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:21:23,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,966 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:21:23,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:21:23,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:21:23,979 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:21:23,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (1/1) ... [2021-12-15 17:21:23,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:21:24,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:21:24,033 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:21:24,084 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:21:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:21:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:21:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:21:24,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:21:24,175 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:21:24,176 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:21:24,519 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:21:24,525 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:21:24,526 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 17:21:24,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:24 BoogieIcfgContainer [2021-12-15 17:21:24,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:21:24,528 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:21:24,528 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:21:24,539 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:21:24,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:24,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:21:23" (1/3) ... [2021-12-15 17:21:24,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccbdc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:24, skipping insertion in model container [2021-12-15 17:21:24,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:24,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:23" (2/3) ... [2021-12-15 17:21:24,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ccbdc6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:24, skipping insertion in model container [2021-12-15 17:21:24,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:24,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:24" (3/3) ... [2021-12-15 17:21:24,544 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy2.cil.c [2021-12-15 17:21:24,582 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:21:24,582 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:21:24,582 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:21:24,582 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:21:24,582 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:21:24,583 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:21:24,583 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:21:24,583 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:21:24,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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:21:24,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,636 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] [2021-12-15 17:21:24,637 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] [2021-12-15 17:21:24,637 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:21:24,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 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:21:24,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 95 [2021-12-15 17:21:24,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,663 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] [2021-12-15 17:21:24,665 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] [2021-12-15 17:21:24,672 INFO L791 eck$LassoCheckResult]: Stem: 119#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 47#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 114#L404true assume !(1 == ~c_req_up~0); 67#L404-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 26#L415-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 56#L420-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 90#L425-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 44#L430-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 126#L435-1true assume !(0 == ~e_f~0); 32#L440-1true assume !(0 == ~e_g~0); 49#L445-1true assume !(0 == ~e_e~0); 52#L450-1true assume !(0 == ~e_c~0); 25#L455-1true assume !(0 == ~e_wl~0); 82#L460-1true assume !(1 == ~wl_pc~0); 39#L472true assume !(2 == ~wl_pc~0); 123#L473true assume !(1 == ~c1_pc~0); 104#L483true assume !(1 == ~c2_pc~0); 115#L492true assume !(1 == ~wb_pc~0); 58#L501true assume !(1 == ~e_c~0); 37#L510-1true assume !(1 == ~e_e~0); 27#L515-1true assume !(1 == ~e_f~0); 16#L520-1true assume !(1 == ~e_g~0); 50#L525-1true assume !(1 == ~e_c~0); 87#L530-1true assume !(1 == ~e_wl~0); 69#L672-1true [2021-12-15 17:21:24,674 INFO L793 eck$LassoCheckResult]: Loop: 69#L672-1true assume !false; 9#L542true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 128#L377true assume !true; 24#L393true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 68#L548true assume !(1 == ~c_req_up~0); 12#L548-2true start_simulation_~kernel_st~0#1 := 3; 29#L560true assume 0 == ~e_f~0;~e_f~0 := 1; 98#L560-2true assume 0 == ~e_g~0;~e_g~0 := 1; 20#L565-1true assume 0 == ~e_e~0;~e_e~0 := 1; 129#L570-1true assume 0 == ~e_c~0;~e_c~0 := 1; 40#L575-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 124#L580-1true assume 1 == ~wl_pc~0; 102#L586true assume 1 == ~e_wl~0;~wl_st~0 := 0; 85#L593true assume !(1 == ~c1_pc~0); 116#L603true assume !(1 == ~c2_pc~0); 5#L612true assume !(1 == ~wb_pc~0); 66#L621true assume !(1 == ~e_c~0); 64#L630-1true assume 1 == ~e_e~0;~e_e~0 := 2; 131#L635-1true assume 1 == ~e_f~0;~e_f~0 := 2; 130#L640-1true assume 1 == ~e_g~0;~e_g~0 := 2; 112#L645-1true assume 1 == ~e_c~0;~e_c~0 := 2; 14#L650-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 45#L655-1true assume 0 == ~wl_st~0; 69#L672-1true [2021-12-15 17:21:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-15 17:21:24,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442833490] [2021-12-15 17:21:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,918 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:21:24,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442833490] [2021-12-15 17:21:24,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442833490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,923 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884204018] [2021-12-15 17:21:24,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,930 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1920133393, now seen corresponding path program 1 times [2021-12-15 17:21:24,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172017798] [2021-12-15 17:21:24,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,965 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:21:24,966 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172017798] [2021-12-15 17:21:24,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172017798] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:21:24,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016751489] [2021-12-15 17:21:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,968 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,969 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:21:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:21:25,003 INFO L87 Difference]: Start difference. First operand has 130 states, 129 states have (on average 1.8294573643410852) internal successors, (236), 129 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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:21:25,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,026 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2021-12-15 17:21:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:21:25,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 222 transitions. [2021-12-15 17:21:25,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 124 states and 217 transitions. [2021-12-15 17:21:25,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2021-12-15 17:21:25,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2021-12-15 17:21:25,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 217 transitions. [2021-12-15 17:21:25,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,054 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2021-12-15 17:21:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 217 transitions. [2021-12-15 17:21:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-15 17:21:25,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.75) internal successors, (217), 123 states have internal predecessors, (217), 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:21:25,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 217 transitions. [2021-12-15 17:21:25,089 INFO L704 BuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2021-12-15 17:21:25,089 INFO L587 BuchiCegarLoop]: Abstraction has 124 states and 217 transitions. [2021-12-15 17:21:25,090 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:21:25,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 217 transitions. [2021-12-15 17:21:25,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,096 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] [2021-12-15 17:21:25,096 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] [2021-12-15 17:21:25,097 INFO L791 eck$LassoCheckResult]: Stem: 389#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 346#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 347#L404 assume !(1 == ~c_req_up~0); 367#L404-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 314#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 315#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 360#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 343#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 344#L435-1 assume !(0 == ~e_f~0); 323#L440-1 assume !(0 == ~e_g~0); 324#L445-1 assume !(0 == ~e_e~0); 350#L450-1 assume !(0 == ~e_c~0); 312#L455-1 assume !(0 == ~e_wl~0); 313#L460-1 assume !(1 == ~wl_pc~0); 332#L472 assume !(2 == ~wl_pc~0); 333#L473 assume !(1 == ~c1_pc~0); 384#L483 assume !(1 == ~c2_pc~0); 298#L492 assume !(1 == ~wb_pc~0); 349#L501 assume !(1 == ~e_c~0); 330#L510-1 assume !(1 == ~e_e~0); 316#L515-1 assume !(1 == ~e_f~0); 295#L520-1 assume !(1 == ~e_g~0); 296#L525-1 assume !(1 == ~e_c~0); 351#L530-1 assume !(1 == ~e_wl~0); 293#L672-1 [2021-12-15 17:21:25,101 INFO L793 eck$LassoCheckResult]: Loop: 293#L672-1 assume !false; 281#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 269#L377 assume !false; 276#L295 assume !(0 == ~wl_st~0); 278#L299 assume !(0 == ~c1_st~0); 342#L302 assume !(0 == ~c2_st~0); 368#L305 assume !(0 == ~wb_st~0); 288#L308 assume !(0 == ~r_st~0); 289#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 311#L548 assume !(1 == ~c_req_up~0); 286#L548-2 start_simulation_~kernel_st~0#1 := 3; 287#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 319#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 305#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 306#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 338#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L580-1 assume !(1 == ~wl_pc~0); 308#L592 assume !(2 == ~wl_pc~0); 309#L593 assume !(1 == ~c1_pc~0); 359#L603 assume !(1 == ~c2_pc~0); 270#L612 assume !(1 == ~wb_pc~0); 272#L621 assume !(1 == ~e_c~0); 364#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 365#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 391#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 388#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 290#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 291#L655-1 assume 0 == ~wl_st~0; 293#L672-1 [2021-12-15 17:21:25,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-15 17:21:25,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077766668] [2021-12-15 17:21:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,189 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:21:25,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077766668] [2021-12-15 17:21:25,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077766668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,190 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622966788] [2021-12-15 17:21:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,191 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,192 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 1 times [2021-12-15 17:21:25,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439374182] [2021-12-15 17:21:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,237 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:21:25,238 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439374182] [2021-12-15 17:21:25,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439374182] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658613587] [2021-12-15 17:21:25,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,240 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:25,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:25,241 INFO L87 Difference]: Start difference. First operand 124 states and 217 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:25,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,272 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2021-12-15 17:21:25,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:25,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 216 transitions. [2021-12-15 17:21:25,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 216 transitions. [2021-12-15 17:21:25,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2021-12-15 17:21:25,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2021-12-15 17:21:25,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 216 transitions. [2021-12-15 17:21:25,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,278 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2021-12-15 17:21:25,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 216 transitions. [2021-12-15 17:21:25,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-15 17:21:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7419354838709677) internal successors, (216), 123 states have internal predecessors, (216), 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:21:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 216 transitions. [2021-12-15 17:21:25,285 INFO L704 BuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2021-12-15 17:21:25,285 INFO L587 BuchiCegarLoop]: Abstraction has 124 states and 216 transitions. [2021-12-15 17:21:25,285 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:21:25,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 216 transitions. [2021-12-15 17:21:25,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,287 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] [2021-12-15 17:21:25,289 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] [2021-12-15 17:21:25,289 INFO L791 eck$LassoCheckResult]: Stem: 644#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 601#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 602#L404 assume !(1 == ~c_req_up~0); 622#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 569#L415-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 570#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 615#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 598#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 599#L435-1 assume !(0 == ~e_f~0); 578#L440-1 assume !(0 == ~e_g~0); 579#L445-1 assume !(0 == ~e_e~0); 605#L450-1 assume !(0 == ~e_c~0); 567#L455-1 assume !(0 == ~e_wl~0); 568#L460-1 assume !(1 == ~wl_pc~0); 587#L472 assume !(2 == ~wl_pc~0); 588#L473 assume !(1 == ~c1_pc~0); 639#L483 assume !(1 == ~c2_pc~0); 553#L492 assume !(1 == ~wb_pc~0); 604#L501 assume !(1 == ~e_c~0); 585#L510-1 assume !(1 == ~e_e~0); 571#L515-1 assume !(1 == ~e_f~0); 550#L520-1 assume !(1 == ~e_g~0); 551#L525-1 assume !(1 == ~e_c~0); 606#L530-1 assume !(1 == ~e_wl~0); 548#L672-1 [2021-12-15 17:21:25,289 INFO L793 eck$LassoCheckResult]: Loop: 548#L672-1 assume !false; 536#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 524#L377 assume !false; 531#L295 assume !(0 == ~wl_st~0); 533#L299 assume !(0 == ~c1_st~0); 597#L302 assume !(0 == ~c2_st~0); 623#L305 assume !(0 == ~wb_st~0); 543#L308 assume !(0 == ~r_st~0); 544#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 566#L548 assume !(1 == ~c_req_up~0); 541#L548-2 start_simulation_~kernel_st~0#1 := 3; 542#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 574#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 560#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 561#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 593#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 594#L580-1 assume !(1 == ~wl_pc~0); 563#L592 assume !(2 == ~wl_pc~0); 564#L593 assume !(1 == ~c1_pc~0); 614#L603 assume !(1 == ~c2_pc~0); 525#L612 assume !(1 == ~wb_pc~0); 527#L621 assume !(1 == ~e_c~0); 619#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 620#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 646#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 643#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 545#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 546#L655-1 assume 0 == ~wl_st~0; 548#L672-1 [2021-12-15 17:21:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-15 17:21:25,290 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061014320] [2021-12-15 17:21:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,291 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,330 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:21:25,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061014320] [2021-12-15 17:21:25,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061014320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144687700] [2021-12-15 17:21:25,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,332 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 2 times [2021-12-15 17:21:25,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866924325] [2021-12-15 17:21:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,372 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:21:25,372 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866924325] [2021-12-15 17:21:25,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866924325] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516782800] [2021-12-15 17:21:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,373 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:25,374 INFO L87 Difference]: Start difference. First operand 124 states and 216 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,384 INFO L93 Difference]: Finished difference Result 124 states and 215 transitions. [2021-12-15 17:21:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:25,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 215 transitions. [2021-12-15 17:21:25,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 215 transitions. [2021-12-15 17:21:25,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2021-12-15 17:21:25,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2021-12-15 17:21:25,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 215 transitions. [2021-12-15 17:21:25,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,389 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2021-12-15 17:21:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 215 transitions. [2021-12-15 17:21:25,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-15 17:21:25,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7338709677419355) internal successors, (215), 123 states have internal predecessors, (215), 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:21:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 215 transitions. [2021-12-15 17:21:25,394 INFO L704 BuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2021-12-15 17:21:25,394 INFO L587 BuchiCegarLoop]: Abstraction has 124 states and 215 transitions. [2021-12-15 17:21:25,394 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:21:25,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 215 transitions. [2021-12-15 17:21:25,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,396 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] [2021-12-15 17:21:25,396 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] [2021-12-15 17:21:25,397 INFO L791 eck$LassoCheckResult]: Stem: 899#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 857#L404 assume !(1 == ~c_req_up~0); 877#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 824#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 825#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 870#L425-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 853#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 854#L435-1 assume !(0 == ~e_f~0); 833#L440-1 assume !(0 == ~e_g~0); 834#L445-1 assume !(0 == ~e_e~0); 860#L450-1 assume !(0 == ~e_c~0); 822#L455-1 assume !(0 == ~e_wl~0); 823#L460-1 assume !(1 == ~wl_pc~0); 842#L472 assume !(2 == ~wl_pc~0); 843#L473 assume !(1 == ~c1_pc~0); 894#L483 assume !(1 == ~c2_pc~0); 808#L492 assume !(1 == ~wb_pc~0); 859#L501 assume !(1 == ~e_c~0); 840#L510-1 assume !(1 == ~e_e~0); 826#L515-1 assume !(1 == ~e_f~0); 805#L520-1 assume !(1 == ~e_g~0); 806#L525-1 assume !(1 == ~e_c~0); 861#L530-1 assume !(1 == ~e_wl~0); 803#L672-1 [2021-12-15 17:21:25,397 INFO L793 eck$LassoCheckResult]: Loop: 803#L672-1 assume !false; 791#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 779#L377 assume !false; 786#L295 assume !(0 == ~wl_st~0); 788#L299 assume !(0 == ~c1_st~0); 852#L302 assume !(0 == ~c2_st~0); 878#L305 assume !(0 == ~wb_st~0); 798#L308 assume !(0 == ~r_st~0); 799#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 821#L548 assume !(1 == ~c_req_up~0); 796#L548-2 start_simulation_~kernel_st~0#1 := 3; 797#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 829#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 815#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 816#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 848#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 849#L580-1 assume !(1 == ~wl_pc~0); 818#L592 assume !(2 == ~wl_pc~0); 819#L593 assume !(1 == ~c1_pc~0); 869#L603 assume !(1 == ~c2_pc~0); 780#L612 assume !(1 == ~wb_pc~0); 782#L621 assume !(1 == ~e_c~0); 874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 901#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 898#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 800#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 801#L655-1 assume 0 == ~wl_st~0; 803#L672-1 [2021-12-15 17:21:25,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-15 17:21:25,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840539057] [2021-12-15 17:21:25,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,398 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,421 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:21:25,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840539057] [2021-12-15 17:21:25,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840539057] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,422 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,422 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227835877] [2021-12-15 17:21:25,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,423 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,423 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 3 times [2021-12-15 17:21:25,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056980510] [2021-12-15 17:21:25,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,440 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:21:25,441 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056980510] [2021-12-15 17:21:25,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056980510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,441 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,441 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,441 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98598785] [2021-12-15 17:21:25,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,442 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,442 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:25,443 INFO L87 Difference]: Start difference. First operand 124 states and 215 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,455 INFO L93 Difference]: Finished difference Result 124 states and 214 transitions. [2021-12-15 17:21:25,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:25,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 214 transitions. [2021-12-15 17:21:25,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 124 states and 214 transitions. [2021-12-15 17:21:25,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2021-12-15 17:21:25,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2021-12-15 17:21:25,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 124 states and 214 transitions. [2021-12-15 17:21:25,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,459 INFO L681 BuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2021-12-15 17:21:25,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 214 transitions. [2021-12-15 17:21:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2021-12-15 17:21:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.7258064516129032) internal successors, (214), 123 states have internal predecessors, (214), 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:21:25,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 214 transitions. [2021-12-15 17:21:25,464 INFO L704 BuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2021-12-15 17:21:25,464 INFO L587 BuchiCegarLoop]: Abstraction has 124 states and 214 transitions. [2021-12-15 17:21:25,464 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:21:25,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 124 states and 214 transitions. [2021-12-15 17:21:25,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2021-12-15 17:21:25,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,466 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] [2021-12-15 17:21:25,466 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] [2021-12-15 17:21:25,466 INFO L791 eck$LassoCheckResult]: Stem: 1154#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1112#L404 assume !(1 == ~c_req_up~0); 1132#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1079#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1080#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1125#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1108#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1109#L435-1 assume !(0 == ~e_f~0); 1088#L440-1 assume !(0 == ~e_g~0); 1089#L445-1 assume !(0 == ~e_e~0); 1115#L450-1 assume !(0 == ~e_c~0); 1077#L455-1 assume !(0 == ~e_wl~0); 1078#L460-1 assume !(1 == ~wl_pc~0); 1097#L472 assume !(2 == ~wl_pc~0); 1098#L473 assume !(1 == ~c1_pc~0); 1149#L483 assume !(1 == ~c2_pc~0); 1063#L492 assume !(1 == ~wb_pc~0); 1114#L501 assume !(1 == ~e_c~0); 1095#L510-1 assume !(1 == ~e_e~0); 1081#L515-1 assume !(1 == ~e_f~0); 1060#L520-1 assume !(1 == ~e_g~0); 1061#L525-1 assume !(1 == ~e_c~0); 1116#L530-1 assume !(1 == ~e_wl~0); 1058#L672-1 [2021-12-15 17:21:25,466 INFO L793 eck$LassoCheckResult]: Loop: 1058#L672-1 assume !false; 1046#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1034#L377 assume !false; 1041#L295 assume !(0 == ~wl_st~0); 1043#L299 assume !(0 == ~c1_st~0); 1107#L302 assume !(0 == ~c2_st~0); 1133#L305 assume !(0 == ~wb_st~0); 1053#L308 assume !(0 == ~r_st~0); 1054#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1076#L548 assume !(1 == ~c_req_up~0); 1051#L548-2 start_simulation_~kernel_st~0#1 := 3; 1052#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1084#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1070#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1071#L570-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1103#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1104#L580-1 assume !(1 == ~wl_pc~0); 1073#L592 assume !(2 == ~wl_pc~0); 1074#L593 assume !(1 == ~c1_pc~0); 1124#L603 assume !(1 == ~c2_pc~0); 1035#L612 assume !(1 == ~wb_pc~0); 1037#L621 assume !(1 == ~e_c~0); 1129#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1130#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1156#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1153#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1055#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1056#L655-1 assume 0 == ~wl_st~0; 1058#L672-1 [2021-12-15 17:21:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-15 17:21:25,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473916161] [2021-12-15 17:21:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,467 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:25,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:25,503 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:25,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash 86756478, now seen corresponding path program 4 times [2021-12-15 17:21:25,503 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709535764] [2021-12-15 17:21:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,520 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:21:25,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709535764] [2021-12-15 17:21:25,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709535764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480370259] [2021-12-15 17:21:25,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,521 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:25,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:25,522 INFO L87 Difference]: Start difference. First operand 124 states and 214 transitions. cyclomatic complexity: 91 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:21:25,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,547 INFO L93 Difference]: Finished difference Result 156 states and 274 transitions. [2021-12-15 17:21:25,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:25,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 274 transitions. [2021-12-15 17:21:25,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-12-15 17:21:25,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 156 states and 274 transitions. [2021-12-15 17:21:25,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2021-12-15 17:21:25,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2021-12-15 17:21:25,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 156 states and 274 transitions. [2021-12-15 17:21:25,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,552 INFO L681 BuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2021-12-15 17:21:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 274 transitions. [2021-12-15 17:21:25,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-15 17:21:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 156 states have (on average 1.7564102564102564) internal successors, (274), 155 states have internal predecessors, (274), 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:21:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 274 transitions. [2021-12-15 17:21:25,557 INFO L704 BuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2021-12-15 17:21:25,557 INFO L587 BuchiCegarLoop]: Abstraction has 156 states and 274 transitions. [2021-12-15 17:21:25,558 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:21:25,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 274 transitions. [2021-12-15 17:21:25,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 109 [2021-12-15 17:21:25,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,559 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] [2021-12-15 17:21:25,559 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] [2021-12-15 17:21:25,560 INFO L791 eck$LassoCheckResult]: Stem: 1441#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1397#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1398#L404 assume !(1 == ~c_req_up~0); 1419#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1365#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1366#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1412#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1394#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1395#L435-1 assume !(0 == ~e_f~0); 1374#L440-1 assume !(0 == ~e_g~0); 1375#L445-1 assume !(0 == ~e_e~0); 1401#L450-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1363#L455-1 assume !(0 == ~e_wl~0); 1364#L460-1 assume !(1 == ~wl_pc~0); 1383#L472 assume !(2 == ~wl_pc~0); 1384#L473 assume !(1 == ~c1_pc~0); 1436#L483 assume !(1 == ~c2_pc~0); 1349#L492 assume !(1 == ~wb_pc~0); 1400#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1381#L510-1 assume !(1 == ~e_e~0); 1367#L515-1 assume !(1 == ~e_f~0); 1346#L520-1 assume !(1 == ~e_g~0); 1347#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1402#L530-1 assume !(1 == ~e_wl~0); 1344#L672-1 [2021-12-15 17:21:25,560 INFO L793 eck$LassoCheckResult]: Loop: 1344#L672-1 assume !false; 1332#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1323#L377 assume !false; 1327#L295 assume !(0 == ~wl_st~0); 1329#L299 assume !(0 == ~c1_st~0); 1393#L302 assume !(0 == ~c2_st~0); 1420#L305 assume !(0 == ~wb_st~0); 1339#L308 assume !(0 == ~r_st~0); 1340#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1362#L548 assume !(1 == ~c_req_up~0); 1337#L548-2 start_simulation_~kernel_st~0#1 := 3; 1338#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1370#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1356#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1357#L570-1 assume !(0 == ~e_c~0); 1443#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1474#L580-1 assume 1 == ~wl_pc~0; 1472#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1469#L593 assume !(1 == ~c1_pc~0); 1468#L603 assume !(1 == ~c2_pc~0); 1466#L612 assume !(1 == ~wb_pc~0); 1464#L621 assume !(1 == ~e_c~0); 1463#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1462#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1444#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1445#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1341#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1342#L655-1 assume 0 == ~wl_st~0; 1344#L672-1 [2021-12-15 17:21:25,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,560 INFO L85 PathProgramCache]: Analyzing trace with hash 785152729, now seen corresponding path program 1 times [2021-12-15 17:21:25,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567503233] [2021-12-15 17:21:25,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,584 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:21:25,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567503233] [2021-12-15 17:21:25,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567503233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:21:25,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276944508] [2021-12-15 17:21:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,586 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 1 times [2021-12-15 17:21:25,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456687876] [2021-12-15 17:21:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,587 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,602 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:21:25,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456687876] [2021-12-15 17:21:25,602 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456687876] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731786543] [2021-12-15 17:21:25,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,603 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-15 17:21:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-15 17:21:25,604 INFO L87 Difference]: Start difference. First operand 156 states and 274 transitions. cyclomatic complexity: 119 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,711 INFO L93 Difference]: Finished difference Result 285 states and 492 transitions. [2021-12-15 17:21:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-15 17:21:25,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 492 transitions. [2021-12-15 17:21:25,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2021-12-15 17:21:25,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 492 transitions. [2021-12-15 17:21:25,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 285 [2021-12-15 17:21:25,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2021-12-15 17:21:25,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 492 transitions. [2021-12-15 17:21:25,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,724 INFO L681 BuchiCegarLoop]: Abstraction has 285 states and 492 transitions. [2021-12-15 17:21:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 492 transitions. [2021-12-15 17:21:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 273. [2021-12-15 17:21:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 273 states have (on average 1.7362637362637363) internal successors, (474), 272 states have internal predecessors, (474), 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:21:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 474 transitions. [2021-12-15 17:21:25,745 INFO L704 BuchiCegarLoop]: Abstraction has 273 states and 474 transitions. [2021-12-15 17:21:25,745 INFO L587 BuchiCegarLoop]: Abstraction has 273 states and 474 transitions. [2021-12-15 17:21:25,745 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:21:25,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 273 states and 474 transitions. [2021-12-15 17:21:25,746 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 199 [2021-12-15 17:21:25,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,747 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] [2021-12-15 17:21:25,747 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] [2021-12-15 17:21:25,748 INFO L791 eck$LassoCheckResult]: Stem: 1909#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1851#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 1852#L404 assume !(1 == ~c_req_up~0); 1887#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1819#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1820#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1897#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1898#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1912#L435-1 assume !(0 == ~e_f~0); 1826#L440-1 assume !(0 == ~e_g~0); 1827#L445-1 assume !(0 == ~e_e~0); 1858#L450-1 assume !(0 == ~e_c~0); 1859#L455-1 assume !(0 == ~e_wl~0); 2007#L460-1 assume !(1 == ~wl_pc~0); 2005#L472 assume !(2 == ~wl_pc~0); 2003#L473 assume !(1 == ~c1_pc~0); 1903#L483 assume !(1 == ~c2_pc~0); 1800#L492 assume !(1 == ~wb_pc~0); 1850#L501 assume 1 == ~e_c~0;~r_st~0 := 0; 1833#L510-1 assume !(1 == ~e_e~0); 1816#L515-1 assume !(1 == ~e_f~0); 1797#L520-1 assume !(1 == ~e_g~0); 1798#L525-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1855#L530-1 assume !(1 == ~e_wl~0); 1795#L672-1 [2021-12-15 17:21:25,748 INFO L793 eck$LassoCheckResult]: Loop: 1795#L672-1 assume !false; 1882#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 1964#L377 assume !false; 1963#L295 assume !(0 == ~wl_st~0); 1962#L299 assume !(0 == ~c1_st~0); 1961#L302 assume !(0 == ~c2_st~0); 1960#L305 assume !(0 == ~wb_st~0); 1958#L308 assume !(0 == ~r_st~0); 1957#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1881#L548 assume !(1 == ~c_req_up~0); 1788#L548-2 start_simulation_~kernel_st~0#1 := 3; 1789#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 1953#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 1995#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1994#L570-1 assume !(0 == ~e_c~0); 1927#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1993#L580-1 assume 1 == ~wl_pc~0; 1991#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1988#L593 assume !(1 == ~c1_pc~0); 1908#L603 assume !(1 == ~c2_pc~0); 1772#L612 assume !(1 == ~wb_pc~0); 1774#L621 assume !(1 == ~e_c~0); 1874#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1875#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1914#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1922#L645-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1792#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1793#L655-1 assume 0 == ~wl_st~0; 1795#L672-1 [2021-12-15 17:21:25,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,748 INFO L85 PathProgramCache]: Analyzing trace with hash 198346715, now seen corresponding path program 1 times [2021-12-15 17:21:25,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689478223] [2021-12-15 17:21:25,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,788 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:21:25,788 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689478223] [2021-12-15 17:21:25,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689478223] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,789 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040407614] [2021-12-15 17:21:25,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,790 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1473620493, now seen corresponding path program 2 times [2021-12-15 17:21:25,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143487737] [2021-12-15 17:21:25,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,817 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:21:25,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143487737] [2021-12-15 17:21:25,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143487737] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,818 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,818 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:25,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613954081] [2021-12-15 17:21:25,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,819 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:25,819 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:25,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:25,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:25,820 INFO L87 Difference]: Start difference. First operand 273 states and 474 transitions. cyclomatic complexity: 203 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-15 17:21:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:25,849 INFO L93 Difference]: Finished difference Result 369 states and 630 transitions. [2021-12-15 17:21:25,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:25,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 369 states and 630 transitions. [2021-12-15 17:21:25,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2021-12-15 17:21:25,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 369 states to 369 states and 630 transitions. [2021-12-15 17:21:25,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2021-12-15 17:21:25,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2021-12-15 17:21:25,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 369 states and 630 transitions. [2021-12-15 17:21:25,857 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:25,857 INFO L681 BuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2021-12-15 17:21:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states and 630 transitions. [2021-12-15 17:21:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2021-12-15 17:21:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 369 states have (on average 1.7073170731707317) internal successors, (630), 368 states have internal predecessors, (630), 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:21:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 630 transitions. [2021-12-15 17:21:25,870 INFO L704 BuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2021-12-15 17:21:25,870 INFO L587 BuchiCegarLoop]: Abstraction has 369 states and 630 transitions. [2021-12-15 17:21:25,870 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:21:25,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 630 transitions. [2021-12-15 17:21:25,872 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 292 [2021-12-15 17:21:25,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:25,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:25,875 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] [2021-12-15 17:21:25,875 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] [2021-12-15 17:21:25,876 INFO L791 eck$LassoCheckResult]: Stem: 2562#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(11, 2);call #Ultimate.allocInit(12, 3);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~0#1;havoc main_~__retres1~0#1;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;assume { :begin_inline_start_simulation } true;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~kernel_st~0#1;start_simulation_~kernel_st~0#1 := 0; 2503#L404 assume !(1 == ~c_req_up~0); 2529#L404-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2530#L415-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2518#L420-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2519#L425-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2498#L430-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2499#L435-1 assume !(0 == ~e_f~0); 2477#L440-1 assume !(0 == ~e_g~0); 2478#L445-1 assume !(0 == ~e_e~0); 2511#L450-1 assume !(0 == ~e_c~0); 2464#L455-1 assume !(0 == ~e_wl~0); 2465#L460-1 assume !(1 == ~wl_pc~0); 2487#L472 assume !(2 == ~wl_pc~0); 2488#L473 assume !(1 == ~c1_pc~0); 2556#L483 assume !(1 == ~c2_pc~0); 2450#L492 assume !(1 == ~wb_pc~0); 2505#L501 assume !(1 == ~e_c~0); 2522#L510-1 assume !(1 == ~e_e~0); 2468#L515-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2447#L520-1 assume !(1 == ~e_g~0); 2448#L525-1 assume !(1 == ~e_c~0); 2508#L530-1 assume !(1 == ~e_wl~0); 2728#L672-1 [2021-12-15 17:21:25,877 INFO L793 eck$LassoCheckResult]: Loop: 2728#L672-1 assume !false; 2723#L542 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~nondet4#1, eval_#t~nondet5#1, eval_#t~nondet6#1, eval_#t~nondet7#1, eval_#t~nondet8#1, eval_~tmp~0#1, eval_~tmp___0~0#1, eval_~tmp___1~0#1, eval_~tmp___2~0#1, eval_~tmp___3~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;havoc eval_~tmp___1~0#1;havoc eval_~tmp___2~0#1;havoc eval_~tmp___3~0#1; 2722#L377 assume !false; 2721#L295 assume !(0 == ~wl_st~0); 2720#L299 assume !(0 == ~c1_st~0); 2719#L302 assume !(0 == ~c2_st~0); 2718#L305 assume !(0 == ~wb_st~0); 2439#L308 assume !(0 == ~r_st~0); 2441#L393 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 2463#L548 assume !(1 == ~c_req_up~0); 2437#L548-2 start_simulation_~kernel_st~0#1 := 3; 2438#L560 assume 0 == ~e_f~0;~e_f~0 := 1; 2553#L560-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2457#L565-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2458#L570-1 assume !(0 == ~e_c~0); 2493#L575-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2494#L580-1 assume 1 == ~wl_pc~0; 2555#L586 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2460#L593 assume !(1 == ~c1_pc~0); 2517#L603 assume !(1 == ~c2_pc~0); 2501#L612 assume !(1 == ~wb_pc~0); 2751#L621 assume !(1 == ~e_c~0); 2745#L630-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2743#L635-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2565#L640-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2742#L645-1 assume !(1 == ~e_c~0); 2601#L650-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2739#L655-1 assume 0 == ~wl_st~0; 2728#L672-1 [2021-12-15 17:21:25,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,878 INFO L85 PathProgramCache]: Analyzing trace with hash 255545497, now seen corresponding path program 1 times [2021-12-15 17:21:25,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92156256] [2021-12-15 17:21:25,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:25,930 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:21:25,931 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92156256] [2021-12-15 17:21:25,931 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92156256] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:25,931 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:25,932 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-15 17:21:25,932 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868745241] [2021-12-15 17:21:25,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:25,932 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1473618571, now seen corresponding path program 1 times [2021-12-15 17:21:25,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:25,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063955096] [2021-12-15 17:21:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:25,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:25,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:25,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:25,949 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:26,237 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:818) 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:21:26,241 INFO L158 Benchmark]: Toolchain (without parser) took 2633.39ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 81.1MB in the beginning and 63.3MB in the end (delta: 17.9MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,242 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:21:26,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.39ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 86.5MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,243 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.28ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 84.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,243 INFO L158 Benchmark]: Boogie Preprocessor took 25.35ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,244 INFO L158 Benchmark]: RCFGBuilder took 548.88ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 62.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,244 INFO L158 Benchmark]: BuchiAutomizer took 1711.60ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 62.8MB in the beginning and 63.3MB in the end (delta: -431.3kB). Peak memory consumption was 25.7MB. Max. memory is 16.1GB. [2021-12-15 17:21:26,246 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.18ms. Allocated memory is still 77.6MB. Free memory was 37.1MB in the beginning and 37.0MB in the end (delta: 36.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.39ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 86.5MB in the end (delta: -5.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.28ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 84.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.35ms. Allocated memory is still 115.3MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.88ms. Allocated memory is still 115.3MB. Free memory was 82.3MB in the beginning and 62.8MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 1711.60ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 62.8MB in the beginning and 63.3MB in the end (delta: -431.3kB). Peak memory consumption was 25.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:21:26,281 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