./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy.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/toy.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:21:21,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:21:21,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:21:21,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:21:21,083 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:21:21,084 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:21:21,085 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:21:21,086 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:21:21,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:21:21,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:21:21,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:21:21,090 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:21:21,090 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:21:21,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:21:21,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:21:21,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:21:21,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:21:21,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:21:21,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:21:21,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:21:21,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:21:21,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:21:21,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:21:21,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:21:21,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:21:21,102 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:21:21,102 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:21:21,102 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:21:21,103 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:21:21,103 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:21:21,104 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:21:21,104 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:21:21,105 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:21:21,105 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:21:21,106 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:21:21,106 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:21:21,107 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:21:21,107 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:21:21,107 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:21:21,108 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:21:21,108 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:21:21,109 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:21,130 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:21:21,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:21:21,132 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:21:21,133 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:21:21,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:21:21,134 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:21:21,134 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:21:21,134 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:21:21,134 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:21:21,134 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:21:21,135 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:21:21,135 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:21:21,135 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:21:21,135 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:21:21,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:21:21,137 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:21:21,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:21:21,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:21:21,138 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:21:21,138 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:21:21,139 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:21:21,139 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2021-12-15 17:21:21,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:21:21,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:21:21,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:21:21,366 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:21:21,367 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:21:21,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2021-12-15 17:21:21,421 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79faaf37/ea7d7f091a784f33a65f010367a8ca24/FLAG6a5a99a6d [2021-12-15 17:21:21,764 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:21:21,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2021-12-15 17:21:21,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79faaf37/ea7d7f091a784f33a65f010367a8ca24/FLAG6a5a99a6d [2021-12-15 17:21:22,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d79faaf37/ea7d7f091a784f33a65f010367a8ca24 [2021-12-15 17:21:22,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:21:22,185 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:21:22,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:22,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:21:22,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:21:22,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3364394c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22, skipping insertion in model container [2021-12-15 17:21:22,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:21:22,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:21:22,335 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/toy.cil.c[697,710] [2021-12-15 17:21:22,399 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:22,410 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:21:22,419 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/toy.cil.c[697,710] [2021-12-15 17:21:22,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:21:22,486 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:21:22,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22 WrapperNode [2021-12-15 17:21:22,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:21:22,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:22,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:21:22,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:21:22,494 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:22" (1/1) ... [2021-12-15 17:21:22,512 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:22" (1/1) ... [2021-12-15 17:21:22,532 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 357 [2021-12-15 17:21:22,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:21:22,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:21:22,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:21:22,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:21:22,540 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:22" (1/1) ... [2021-12-15 17:21:22,540 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:22" (1/1) ... [2021-12-15 17:21:22,542 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:22" (1/1) ... [2021-12-15 17:21:22,542 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:22" (1/1) ... [2021-12-15 17:21:22,546 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:22" (1/1) ... [2021-12-15 17:21:22,551 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:22" (1/1) ... [2021-12-15 17:21:22,553 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:22" (1/1) ... [2021-12-15 17:21:22,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:21:22,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:21:22,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:21:22,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:21:22,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (1/1) ... [2021-12-15 17:21:22,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:21:22,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:21:22,594 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:22,596 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:22,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:21:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:21:22,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:21:22,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:21:22,682 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:21:22,683 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:21:22,962 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:21:22,980 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:21:22,981 INFO L301 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-15 17:21:22,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:22 BoogieIcfgContainer [2021-12-15 17:21:22,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:21:22,983 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:21:22,983 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:21:22,985 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:21:22,986 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:22,986 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:21:22" (1/3) ... [2021-12-15 17:21:22,987 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@583ee18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:22, skipping insertion in model container [2021-12-15 17:21:22,987 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:22,987 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:21:22" (2/3) ... [2021-12-15 17:21:22,988 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@583ee18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:21:22, skipping insertion in model container [2021-12-15 17:21:22,988 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:21:22,988 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:21:22" (3/3) ... [2021-12-15 17:21:22,989 INFO L388 chiAutomizerObserver]: Analyzing ICFG toy.cil.c [2021-12-15 17:21:23,015 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:21:23,016 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:21:23,016 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:21:23,016 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:21:23,016 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:21:23,016 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:21:23,016 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:21:23,017 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:21:23,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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:23,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-15 17:21:23,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,048 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:23,048 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:23,048 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:21:23,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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:23,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 96 [2021-12-15 17:21:23,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,054 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:23,054 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:23,059 INFO L791 eck$LassoCheckResult]: Stem: 118#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(10, 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; 37#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; 104#L408true assume !(1 == ~c_req_up~0); 89#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 127#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 125#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 63#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 120#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 42#L439-1true assume !(0 == ~e_f~0); 6#L444-1true assume !(0 == ~e_g~0); 100#L449-1true assume !(0 == ~e_e~0); 56#L454-1true assume !(0 == ~e_c~0); 109#L459-1true assume !(0 == ~e_wl~0); 24#L464-1true assume !(1 == ~wl_pc~0); 41#L476true assume !(2 == ~wl_pc~0); 23#L477true assume !(1 == ~c1_pc~0); 17#L487true assume !(1 == ~c2_pc~0); 91#L496true assume !(1 == ~wb_pc~0); 28#L505true assume !(1 == ~e_c~0); 34#L514-1true assume !(1 == ~e_e~0); 133#L519-1true assume !(1 == ~e_f~0); 38#L524-1true assume !(1 == ~e_g~0); 131#L529-1true assume !(1 == ~e_c~0); 3#L534-1true assume !(1 == ~e_wl~0); 5#L676-1true [2021-12-15 17:21:23,059 INFO L793 eck$LassoCheckResult]: Loop: 5#L676-1true assume !false; 33#L546true 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; 74#L381true assume !true; 126#L397true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 40#L552true assume !(1 == ~c_req_up~0); 62#L552-2true start_simulation_~kernel_st~0#1 := 3; 13#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 16#L564-2true assume !(0 == ~e_g~0); 7#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 130#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 11#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 98#L584-1true assume 1 == ~wl_pc~0; 49#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 112#L597true assume !(1 == ~c1_pc~0); 26#L607true assume !(1 == ~c2_pc~0); 102#L616true assume !(1 == ~wb_pc~0); 122#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 61#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 55#L639-1true assume !(1 == ~e_f~0); 115#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 81#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 39#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 21#L659-1true assume 0 == ~wl_st~0; 5#L676-1true [2021-12-15 17:21:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2021-12-15 17:21:23,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958430090] [2021-12-15 17:21:23,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,191 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:23,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958430090] [2021-12-15 17:21:23,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958430090] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820067203] [2021-12-15 17:21:23,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,197 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:23,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash 672584946, now seen corresponding path program 1 times [2021-12-15 17:21:23,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395312839] [2021-12-15 17:21:23,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,198 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,207 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:23,207 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395312839] [2021-12-15 17:21:23,208 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395312839] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,208 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,208 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:21:23,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961823944] [2021-12-15 17:21:23,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,209 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:23,209 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:23,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-15 17:21:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-15 17:21:23,230 INFO L87 Difference]: Start difference. First operand has 131 states, 130 states have (on average 1.8307692307692307) internal successors, (238), 130 states have internal predecessors, (238), 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:23,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:23,242 INFO L93 Difference]: Finished difference Result 130 states and 224 transitions. [2021-12-15 17:21:23,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-15 17:21:23,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 224 transitions. [2021-12-15 17:21:23,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 125 states and 219 transitions. [2021-12-15 17:21:23,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:21:23,253 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:21:23,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 219 transitions. [2021-12-15 17:21:23,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:23,254 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-15 17:21:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 219 transitions. [2021-12-15 17:21:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:21:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.752) internal successors, (219), 124 states have internal predecessors, (219), 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:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 219 transitions. [2021-12-15 17:21:23,275 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-15 17:21:23,275 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 219 transitions. [2021-12-15 17:21:23,276 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:21:23,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 219 transitions. [2021-12-15 17:21:23,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,278 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:23,278 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:23,279 INFO L791 eck$LassoCheckResult]: Stem: 391#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 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; 337#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; 338#L408 assume !(1 == ~c_req_up~0); 302#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 384#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 393#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 366#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 367#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 346#L439-1 assume !(0 == ~e_f~0); 273#L444-1 assume !(0 == ~e_g~0); 274#L449-1 assume !(0 == ~e_e~0); 362#L454-1 assume !(0 == ~e_c~0); 363#L459-1 assume !(0 == ~e_wl~0); 309#L464-1 assume !(1 == ~wl_pc~0); 310#L476 assume !(2 == ~wl_pc~0); 307#L477 assume !(1 == ~c1_pc~0); 295#L487 assume !(1 == ~c2_pc~0); 297#L496 assume !(1 == ~wb_pc~0); 321#L505 assume !(1 == ~e_c~0); 322#L514-1 assume !(1 == ~e_e~0); 333#L519-1 assume !(1 == ~e_f~0); 340#L524-1 assume !(1 == ~e_g~0); 341#L529-1 assume !(1 == ~e_c~0); 270#L534-1 assume !(1 == ~e_wl~0); 271#L676-1 [2021-12-15 17:21:23,279 INFO L793 eck$LassoCheckResult]: Loop: 271#L676-1 assume !false; 272#L546 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; 294#L381 assume !false; 334#L299 assume !(0 == ~wl_st~0); 335#L303 assume !(0 == ~c1_st~0); 392#L306 assume !(0 == ~c2_st~0); 386#L309 assume !(0 == ~wb_st~0); 387#L312 assume !(0 == ~r_st~0); 394#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 342#L552 assume !(1 == ~c_req_up~0); 343#L552-2 start_simulation_~kernel_st~0#1 := 3; 290#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 291#L564-2 assume !(0 == ~e_g~0); 275#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 276#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 285#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 286#L584-1 assume 1 == ~wl_pc~0; 355#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 352#L597 assume !(1 == ~c1_pc~0); 315#L607 assume !(1 == ~c2_pc~0); 316#L616 assume !(1 == ~wb_pc~0); 375#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 365#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 360#L639-1 assume !(1 == ~e_f~0); 361#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 376#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 339#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 303#L659-1 assume 0 == ~wl_st~0; 271#L676-1 [2021-12-15 17:21:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2021-12-15 17:21:23,280 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642668215] [2021-12-15 17:21:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,316 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:23,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642668215] [2021-12-15 17:21:23,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642668215] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183376405] [2021-12-15 17:21:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,317 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 1 times [2021-12-15 17:21:23,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851878297] [2021-12-15 17:21:23,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,360 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:23,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851878297] [2021-12-15 17:21:23,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851878297] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462138291] [2021-12-15 17:21:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,361 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:23,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:23,362 INFO L87 Difference]: Start difference. First operand 125 states and 219 transitions. cyclomatic complexity: 95 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:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:23,384 INFO L93 Difference]: Finished difference Result 125 states and 218 transitions. [2021-12-15 17:21:23,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:23,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 218 transitions. [2021-12-15 17:21:23,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 218 transitions. [2021-12-15 17:21:23,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:21:23,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:21:23,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 218 transitions. [2021-12-15 17:21:23,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:23,416 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-15 17:21:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 218 transitions. [2021-12-15 17:21:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:21:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.744) internal successors, (218), 124 states have internal predecessors, (218), 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:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 218 transitions. [2021-12-15 17:21:23,425 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-15 17:21:23,425 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 218 transitions. [2021-12-15 17:21:23,425 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:21:23,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 218 transitions. [2021-12-15 17:21:23,426 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,429 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:23,429 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:23,430 INFO L791 eck$LassoCheckResult]: Stem: 648#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(10, 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; 594#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; 595#L408 assume !(1 == ~c_req_up~0); 559#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 641#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 650#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 623#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 624#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 603#L439-1 assume !(0 == ~e_f~0); 530#L444-1 assume !(0 == ~e_g~0); 531#L449-1 assume !(0 == ~e_e~0); 619#L454-1 assume !(0 == ~e_c~0); 620#L459-1 assume !(0 == ~e_wl~0); 566#L464-1 assume !(1 == ~wl_pc~0); 567#L476 assume !(2 == ~wl_pc~0); 564#L477 assume !(1 == ~c1_pc~0); 552#L487 assume !(1 == ~c2_pc~0); 554#L496 assume !(1 == ~wb_pc~0); 578#L505 assume !(1 == ~e_c~0); 579#L514-1 assume !(1 == ~e_e~0); 590#L519-1 assume !(1 == ~e_f~0); 597#L524-1 assume !(1 == ~e_g~0); 598#L529-1 assume !(1 == ~e_c~0); 527#L534-1 assume !(1 == ~e_wl~0); 528#L676-1 [2021-12-15 17:21:23,430 INFO L793 eck$LassoCheckResult]: Loop: 528#L676-1 assume !false; 529#L546 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; 551#L381 assume !false; 591#L299 assume !(0 == ~wl_st~0); 592#L303 assume !(0 == ~c1_st~0); 649#L306 assume !(0 == ~c2_st~0); 643#L309 assume !(0 == ~wb_st~0); 644#L312 assume !(0 == ~r_st~0); 651#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 599#L552 assume !(1 == ~c_req_up~0); 600#L552-2 start_simulation_~kernel_st~0#1 := 3; 547#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 548#L564-2 assume !(0 == ~e_g~0); 532#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 533#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 542#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 543#L584-1 assume 1 == ~wl_pc~0; 612#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 609#L597 assume !(1 == ~c1_pc~0); 572#L607 assume !(1 == ~c2_pc~0); 573#L616 assume !(1 == ~wb_pc~0); 632#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 622#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 617#L639-1 assume !(1 == ~e_f~0); 618#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 634#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 596#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 560#L659-1 assume 0 == ~wl_st~0; 528#L676-1 [2021-12-15 17:21:23,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2021-12-15 17:21:23,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148897857] [2021-12-15 17:21:23,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,502 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:23,503 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148897857] [2021-12-15 17:21:23,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148897857] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,503 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716065442] [2021-12-15 17:21:23,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,504 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:23,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1073460531, now seen corresponding path program 2 times [2021-12-15 17:21:23,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991069129] [2021-12-15 17:21:23,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,616 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:23,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991069129] [2021-12-15 17:21:23,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991069129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828345658] [2021-12-15 17:21:23,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,617 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:23,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:23,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:23,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:23,619 INFO L87 Difference]: Start difference. First operand 125 states and 218 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:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:23,650 INFO L93 Difference]: Finished difference Result 125 states and 217 transitions. [2021-12-15 17:21:23,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:23,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 217 transitions. [2021-12-15 17:21:23,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 217 transitions. [2021-12-15 17:21:23,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:21:23,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:21:23,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 217 transitions. [2021-12-15 17:21:23,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:23,654 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-15 17:21:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 217 transitions. [2021-12-15 17:21:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:21:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.736) internal successors, (217), 124 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:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 217 transitions. [2021-12-15 17:21:23,672 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-15 17:21:23,672 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 217 transitions. [2021-12-15 17:21:23,672 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:21:23,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 217 transitions. [2021-12-15 17:21:23,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,695 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:23,696 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:23,696 INFO L791 eck$LassoCheckResult]: Stem: 905#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(10, 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; 851#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; 852#L408 assume !(1 == ~c_req_up~0); 816#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 898#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 907#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 880#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 881#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 860#L439-1 assume !(0 == ~e_f~0); 787#L444-1 assume !(0 == ~e_g~0); 788#L449-1 assume !(0 == ~e_e~0); 876#L454-1 assume !(0 == ~e_c~0); 877#L459-1 assume !(0 == ~e_wl~0); 823#L464-1 assume !(1 == ~wl_pc~0); 824#L476 assume !(2 == ~wl_pc~0); 821#L477 assume !(1 == ~c1_pc~0); 809#L487 assume !(1 == ~c2_pc~0); 811#L496 assume !(1 == ~wb_pc~0); 835#L505 assume !(1 == ~e_c~0); 836#L514-1 assume !(1 == ~e_e~0); 847#L519-1 assume !(1 == ~e_f~0); 854#L524-1 assume !(1 == ~e_g~0); 855#L529-1 assume !(1 == ~e_c~0); 784#L534-1 assume !(1 == ~e_wl~0); 785#L676-1 [2021-12-15 17:21:23,696 INFO L793 eck$LassoCheckResult]: Loop: 785#L676-1 assume !false; 786#L546 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; 808#L381 assume !false; 848#L299 assume !(0 == ~wl_st~0); 849#L303 assume !(0 == ~c1_st~0); 906#L306 assume !(0 == ~c2_st~0); 900#L309 assume !(0 == ~wb_st~0); 901#L312 assume !(0 == ~r_st~0); 908#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 856#L552 assume !(1 == ~c_req_up~0); 857#L552-2 start_simulation_~kernel_st~0#1 := 3; 804#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 805#L564-2 assume !(0 == ~e_g~0); 789#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 790#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 799#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 800#L584-1 assume !(1 == ~wl_pc~0); 864#L596 assume !(2 == ~wl_pc~0); 866#L597 assume !(1 == ~c1_pc~0); 829#L607 assume !(1 == ~c2_pc~0); 830#L616 assume !(1 == ~wb_pc~0); 889#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 879#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 874#L639-1 assume !(1 == ~e_f~0); 875#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 891#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 853#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 817#L659-1 assume 0 == ~wl_st~0; 785#L676-1 [2021-12-15 17:21:23,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1738539627, now seen corresponding path program 1 times [2021-12-15 17:21:23,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314416454] [2021-12-15 17:21:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,809 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:23,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314416454] [2021-12-15 17:21:23,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314416454] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,810 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479865729] [2021-12-15 17:21:23,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,810 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 1 times [2021-12-15 17:21:23,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543698474] [2021-12-15 17:21:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:23,861 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:23,861 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:23,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543698474] [2021-12-15 17:21:23,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543698474] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:23,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:23,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:23,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631773768] [2021-12-15 17:21:23,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:23,865 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:23,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:23,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:23,867 INFO L87 Difference]: Start difference. First operand 125 states and 217 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:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:23,901 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2021-12-15 17:21:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:23,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 216 transitions. [2021-12-15 17:21:23,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 216 transitions. [2021-12-15 17:21:23,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2021-12-15 17:21:23,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2021-12-15 17:21:23,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 216 transitions. [2021-12-15 17:21:23,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:23,911 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-15 17:21:23,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 216 transitions. [2021-12-15 17:21:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2021-12-15 17:21:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.728) internal successors, (216), 124 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:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 216 transitions. [2021-12-15 17:21:23,918 INFO L704 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-15 17:21:23,918 INFO L587 BuchiCegarLoop]: Abstraction has 125 states and 216 transitions. [2021-12-15 17:21:23,919 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:21:23,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 216 transitions. [2021-12-15 17:21:23,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2021-12-15 17:21:23,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:23,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:23,932 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:23,932 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:23,932 INFO L791 eck$LassoCheckResult]: Stem: 1162#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(10, 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; 1108#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; 1109#L408 assume !(1 == ~c_req_up~0); 1073#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1155#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1164#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1137#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1138#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1117#L439-1 assume !(0 == ~e_f~0); 1044#L444-1 assume !(0 == ~e_g~0); 1045#L449-1 assume !(0 == ~e_e~0); 1133#L454-1 assume !(0 == ~e_c~0); 1134#L459-1 assume !(0 == ~e_wl~0); 1080#L464-1 assume !(1 == ~wl_pc~0); 1081#L476 assume !(2 == ~wl_pc~0); 1078#L477 assume !(1 == ~c1_pc~0); 1066#L487 assume !(1 == ~c2_pc~0); 1068#L496 assume !(1 == ~wb_pc~0); 1092#L505 assume !(1 == ~e_c~0); 1093#L514-1 assume !(1 == ~e_e~0); 1104#L519-1 assume !(1 == ~e_f~0); 1111#L524-1 assume !(1 == ~e_g~0); 1112#L529-1 assume !(1 == ~e_c~0); 1041#L534-1 assume !(1 == ~e_wl~0); 1042#L676-1 [2021-12-15 17:21:23,932 INFO L793 eck$LassoCheckResult]: Loop: 1042#L676-1 assume !false; 1043#L546 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; 1065#L381 assume !false; 1105#L299 assume !(0 == ~wl_st~0); 1106#L303 assume !(0 == ~c1_st~0); 1163#L306 assume !(0 == ~c2_st~0); 1157#L309 assume !(0 == ~wb_st~0); 1158#L312 assume !(0 == ~r_st~0); 1165#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1113#L552 assume !(1 == ~c_req_up~0); 1114#L552-2 start_simulation_~kernel_st~0#1 := 3; 1061#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1062#L564-2 assume !(0 == ~e_g~0); 1046#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1047#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1056#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1057#L584-1 assume !(1 == ~wl_pc~0); 1121#L596 assume !(2 == ~wl_pc~0); 1123#L597 assume !(1 == ~c1_pc~0); 1086#L607 assume !(1 == ~c2_pc~0); 1087#L616 assume !(1 == ~wb_pc~0); 1146#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1136#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1131#L639-1 assume !(1 == ~e_f~0); 1132#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1148#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1110#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1074#L659-1 assume 0 == ~wl_st~0; 1042#L676-1 [2021-12-15 17:21:23,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:23,933 INFO L85 PathProgramCache]: Analyzing trace with hash 255605079, now seen corresponding path program 1 times [2021-12-15 17:21:23,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:23,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174472890] [2021-12-15 17:21:23,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:23,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,067 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:24,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1622720252, now seen corresponding path program 2 times [2021-12-15 17:21:24,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210288080] [2021-12-15 17:21:24,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,120 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,120 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210288080] [2021-12-15 17:21:24,121 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210288080] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,121 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,121 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,121 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671677006] [2021-12-15 17:21:24,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,122 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:21:24,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:21:24,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:21:24,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:21:24,123 INFO L87 Difference]: Start difference. First operand 125 states and 216 transitions. cyclomatic complexity: 92 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:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:21:24,179 INFO L93 Difference]: Finished difference Result 159 states and 276 transitions. [2021-12-15 17:21:24,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:21:24,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 276 transitions. [2021-12-15 17:21:24,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-15 17:21:24,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 159 states and 276 transitions. [2021-12-15 17:21:24,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2021-12-15 17:21:24,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2021-12-15 17:21:24,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 276 transitions. [2021-12-15 17:21:24,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:21:24,188 INFO L681 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-15 17:21:24,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 276 transitions. [2021-12-15 17:21:24,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2021-12-15 17:21:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 159 states have (on average 1.7358490566037736) internal successors, (276), 158 states have internal predecessors, (276), 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,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 276 transitions. [2021-12-15 17:21:24,197 INFO L704 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-15 17:21:24,197 INFO L587 BuchiCegarLoop]: Abstraction has 159 states and 276 transitions. [2021-12-15 17:21:24,198 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:21:24,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 276 transitions. [2021-12-15 17:21:24,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 111 [2021-12-15 17:21:24,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:21:24,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:21:24,200 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,201 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:24,201 INFO L791 eck$LassoCheckResult]: Stem: 1458#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(10, 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; 1399#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; 1400#L408 assume !(1 == ~c_req_up~0); 1364#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1450#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1461#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 1429#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 1430#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1408#L439-1 assume 0 == ~e_f~0;~e_f~0 := 1; 1334#L444-1 assume !(0 == ~e_g~0); 1335#L449-1 assume !(0 == ~e_e~0); 1425#L454-1 assume !(0 == ~e_c~0); 1426#L459-1 assume !(0 == ~e_wl~0); 1371#L464-1 assume !(1 == ~wl_pc~0); 1372#L476 assume !(2 == ~wl_pc~0); 1369#L477 assume !(1 == ~c1_pc~0); 1357#L487 assume !(1 == ~c2_pc~0); 1359#L496 assume !(1 == ~wb_pc~0); 1383#L505 assume !(1 == ~e_c~0); 1384#L514-1 assume !(1 == ~e_e~0); 1395#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1402#L524-1 assume !(1 == ~e_g~0); 1403#L529-1 assume !(1 == ~e_c~0); 1331#L534-1 assume !(1 == ~e_wl~0); 1332#L676-1 [2021-12-15 17:21:24,202 INFO L793 eck$LassoCheckResult]: Loop: 1332#L676-1 assume !false; 1333#L546 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; 1356#L381 assume !false; 1396#L299 assume !(0 == ~wl_st~0); 1397#L303 assume !(0 == ~c1_st~0); 1460#L306 assume !(0 == ~c2_st~0); 1452#L309 assume !(0 == ~wb_st~0); 1453#L312 assume !(0 == ~r_st~0); 1462#L397 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2; 1404#L552 assume !(1 == ~c_req_up~0); 1405#L552-2 start_simulation_~kernel_st~0#1 := 3; 1351#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 1352#L564-2 assume !(0 == ~e_g~0); 1489#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 1488#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1487#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1486#L584-1 assume 1 == ~wl_pc~0; 1484#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 1482#L597 assume !(1 == ~c1_pc~0); 1442#L607 assume !(1 == ~c2_pc~0); 1436#L616 assume !(1 == ~wb_pc~0); 1479#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1428#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1423#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1424#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 1443#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1401#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1365#L659-1 assume 0 == ~wl_st~0; 1332#L676-1 [2021-12-15 17:21:24,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1276613851, now seen corresponding path program 1 times [2021-12-15 17:21:24,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50168580] [2021-12-15 17:21:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:21:24,253 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,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:21:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50168580] [2021-12-15 17:21:24,254 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50168580] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:21:24,254 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:21:24,254 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:21:24,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840597686] [2021-12-15 17:21:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:21:24,255 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-15 17:21:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:21:24,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1071613489, now seen corresponding path program 1 times [2021-12-15 17:21:24,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:21:24,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031873995] [2021-12-15 17:21:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:21:24,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:21:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,266 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:21:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:21:24,280 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:21:24,607 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:24,628 INFO L158 Benchmark]: Toolchain (without parser) took 2425.41ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.5MB in the beginning and 56.5MB in the end (delta: -7.0MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,628 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:21:24,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.86ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 59.2MB in the end (delta: -9.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,629 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,630 INFO L158 Benchmark]: Boogie Preprocessor took 21.72ms. Allocated memory is still 86.0MB. Free memory was 57.0MB in the beginning and 55.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,636 INFO L158 Benchmark]: RCFGBuilder took 426.73ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 76.2MB in the end (delta: -21.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,638 INFO L158 Benchmark]: BuchiAutomizer took 1627.22ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 56.5MB in the end (delta: 19.2MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2021-12-15 17:21:24,640 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.17ms. Allocated memory is still 86.0MB. Free memory is still 66.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.86ms. Allocated memory is still 86.0MB. Free memory was 49.3MB in the beginning and 59.2MB in the end (delta: -9.9MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 86.0MB. Free memory was 59.2MB in the beginning and 57.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.72ms. Allocated memory is still 86.0MB. Free memory was 57.0MB in the beginning and 55.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.73ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 54.9MB in the beginning and 76.2MB in the end (delta: -21.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 1627.22ms. Allocated memory is still 104.9MB. Free memory was 75.7MB in the beginning and 56.5MB in the end (delta: 19.2MB). Peak memory consumption was 19.4MB. 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:24,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable