./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/pc_sfifo_1.cil-2.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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:21:28,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:21:28,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:21:28,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:21:28,385 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:21:28,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:21:28,389 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:21:28,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:21:28,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:21:28,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:21:28,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:21:28,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:21:28,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:21:28,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:21:28,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:21:28,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:21:28,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:21:28,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:21:28,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:21:28,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:21:28,412 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:21:28,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:21:28,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:21:28,414 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:21:28,416 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:21:28,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:21:28,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:21:28,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:21:28,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:21:28,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:21:28,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:21:28,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:21:28,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:21:28,424 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:21:28,425 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:21:28,425 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:21:28,426 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:21:28,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:21:28,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:21:28,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:21:28,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:21:28,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:21:28,453 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:21:28,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:21:28,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:21:28,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:21:28,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:21:28,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:21:28,456 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:21:28,456 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:21:28,456 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:21:28,456 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:21:28,457 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:21:28,457 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:21:28,457 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:21:28,457 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:21:28,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:21:28,459 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:21:28,459 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:21:28,459 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:21:28,459 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:21:28,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:21:28,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:21:28,460 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:21:28,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:21:28,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:21:28,461 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:21:28,461 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2022-02-21 04:21:28,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:21:28,686 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:21:28,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:21:28,689 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:21:28,690 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:21:28,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-02-21 04:21:28,744 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47636505b/ae810fc96d064f92b4e257f709ac8625/FLAG47893f6d6 [2022-02-21 04:21:29,129 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:21:29,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-02-21 04:21:29,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47636505b/ae810fc96d064f92b4e257f709ac8625/FLAG47893f6d6 [2022-02-21 04:21:29,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47636505b/ae810fc96d064f92b4e257f709ac8625 [2022-02-21 04:21:29,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:21:29,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:21:29,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:29,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:21:29,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:21:29,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5006d9cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29, skipping insertion in model container [2022-02-21 04:21:29,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:21:29,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:21:29,320 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/pc_sfifo_1.cil-2.c[642,655] [2022-02-21 04:21:29,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:29,413 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:21:29,430 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/pc_sfifo_1.cil-2.c[642,655] [2022-02-21 04:21:29,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:29,494 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:21:29,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29 WrapperNode [2022-02-21 04:21:29,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:29,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:29,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:21:29,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:21:29,527 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,544 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,612 INFO L137 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 255 [2022-02-21 04:21:29,613 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:29,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:21:29,614 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:21:29,614 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:21:29,620 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,635 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,658 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:21:29,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:21:29,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:21:29,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:21:29,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (1/1) ... [2022-02-21 04:21:29,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:29,687 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) [2022-02-21 04:21:29,693 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 [2022-02-21 04:21:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:21:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:21:29,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:21:29,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:21:29,825 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:21:29,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:21:30,222 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:21:30,227 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:21:30,229 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-21 04:21:30,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:30 BoogieIcfgContainer [2022-02-21 04:21:30,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:21:30,234 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:21:30,234 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:21:30,237 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:21:30,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:30,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:21:29" (1/3) ... [2022-02-21 04:21:30,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fe805a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:30, skipping insertion in model container [2022-02-21 04:21:30,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:30,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:29" (2/3) ... [2022-02-21 04:21:30,240 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fe805a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:30, skipping insertion in model container [2022-02-21 04:21:30,240 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:30,240 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:30" (3/3) ... [2022-02-21 04:21:30,241 INFO L388 chiAutomizerObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-02-21 04:21:30,284 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:21:30,285 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:21:30,285 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:21:30,285 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:21:30,285 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:21:30,285 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:21:30,285 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:21:30,286 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:21:30,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 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) [2022-02-21 04:21:30,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-02-21 04:21:30,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:30,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:30,344 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,344 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,345 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:21:30,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 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) [2022-02-21 04:21:30,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2022-02-21 04:21:30,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:30,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:30,362 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,363 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,368 INFO L791 eck$LassoCheckResult]: Stem: 60#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 21#L356true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 37#L206true assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; 4#L206-2true assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 45#L211-1true assume { :end_inline_init_threads } true; 68#L323-2true [2022-02-21 04:21:30,370 INFO L793 eck$LassoCheckResult]: Loop: 68#L323-2true assume !false; 16#L324true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 49#L272true assume false; 29#L288true assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 61#L224-1true assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 76#L236-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 11#L237-1true stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 17#L302true assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 19#L309true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 10#L310true start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 55#L330true assume !(0 != start_simulation_~tmp~3#1); 68#L323-2true [2022-02-21 04:21:30,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash 889479019, now seen corresponding path program 1 times [2022-02-21 04:21:30,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639201911] [2022-02-21 04:21:30,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:30,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {83#true} 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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; {83#true} is VALID [2022-02-21 04:21:30,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {83#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {85#(= ~p_dw_i~0 1)} is VALID [2022-02-21 04:21:30,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {85#(= ~p_dw_i~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; {85#(= ~p_dw_i~0 1)} is VALID [2022-02-21 04:21:30,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {85#(= ~p_dw_i~0 1)} assume !(1 == ~p_dw_i~0);~p_dw_st~0 := 2; {84#false} is VALID [2022-02-21 04:21:30,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#false} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {84#false} is VALID [2022-02-21 04:21:30,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#false} assume { :end_inline_init_threads } true; {84#false} is VALID [2022-02-21 04:21:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:30,523 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:30,523 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639201911] [2022-02-21 04:21:30,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639201911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:30,525 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:30,525 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:30,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581191040] [2022-02-21 04:21:30,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:30,532 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:30,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,534 INFO L85 PathProgramCache]: Analyzing trace with hash 740616813, now seen corresponding path program 1 times [2022-02-21 04:21:30,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003002913] [2022-02-21 04:21:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:30,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} assume !false; {86#true} is VALID [2022-02-21 04:21:30,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; {86#true} is VALID [2022-02-21 04:21:30,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} assume false; {87#false} is VALID [2022-02-21 04:21:30,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {87#false} assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {87#false} is VALID [2022-02-21 04:21:30,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {87#false} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {87#false} is VALID [2022-02-21 04:21:30,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {87#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {87#false} is VALID [2022-02-21 04:21:30,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {87#false} stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; {87#false} is VALID [2022-02-21 04:21:30,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {87#false} assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; {87#false} is VALID [2022-02-21 04:21:30,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {87#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {87#false} is VALID [2022-02-21 04:21:30,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {87#false} start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; {87#false} is VALID [2022-02-21 04:21:30,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {87#false} assume !(0 != start_simulation_~tmp~3#1); {87#false} is VALID [2022-02-21 04:21:30,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:30,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:30,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003002913] [2022-02-21 04:21:30,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003002913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:30,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:30,569 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:21:30,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436688759] [2022-02-21 04:21:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:30,570 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:30,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:30,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:30,597 INFO L87 Difference]: Start difference. First operand has 79 states, 78 states have (on average 1.5256410256410255) internal successors, (119), 78 states have internal predecessors, (119), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 04:21:30,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:30,702 INFO L93 Difference]: Finished difference Result 77 states and 106 transitions. [2022-02-21 04:21:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:30,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 04:21:30,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:30,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 106 transitions. [2022-02-21 04:21:30,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:21:30,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 100 transitions. [2022-02-21 04:21:30,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-02-21 04:21:30,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 04:21:30,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 100 transitions. [2022-02-21 04:21:30,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:30,755 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-02-21 04:21:30,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 100 transitions. [2022-02-21 04:21:30,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 04:21:30,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:30,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 100 transitions. Second operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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) [2022-02-21 04:21:30,782 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 100 transitions. Second operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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) [2022-02-21 04:21:30,784 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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) [2022-02-21 04:21:30,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:30,792 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-02-21 04:21:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-02-21 04:21:30,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:30,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:30,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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 71 states and 100 transitions. [2022-02-21 04:21:30,794 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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 71 states and 100 transitions. [2022-02-21 04:21:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:30,799 INFO L93 Difference]: Finished difference Result 71 states and 100 transitions. [2022-02-21 04:21:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2022-02-21 04:21:30,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:30,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:30,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:30,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:30,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.408450704225352) internal successors, (100), 70 states have internal predecessors, (100), 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) [2022-02-21 04:21:30,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2022-02-21 04:21:30,807 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-02-21 04:21:30,807 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 100 transitions. [2022-02-21 04:21:30,807 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:21:30,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 100 transitions. [2022-02-21 04:21:30,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:21:30,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:30,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:30,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,811 INFO L791 eck$LassoCheckResult]: Stem: 230#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 192#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 193#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 171#L206-2 assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; 172#L211-1 assume { :end_inline_init_threads } true; 221#L323-2 [2022-02-21 04:21:30,811 INFO L793 eck$LassoCheckResult]: Loop: 221#L323-2 assume !false; 190#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 174#L272 assume !false; 226#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 185#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 186#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 218#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 219#L252 assume !(0 != eval_~tmp___1~0#1); 205#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 206#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 231#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 181#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 182#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 191#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 179#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 180#L330 assume !(0 != start_simulation_~tmp~3#1); 221#L323-2 [2022-02-21 04:21:30,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,812 INFO L85 PathProgramCache]: Analyzing trace with hash 889477097, now seen corresponding path program 1 times [2022-02-21 04:21:30,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,813 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020293333] [2022-02-21 04:21:30,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:30,861 INFO L290 TraceCheckUtils]: 0: Hoare triple {381#true} 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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; {381#true} is VALID [2022-02-21 04:21:30,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {383#(= 1 ~c_dr_i~0)} is VALID [2022-02-21 04:21:30,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {383#(= 1 ~c_dr_i~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; {383#(= 1 ~c_dr_i~0)} is VALID [2022-02-21 04:21:30,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {383#(= 1 ~c_dr_i~0)} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {383#(= 1 ~c_dr_i~0)} is VALID [2022-02-21 04:21:30,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {383#(= 1 ~c_dr_i~0)} assume !(1 == ~c_dr_i~0);~c_dr_st~0 := 2; {382#false} is VALID [2022-02-21 04:21:30,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {382#false} assume { :end_inline_init_threads } true; {382#false} is VALID [2022-02-21 04:21:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:30,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:30,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020293333] [2022-02-21 04:21:30,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020293333] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:30,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:30,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:30,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396761543] [2022-02-21 04:21:30,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:30,866 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:30,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,872 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 1 times [2022-02-21 04:21:30,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974898589] [2022-02-21 04:21:30,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:30,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#true} assume !false; {384#true} is VALID [2022-02-21 04:21:30,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {384#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; {384#true} is VALID [2022-02-21 04:21:30,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#true} assume !false; {384#true} is VALID [2022-02-21 04:21:30,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {384#true} is VALID [2022-02-21 04:21:30,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#true} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {386#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~2#1|)} is VALID [2022-02-21 04:21:30,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~2#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {387#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:30,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {387#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; {388#(<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)} is VALID [2022-02-21 04:21:30,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {388#(<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)} assume !(0 != eval_~tmp___1~0#1); {385#false} is VALID [2022-02-21 04:21:30,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {385#false} assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {385#false} is VALID [2022-02-21 04:21:30,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {385#false} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {385#false} is VALID [2022-02-21 04:21:30,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {385#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {385#false} is VALID [2022-02-21 04:21:30,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {385#false} stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; {385#false} is VALID [2022-02-21 04:21:30,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {385#false} assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; {385#false} is VALID [2022-02-21 04:21:30,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {385#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {385#false} is VALID [2022-02-21 04:21:30,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {385#false} start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; {385#false} is VALID [2022-02-21 04:21:30,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {385#false} assume !(0 != start_simulation_~tmp~3#1); {385#false} is VALID [2022-02-21 04:21:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:30,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:30,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974898589] [2022-02-21 04:21:30,930 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974898589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:30,930 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:30,930 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:30,930 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390706728] [2022-02-21 04:21:30,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:30,931 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:30,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:30,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:30,932 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 04:21:30,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:30,995 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-02-21 04:21:30,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:30,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2022-02-21 04:21:31,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:31,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:21:31,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 99 transitions. [2022-02-21 04:21:31,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-02-21 04:21:31,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 04:21:31,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:31,005 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-02-21 04:21:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 04:21:31,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:31,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 99 transitions. Second operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:31,016 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 99 transitions. Second operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:31,016 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,018 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-02-21 04:21:31,018 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,032 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states and 99 transitions. [2022-02-21 04:21:31,032 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 71 states and 99 transitions. [2022-02-21 04:21:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,034 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-02-21 04:21:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:31,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 70 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:31,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2022-02-21 04:21:31,036 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-02-21 04:21:31,037 INFO L587 BuchiCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-02-21 04:21:31,037 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:21:31,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 99 transitions. [2022-02-21 04:21:31,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:21:31,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:31,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:31,038 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,038 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,038 INFO L791 eck$LassoCheckResult]: Stem: 525#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 487#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 488#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 460#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 461#L211-1 assume { :end_inline_init_threads } true; 516#L323-2 [2022-02-21 04:21:31,038 INFO L793 eck$LassoCheckResult]: Loop: 516#L323-2 assume !false; 485#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 469#L272 assume !false; 520#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 480#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 481#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 512#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 513#L252 assume !(0 != eval_~tmp___1~0#1); 500#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 501#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 526#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 476#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 477#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 486#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 474#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 475#L330 assume !(0 != start_simulation_~tmp~3#1); 516#L323-2 [2022-02-21 04:21:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 1 times [2022-02-21 04:21:31,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516731479] [2022-02-21 04:21:31,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,077 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,078 INFO L85 PathProgramCache]: Analyzing trace with hash 993904031, now seen corresponding path program 2 times [2022-02-21 04:21:31,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243536029] [2022-02-21 04:21:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:31,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#true} assume !false; {678#true} is VALID [2022-02-21 04:21:31,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; {678#true} is VALID [2022-02-21 04:21:31,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#true} assume !false; {678#true} is VALID [2022-02-21 04:21:31,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {678#true} is VALID [2022-02-21 04:21:31,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#true} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {680#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~2#1|)} is VALID [2022-02-21 04:21:31,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~2#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {681#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:31,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {681#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; {682#(<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)} is VALID [2022-02-21 04:21:31,109 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#(<= 1 |ULTIMATE.start_eval_~tmp___1~0#1|)} assume !(0 != eval_~tmp___1~0#1); {679#false} is VALID [2022-02-21 04:21:31,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#false} assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {679#false} is VALID [2022-02-21 04:21:31,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#false} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {679#false} is VALID [2022-02-21 04:21:31,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {679#false} is VALID [2022-02-21 04:21:31,110 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#false} stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; {679#false} is VALID [2022-02-21 04:21:31,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#false} assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; {679#false} is VALID [2022-02-21 04:21:31,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {679#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {679#false} is VALID [2022-02-21 04:21:31,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {679#false} start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; {679#false} is VALID [2022-02-21 04:21:31,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {679#false} assume !(0 != start_simulation_~tmp~3#1); {679#false} is VALID [2022-02-21 04:21:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:31,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:31,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243536029] [2022-02-21 04:21:31,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243536029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:31,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:31,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:31,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087430768] [2022-02-21 04:21:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:31,112 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:31,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:21:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:21:31,113 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-02-21 04:21:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,360 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2022-02-21 04:21:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:21:31,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-02-21 04:21:31,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:31,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 192 transitions. [2022-02-21 04:21:31,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 133 [2022-02-21 04:21:31,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 139 states and 192 transitions. [2022-02-21 04:21:31,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2022-02-21 04:21:31,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2022-02-21 04:21:31,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 192 transitions. [2022-02-21 04:21:31,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:31,380 INFO L681 BuchiCegarLoop]: Abstraction has 139 states and 192 transitions. [2022-02-21 04:21:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 192 transitions. [2022-02-21 04:21:31,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 74. [2022-02-21 04:21:31,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:31,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 192 transitions. Second operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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) [2022-02-21 04:21:31,383 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 192 transitions. Second operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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) [2022-02-21 04:21:31,383 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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) [2022-02-21 04:21:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,386 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2022-02-21 04:21:31,386 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2022-02-21 04:21:31,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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 139 states and 192 transitions. [2022-02-21 04:21:31,387 INFO L87 Difference]: Start difference. First operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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 139 states and 192 transitions. [2022-02-21 04:21:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,390 INFO L93 Difference]: Finished difference Result 139 states and 192 transitions. [2022-02-21 04:21:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2022-02-21 04:21:31,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:31,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 73 states have internal predecessors, (102), 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) [2022-02-21 04:21:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2022-02-21 04:21:31,393 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-02-21 04:21:31,393 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 102 transitions. [2022-02-21 04:21:31,393 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:21:31,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 102 transitions. [2022-02-21 04:21:31,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 68 [2022-02-21 04:21:31,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:31,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:31,394 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,394 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,394 INFO L791 eck$LassoCheckResult]: Stem: 896#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 858#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 859#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 836#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 837#L211-1 assume { :end_inline_init_threads } true; 887#L323-2 [2022-02-21 04:21:31,394 INFO L793 eck$LassoCheckResult]: Loop: 887#L323-2 assume !false; 855#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 839#L272 assume !false; 891#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 850#L224 assume !(0 == ~p_dw_st~0); 852#L228 assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; 857#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 902#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 903#L252 assume !(0 != eval_~tmp___1~0#1); 871#L288 assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 872#L224-1 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 897#L236-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 846#L237-1 stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; 847#L302 assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; 856#L309 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 844#L310 start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; 845#L330 assume !(0 != start_simulation_~tmp~3#1); 887#L323-2 [2022-02-21 04:21:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 889477035, now seen corresponding path program 2 times [2022-02-21 04:21:31,395 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,395 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214353969] [2022-02-21 04:21:31,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,402 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,409 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1089411781, now seen corresponding path program 1 times [2022-02-21 04:21:31,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066759486] [2022-02-21 04:21:31,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:31,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1187#true} assume !false; {1187#true} is VALID [2022-02-21 04:21:31,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; {1187#true} is VALID [2022-02-21 04:21:31,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume !false; {1187#true} is VALID [2022-02-21 04:21:31,442 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {1187#true} is VALID [2022-02-21 04:21:31,442 INFO L290 TraceCheckUtils]: 4: Hoare triple {1187#true} assume !(0 == ~p_dw_st~0); {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#(not (= ~p_dw_st~0 0))} assume !(0 == ~c_dr_st~0);exists_runnable_thread_~__retres1~2#1 := 0; {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#(not (= ~p_dw_st~0 0))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#(not (= ~p_dw_st~0 0))} eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(not (= ~p_dw_st~0 0))} assume !(0 != eval_~tmp___1~0#1); {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#(not (= ~p_dw_st~0 0))} assume { :end_inline_eval } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret10#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {1189#(not (= ~p_dw_st~0 0))} is VALID [2022-02-21 04:21:31,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(not (= ~p_dw_st~0 0))} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {1188#false} is VALID [2022-02-21 04:21:31,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {1188#false} is VALID [2022-02-21 04:21:31,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {1188#false} stop_simulation_#t~ret10#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret10#1;havoc stop_simulation_#t~ret10#1; {1188#false} is VALID [2022-02-21 04:21:31,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#false} assume !(0 != stop_simulation_~tmp~2#1);stop_simulation_~__retres2~0#1 := 1; {1188#false} is VALID [2022-02-21 04:21:31,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {1188#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {1188#false} is VALID [2022-02-21 04:21:31,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {1188#false} start_simulation_#t~ret11#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret11#1;havoc start_simulation_#t~ret11#1; {1188#false} is VALID [2022-02-21 04:21:31,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {1188#false} assume !(0 != start_simulation_~tmp~3#1); {1188#false} is VALID [2022-02-21 04:21:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:31,445 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:31,445 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066759486] [2022-02-21 04:21:31,446 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066759486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:31,446 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:31,446 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:31,446 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501873214] [2022-02-21 04:21:31,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:31,446 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:31,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:31,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:31,447 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-02-21 04:21:31,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,532 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2022-02-21 04:21:31,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:31,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-02-21 04:21:31,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:31,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 170 transitions. [2022-02-21 04:21:31,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 117 [2022-02-21 04:21:31,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 125 states and 170 transitions. [2022-02-21 04:21:31,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 125 [2022-02-21 04:21:31,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2022-02-21 04:21:31,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 170 transitions. [2022-02-21 04:21:31,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:31,552 INFO L681 BuchiCegarLoop]: Abstraction has 125 states and 170 transitions. [2022-02-21 04:21:31,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 170 transitions. [2022-02-21 04:21:31,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2022-02-21 04:21:31,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:31,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states and 170 transitions. Second operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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) [2022-02-21 04:21:31,555 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states and 170 transitions. Second operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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) [2022-02-21 04:21:31,555 INFO L87 Difference]: Start difference. First operand 125 states and 170 transitions. Second operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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) [2022-02-21 04:21:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,558 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2022-02-21 04:21:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 170 transitions. [2022-02-21 04:21:31,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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 125 states and 170 transitions. [2022-02-21 04:21:31,559 INFO L87 Difference]: Start difference. First operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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 125 states and 170 transitions. [2022-02-21 04:21:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,561 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2022-02-21 04:21:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 170 transitions. [2022-02-21 04:21:31,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:31,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:31,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.3518518518518519) internal successors, (146), 107 states have internal predecessors, (146), 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) [2022-02-21 04:21:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2022-02-21 04:21:31,563 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2022-02-21 04:21:31,563 INFO L587 BuchiCegarLoop]: Abstraction has 108 states and 146 transitions. [2022-02-21 04:21:31,564 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:21:31,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 146 transitions. [2022-02-21 04:21:31,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 100 [2022-02-21 04:21:31,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:31,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:31,565 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,565 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,565 INFO L791 eck$LassoCheckResult]: Stem: 1386#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1344#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1345#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1319#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1320#L211-1 assume { :end_inline_init_threads } true; 1373#L323-2 assume !false; 1405#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1401#L272 [2022-02-21 04:21:31,565 INFO L793 eck$LassoCheckResult]: Loop: 1401#L272 assume !false; 1400#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1399#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1398#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1397#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1383#L252 assume 0 != eval_~tmp___1~0#1; 1384#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1393#L261 assume !(0 != eval_~tmp~1#1); 1394#L257 assume !(0 == ~c_dr_st~0); 1401#L272 [2022-02-21 04:21:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 1 times [2022-02-21 04:21:31,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923427985] [2022-02-21 04:21:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,572 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,578 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1880932388, now seen corresponding path program 1 times [2022-02-21 04:21:31,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,579 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915918340] [2022-02-21 04:21:31,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,588 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118888, now seen corresponding path program 1 times [2022-02-21 04:21:31,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935345924] [2022-02-21 04:21:31,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:31,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {1680#true} 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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; {1680#true} is VALID [2022-02-21 04:21:31,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; {1680#true} is VALID [2022-02-21 04:21:31,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; {1680#true} is VALID [2022-02-21 04:21:31,608 INFO L290 TraceCheckUtils]: 3: Hoare triple {1680#true} assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; {1680#true} is VALID [2022-02-21 04:21:31,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {1680#true} assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {1682#(= ~c_dr_st~0 0)} assume { :end_inline_init_threads } true; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {1682#(= ~c_dr_st~0 0)} assume !false; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {1682#(= ~c_dr_st~0 0)} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {1682#(= ~c_dr_st~0 0)} assume !false; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {1682#(= ~c_dr_st~0 0)} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(= ~c_dr_st~0 0)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {1682#(= ~c_dr_st~0 0)} eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(= ~c_dr_st~0 0)} assume 0 != eval_~tmp___1~0#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1682#(= ~c_dr_st~0 0)} assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {1682#(= ~c_dr_st~0 0)} assume !(0 != eval_~tmp~1#1); {1682#(= ~c_dr_st~0 0)} is VALID [2022-02-21 04:21:31,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {1682#(= ~c_dr_st~0 0)} assume !(0 == ~c_dr_st~0); {1681#false} is VALID [2022-02-21 04:21:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:21:31,612 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:31,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935345924] [2022-02-21 04:21:31,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935345924] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:31,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:31,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:21:31,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416018211] [2022-02-21 04:21:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:31,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:31,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:31,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:31,661 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. cyclomatic complexity: 39 Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-02-21 04:21:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,748 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2022-02-21 04:21:31,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:31,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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) [2022-02-21 04:21:31,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:31,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 254 transitions. [2022-02-21 04:21:31,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 181 [2022-02-21 04:21:31,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 254 transitions. [2022-02-21 04:21:31,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2022-02-21 04:21:31,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-02-21 04:21:31,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 254 transitions. [2022-02-21 04:21:31,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:31,768 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 254 transitions. [2022-02-21 04:21:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 254 transitions. [2022-02-21 04:21:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 151. [2022-02-21 04:21:31,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:31,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states and 254 transitions. Second operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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) [2022-02-21 04:21:31,772 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states and 254 transitions. Second operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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) [2022-02-21 04:21:31,773 INFO L87 Difference]: Start difference. First operand 189 states and 254 transitions. Second operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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) [2022-02-21 04:21:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,776 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2022-02-21 04:21:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2022-02-21 04:21:31,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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 189 states and 254 transitions. [2022-02-21 04:21:31,777 INFO L87 Difference]: Start difference. First operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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 189 states and 254 transitions. [2022-02-21 04:21:31,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:31,781 INFO L93 Difference]: Finished difference Result 189 states and 254 transitions. [2022-02-21 04:21:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2022-02-21 04:21:31,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:31,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:31,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:31,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:31,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 150 states have internal predecessors, (202), 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) [2022-02-21 04:21:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2022-02-21 04:21:31,784 INFO L704 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-02-21 04:21:31,784 INFO L587 BuchiCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-02-21 04:21:31,784 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:21:31,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 202 transitions. [2022-02-21 04:21:31,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2022-02-21 04:21:31,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:31,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:31,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:31,786 INFO L791 eck$LassoCheckResult]: Stem: 1944#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(19, 2);call #Ultimate.allocInit(12, 3);~q_buf_0~0 := 0;~q_free~0 := 0;~q_read_ev~0 := 0;~q_write_ev~0 := 0;~p_num_write~0 := 0;~p_last_write~0 := 0;~p_dw_st~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 0;~c_num_read~0 := 0;~c_last_read~0 := 0;~c_dr_st~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 0;~a_t~0 := 0; 1930#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~3#1;havoc main_~__retres1~3#1;assume { :begin_inline_init_model } true;~q_free~0 := 1;~q_write_ev~0 := 2;~q_read_ev~0 := ~q_write_ev~0;~p_num_write~0 := 0;~p_dw_pc~0 := 0;~p_dw_i~0 := 1;~c_num_read~0 := 0;~c_dr_pc~0 := 0;~c_dr_i~0 := 1; 1901#L356 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret11#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_init_threads } true; 1902#L206 assume 1 == ~p_dw_i~0;~p_dw_st~0 := 0; 1879#L206-2 assume 1 == ~c_dr_i~0;~c_dr_st~0 := 0; 1880#L211-1 assume { :end_inline_init_threads } true; 1931#L323-2 assume !false; 1982#L324 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret7#1, eval_#t~nondet8#1, eval_#t~nondet9#1, eval_~tmp~1#1, eval_~tmp___0~1#1, eval_~tmp___1~0#1;havoc eval_~tmp~1#1;havoc eval_~tmp___0~1#1;havoc eval_~tmp___1~0#1; 1979#L272 [2022-02-21 04:21:31,786 INFO L793 eck$LassoCheckResult]: Loop: 1979#L272 assume !false; 1977#L248 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~2#1;havoc exists_runnable_thread_~__retres1~2#1; 1974#L224 assume 0 == ~p_dw_st~0;exists_runnable_thread_~__retres1~2#1 := 1; 1975#L236 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~2#1; 1970#L237 eval_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___1~0#1 := eval_#t~ret7#1;havoc eval_#t~ret7#1; 1971#L252 assume 0 != eval_~tmp___1~0#1; 1966#L252-1 assume 0 == ~p_dw_st~0;eval_~tmp~1#1 := eval_#t~nondet8#1;havoc eval_#t~nondet8#1; 1967#L261 assume !(0 != eval_~tmp~1#1); 1983#L257 assume 0 == ~c_dr_st~0;eval_~tmp___0~1#1 := eval_#t~nondet9#1;havoc eval_#t~nondet9#1; 1980#L276 assume !(0 != eval_~tmp___0~1#1); 1979#L272 [2022-02-21 04:21:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,787 INFO L85 PathProgramCache]: Analyzing trace with hash 88939597, now seen corresponding path program 2 times [2022-02-21 04:21:31,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790759924] [2022-02-21 04:21:31,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,792 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,798 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1820641234, now seen corresponding path program 1 times [2022-02-21 04:21:31,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80948003] [2022-02-21 04:21:31,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,803 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,807 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:31,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:31,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1408918906, now seen corresponding path program 1 times [2022-02-21 04:21:31,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:31,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860431874] [2022-02-21 04:21:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:31,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:31,827 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:32,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:21:32 BoogieIcfgContainer [2022-02-21 04:21:32,217 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:21:32,217 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:21:32,217 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:21:32,217 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:21:32,218 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:30" (3/4) ... [2022-02-21 04:21:32,219 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:21:32,245 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:21:32,245 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:21:32,246 INFO L158 Benchmark]: Toolchain (without parser) took 3094.17ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 79.2MB in the beginning and 108.5MB in the end (delta: -29.4MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,246 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:21:32,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.75ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 78.9MB in the beginning and 127.8MB in the end (delta: -48.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.58ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,247 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 123.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:21:32,247 INFO L158 Benchmark]: RCFGBuilder took 574.63ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 107.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,248 INFO L158 Benchmark]: BuchiAutomizer took 1982.92ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 110.6MB in the end (delta: -2.9MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,248 INFO L158 Benchmark]: Witness Printer took 28.20ms. Allocated memory is still 155.2MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:21:32,249 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.75ms. Allocated memory was 109.1MB in the beginning and 155.2MB in the end (delta: 46.1MB). Free memory was 78.9MB in the beginning and 127.8MB in the end (delta: -48.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.58ms. Allocated memory is still 155.2MB. Free memory was 127.2MB in the beginning and 125.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 155.2MB. Free memory was 125.1MB in the beginning and 123.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 574.63ms. Allocated memory is still 155.2MB. Free memory was 123.6MB in the beginning and 107.7MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 1982.92ms. Allocated memory is still 155.2MB. Free memory was 107.7MB in the beginning and 110.6MB in the end (delta: -2.9MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Witness Printer took 28.20ms. Allocated memory is still 155.2MB. Free memory was 110.6MB in the beginning and 108.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (5 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.5 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 151 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 120 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 151 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 586 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 972 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 433 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 539 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 247]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {p_last_write=0, c_dr_i=1, c_dr_pc=0, a_t=0, NULL=0, NULL=1, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5765fb4=0, c_num_read=0, c_dr_st=0, q_read_ev=2, p_dw_i=1, tmp=0, q_write_ev=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2be54e36=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@126dac3f=0, tmp___1=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@20cd27d1=0, p_dw_pc=0, q_free=1, __retres1=1, tmp=0, \result=0, p_dw_st=0, tmp___0=0, c_last_read=0, NULL=0, kernel_st=1, p_num_write=0, q_buf_0=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 247]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int q_buf_0 ; [L25] int q_free ; [L26] int q_read_ev ; [L27] int q_write_ev ; [L28] int p_num_write ; [L29] int p_last_write ; [L30] int p_dw_st ; [L31] int p_dw_pc ; [L32] int p_dw_i ; [L33] int c_num_read ; [L34] int c_last_read ; [L35] int c_dr_st ; [L36] int c_dr_pc ; [L37] int c_dr_i ; [L144] static int a_t ; [L360] int __retres1 ; [L364] CALL init_model() [L346] q_free = 1 [L347] q_write_ev = 2 [L348] q_read_ev = q_write_ev [L349] p_num_write = 0 [L350] p_dw_pc = 0 [L351] p_dw_i = 1 [L352] c_num_read = 0 [L353] c_dr_pc = 0 [L354] c_dr_i = 1 [L364] RET init_model() [L365] CALL start_simulation() [L314] int kernel_st ; [L315] int tmp ; [L319] kernel_st = 0 [L320] CALL init_threads() [L206] COND TRUE (int )p_dw_i == 1 [L207] p_dw_st = 0 [L211] COND TRUE (int )c_dr_i == 1 [L212] c_dr_st = 0 [L320] RET init_threads() [L323] COND TRUE 1 [L326] kernel_st = 1 [L327] CALL eval() [L241] int tmp ; [L242] int tmp___0 ; [L243] int tmp___1 ; Loop: [L247] COND TRUE 1 [L250] CALL, EXPR exists_runnable_thread() [L221] int __retres1 ; [L224] COND TRUE (int )p_dw_st == 0 [L225] __retres1 = 1 [L237] return (__retres1); [L250] RET, EXPR exists_runnable_thread() [L250] tmp___1 = exists_runnable_thread() [L252] COND TRUE \read(tmp___1) [L257] COND TRUE (int )p_dw_st == 0 [L259] tmp = __VERIFIER_nondet_int() [L261] COND FALSE !(\read(tmp)) [L272] COND TRUE (int )c_dr_st == 0 [L274] tmp___0 = __VERIFIER_nondet_int() [L276] COND FALSE !(\read(tmp___0)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:21:32,304 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)