./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:08:58,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:08:58,065 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:08:58,117 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:08:58,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:08:58,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:08:58,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:08:58,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:08:58,125 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:08:58,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:08:58,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:08:58,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:08:58,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:08:58,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:08:58,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:08:58,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:08:58,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:08:58,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:08:58,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:08:58,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:08:58,152 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:08:58,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:08:58,153 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:08:58,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:08:58,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:08:58,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:08:58,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:08:58,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:08:58,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:08:58,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:08:58,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:08:58,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:08:58,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:08:58,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:08:58,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:08:58,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:08:58,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:08:58,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:08:58,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:08:58,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:08:58,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:08:58,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:08:58,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:08:58,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:08:58,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:08:58,201 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:08:58,201 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:08:58,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:08:58,202 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:08:58,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:08:58,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:08:58,203 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:08:58,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:08:58,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:08:58,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:08:58,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:08:58,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:08:58,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:08:58,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:08:58,205 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:08:58,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:08:58,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:08:58,206 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:08:58,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:08:58,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:08:58,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:08:58,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:08:58,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:08:58,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:08:58,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:08:58,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:08:58,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:08:58,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:08:58,209 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:08:58,209 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:08:58,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:08:58,209 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(G ! call(reach_error())) ) 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 -> 390a12f9f7a5c311c1cdcecac54987f654ebac30db2fbb7661324a5599d93cf6 [2022-07-12 10:08:58,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:08:58,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:08:58,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:08:58,448 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:08:58,449 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:08:58,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:08:58,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310f4ceb/ac1223bb44b64dcc9e116efc9698ac2e/FLAGde1629623 [2022-07-12 10:08:58,964 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:08:58,964 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:08:58,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310f4ceb/ac1223bb44b64dcc9e116efc9698ac2e/FLAGde1629623 [2022-07-12 10:08:58,993 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0310f4ceb/ac1223bb44b64dcc9e116efc9698ac2e [2022-07-12 10:08:58,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:08:58,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:08:59,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:08:59,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:08:59,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:08:59,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:08:58" (1/1) ... [2022-07-12 10:08:59,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f5f8cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59, skipping insertion in model container [2022-07-12 10:08:59,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:08:58" (1/1) ... [2022-07-12 10:08:59,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:08:59,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:08:59,199 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/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-07-12 10:08:59,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:08:59,411 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:08:59,424 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/pthread-wmm/safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i[1019,1032] [2022-07-12 10:08:59,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:08:59,499 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:08:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59 WrapperNode [2022-07-12 10:08:59,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:08:59,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:08:59,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:08:59,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:08:59,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,577 INFO L137 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-07-12 10:08:59,577 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:08:59,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:08:59,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:08:59,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:08:59,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:08:59,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:08:59,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:08:59,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:08:59,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (1/1) ... [2022-07-12 10:08:59,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:08:59,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:08:59,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:08:59,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:08:59,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:08:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-12 10:08:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:08:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:08:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:08:59,696 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-07-12 10:08:59,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-07-12 10:08:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-07-12 10:08:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-07-12 10:08:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-07-12 10:08:59,697 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-07-12 10:08:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:08:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-12 10:08:59,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:08:59,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:08:59,699 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:08:59,844 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:08:59,846 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:09:00,301 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:09:00,525 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:09:00,526 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:09:00,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:00 BoogieIcfgContainer [2022-07-12 10:09:00,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:09:00,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:09:00,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:09:00,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:09:00,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:08:58" (1/3) ... [2022-07-12 10:09:00,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425d0b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:00, skipping insertion in model container [2022-07-12 10:09:00,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:08:59" (2/3) ... [2022-07-12 10:09:00,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@425d0b48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:09:00, skipping insertion in model container [2022-07-12 10:09:00,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:00" (3/3) ... [2022-07-12 10:09:00,552 INFO L111 eAbstractionObserver]: Analyzing ICFG safe002_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-07-12 10:09:00,557 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:09:00,565 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:09:00,565 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:09:00,565 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:09:00,630 INFO L135 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-07-12 10:09:00,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:00,722 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2022-07-12 10:09:00,723 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:00,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-07-12 10:09:00,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-07-12 10:09:00,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-07-12 10:09:00,747 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:09:00,755 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@48bab1b7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3664fb2f [2022-07-12 10:09:00,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:09:00,775 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2022-07-12 10:09:00,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:09:00,776 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:00,776 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:00,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:00,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:00,782 INFO L85 PathProgramCache]: Analyzing trace with hash -41343894, now seen corresponding path program 1 times [2022-07-12 10:09:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:00,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196736864] [2022-07-12 10:09:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196736864] [2022-07-12 10:09:01,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196736864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:01,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:01,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:09:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830459891] [2022-07-12 10:09:01,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:01,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:09:01,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:09:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:09:01,112 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 114 [2022-07-12 10:09:01,117 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 111 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-07-12 10:09:01,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:01,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 114 [2022-07-12 10:09:01,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:01,256 INFO L129 PetriNetUnfolder]: 37/222 cut-off events. [2022-07-12 10:09:01,257 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-07-12 10:09:01,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 222 events. 37/222 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 700 event pairs, 7 based on Foata normal form. 11/217 useless extension candidates. Maximal degree in co-relation 263. Up to 51 conditions per place. [2022-07-12 10:09:01,261 INFO L132 encePairwiseOnDemand]: 109/114 looper letters, 11 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2022-07-12 10:09:01,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 260 flow [2022-07-12 10:09:01,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:09:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:09:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-07-12 10:09:01,282 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2022-07-12 10:09:01,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-07-12 10:09:01,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-07-12 10:09:01,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:01,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-07-12 10:09:01,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 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-07-12 10:09:01,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-07-12 10:09:01,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 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-07-12 10:09:01,308 INFO L186 Difference]: Start difference. First operand has 119 places, 111 transitions, 231 flow. Second operand 3 states and 321 transitions. [2022-07-12 10:09:01,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 260 flow [2022-07-12 10:09:01,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 256 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:01,317 INFO L242 Difference]: Finished difference. Result has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:01,320 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=116, PETRI_TRANSITIONS=107} [2022-07-12 10:09:01,323 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, -3 predicate places. [2022-07-12 10:09:01,324 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 107 transitions, 224 flow [2022-07-12 10:09:01,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 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-07-12 10:09:01,325 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:01,325 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:01,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:09:01,326 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash -931543574, now seen corresponding path program 1 times [2022-07-12 10:09:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093747108] [2022-07-12 10:09:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:01,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:01,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093747108] [2022-07-12 10:09:01,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093747108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:01,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:01,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952836225] [2022-07-12 10:09:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:01,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:01,539 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:01,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 107 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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-07-12 10:09:01,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:01,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:01,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:02,422 INFO L129 PetriNetUnfolder]: 1510/3951 cut-off events. [2022-07-12 10:09:02,422 INFO L130 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-07-12 10:09:02,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6478 conditions, 3951 events. 1510/3951 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 32319 event pairs, 140 based on Foata normal form. 0/3827 useless extension candidates. Maximal degree in co-relation 6423. Up to 811 conditions per place. [2022-07-12 10:09:02,447 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 38 selfloop transitions, 6 changer transitions 90/207 dead transitions. [2022-07-12 10:09:02,447 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 207 transitions, 698 flow [2022-07-12 10:09:02,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:02,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1257 transitions. [2022-07-12 10:09:02,452 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8481781376518218 [2022-07-12 10:09:02,452 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1257 transitions. [2022-07-12 10:09:02,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1257 transitions. [2022-07-12 10:09:02,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:02,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1257 transitions. [2022-07-12 10:09:02,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 96.6923076923077) internal successors, (1257), 13 states have internal predecessors, (1257), 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-07-12 10:09:02,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-07-12 10:09:02,461 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-07-12 10:09:02,461 INFO L186 Difference]: Start difference. First operand has 116 places, 107 transitions, 224 flow. Second operand 13 states and 1257 transitions. [2022-07-12 10:09:02,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 207 transitions, 698 flow [2022-07-12 10:09:02,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 207 transitions, 672 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:09:02,468 INFO L242 Difference]: Finished difference. Result has 138 places, 99 transitions, 282 flow [2022-07-12 10:09:02,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=282, PETRI_PLACES=138, PETRI_TRANSITIONS=99} [2022-07-12 10:09:02,469 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 19 predicate places. [2022-07-12 10:09:02,469 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 99 transitions, 282 flow [2022-07-12 10:09:02,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.0) internal successors, (623), 7 states have internal predecessors, (623), 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-07-12 10:09:02,470 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:02,470 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:02,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:09:02,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:02,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:02,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1925238441, now seen corresponding path program 1 times [2022-07-12 10:09:02,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:02,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503253392] [2022-07-12 10:09:02,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:02,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:02,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503253392] [2022-07-12 10:09:02,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503253392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:02,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:02,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994730094] [2022-07-12 10:09:02,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:02,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:02,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:02,628 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:02,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 99 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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-07-12 10:09:02,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:02,630 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:02,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:03,358 INFO L129 PetriNetUnfolder]: 888/2109 cut-off events. [2022-07-12 10:09:03,359 INFO L130 PetriNetUnfolder]: For 3855/3855 co-relation queries the response was YES. [2022-07-12 10:09:03,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6003 conditions, 2109 events. 888/2109 cut-off events. For 3855/3855 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14580 event pairs, 112 based on Foata normal form. 48/2080 useless extension candidates. Maximal degree in co-relation 5936. Up to 564 conditions per place. [2022-07-12 10:09:03,374 INFO L132 encePairwiseOnDemand]: 101/114 looper letters, 33 selfloop transitions, 15 changer transitions 70/191 dead transitions. [2022-07-12 10:09:03,375 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 191 transitions, 1068 flow [2022-07-12 10:09:03,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 10:09:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-07-12 10:09:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1237 transitions. [2022-07-12 10:09:03,379 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8346828609986505 [2022-07-12 10:09:03,379 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1237 transitions. [2022-07-12 10:09:03,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1237 transitions. [2022-07-12 10:09:03,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:03,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1237 transitions. [2022-07-12 10:09:03,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.15384615384616) internal successors, (1237), 13 states have internal predecessors, (1237), 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-07-12 10:09:03,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-07-12 10:09:03,388 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 114.0) internal successors, (1596), 14 states have internal predecessors, (1596), 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-07-12 10:09:03,388 INFO L186 Difference]: Start difference. First operand has 138 places, 99 transitions, 282 flow. Second operand 13 states and 1237 transitions. [2022-07-12 10:09:03,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 191 transitions, 1068 flow [2022-07-12 10:09:03,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 191 transitions, 1040 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-07-12 10:09:03,404 INFO L242 Difference]: Finished difference. Result has 137 places, 107 transitions, 433 flow [2022-07-12 10:09:03,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=433, PETRI_PLACES=137, PETRI_TRANSITIONS=107} [2022-07-12 10:09:03,407 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 18 predicate places. [2022-07-12 10:09:03,407 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 107 transitions, 433 flow [2022-07-12 10:09:03,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 89.14285714285714) internal successors, (624), 7 states have internal predecessors, (624), 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-07-12 10:09:03,408 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:03,408 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:03,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:09:03,409 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:03,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:03,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1331016545, now seen corresponding path program 1 times [2022-07-12 10:09:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:03,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836014541] [2022-07-12 10:09:03,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:03,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:03,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:03,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836014541] [2022-07-12 10:09:03,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836014541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:03,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:03,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:03,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022801412] [2022-07-12 10:09:03,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:03,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:03,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:03,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:03,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:03,576 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 114 [2022-07-12 10:09:03,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 107 transitions, 433 flow. Second operand has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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-07-12 10:09:03,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:03,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 114 [2022-07-12 10:09:03,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:04,118 INFO L129 PetriNetUnfolder]: 823/1896 cut-off events. [2022-07-12 10:09:04,118 INFO L130 PetriNetUnfolder]: For 6201/6205 co-relation queries the response was YES. [2022-07-12 10:09:04,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6464 conditions, 1896 events. 823/1896 cut-off events. For 6201/6205 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12511 event pairs, 193 based on Foata normal form. 30/1823 useless extension candidates. Maximal degree in co-relation 6381. Up to 509 conditions per place. [2022-07-12 10:09:04,134 INFO L132 encePairwiseOnDemand]: 103/114 looper letters, 36 selfloop transitions, 10 changer transitions 43/162 dead transitions. [2022-07-12 10:09:04,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 162 transitions, 1002 flow [2022-07-12 10:09:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:09:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:09:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 770 transitions. [2022-07-12 10:09:04,137 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8442982456140351 [2022-07-12 10:09:04,137 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 770 transitions. [2022-07-12 10:09:04,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 770 transitions. [2022-07-12 10:09:04,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:04,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 770 transitions. [2022-07-12 10:09:04,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 96.25) internal successors, (770), 8 states have internal predecessors, (770), 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-07-12 10:09:04,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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-07-12 10:09:04,142 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 114.0) internal successors, (1026), 9 states have internal predecessors, (1026), 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-07-12 10:09:04,142 INFO L186 Difference]: Start difference. First operand has 137 places, 107 transitions, 433 flow. Second operand 8 states and 770 transitions. [2022-07-12 10:09:04,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 162 transitions, 1002 flow [2022-07-12 10:09:04,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 162 transitions, 938 flow, removed 32 selfloop flow, removed 3 redundant places. [2022-07-12 10:09:04,166 INFO L242 Difference]: Finished difference. Result has 136 places, 103 transitions, 395 flow [2022-07-12 10:09:04,166 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=395, PETRI_PLACES=136, PETRI_TRANSITIONS=103} [2022-07-12 10:09:04,167 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 17 predicate places. [2022-07-12 10:09:04,167 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 103 transitions, 395 flow [2022-07-12 10:09:04,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.125) internal successors, (713), 8 states have internal predecessors, (713), 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-07-12 10:09:04,167 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:04,168 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:04,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:09:04,168 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:04,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash 892826605, now seen corresponding path program 1 times [2022-07-12 10:09:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:04,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526666586] [2022-07-12 10:09:04,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:04,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:04,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526666586] [2022-07-12 10:09:04,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526666586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:04,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:04,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:04,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186518612] [2022-07-12 10:09:04,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:04,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:04,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:04,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:04,294 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:04,295 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 103 transitions, 395 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-12 10:09:04,295 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:04,295 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:04,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:04,908 INFO L129 PetriNetUnfolder]: 618/1527 cut-off events. [2022-07-12 10:09:04,908 INFO L130 PetriNetUnfolder]: For 3462/3462 co-relation queries the response was YES. [2022-07-12 10:09:04,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1527 events. 618/1527 cut-off events. For 3462/3462 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10055 event pairs, 176 based on Foata normal form. 32/1494 useless extension candidates. Maximal degree in co-relation 4632. Up to 333 conditions per place. [2022-07-12 10:09:04,922 INFO L132 encePairwiseOnDemand]: 107/114 looper letters, 29 selfloop transitions, 3 changer transitions 63/170 dead transitions. [2022-07-12 10:09:04,923 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 170 transitions, 985 flow [2022-07-12 10:09:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 10:09:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-07-12 10:09:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1334 transitions. [2022-07-12 10:09:04,927 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8358395989974937 [2022-07-12 10:09:04,927 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1334 transitions. [2022-07-12 10:09:04,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1334 transitions. [2022-07-12 10:09:04,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:04,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1334 transitions. [2022-07-12 10:09:04,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 95.28571428571429) internal successors, (1334), 14 states have internal predecessors, (1334), 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-07-12 10:09:04,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-07-12 10:09:04,934 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 114.0) internal successors, (1710), 15 states have internal predecessors, (1710), 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-07-12 10:09:04,934 INFO L186 Difference]: Start difference. First operand has 136 places, 103 transitions, 395 flow. Second operand 14 states and 1334 transitions. [2022-07-12 10:09:04,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 170 transitions, 985 flow [2022-07-12 10:09:04,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 170 transitions, 849 flow, removed 36 selfloop flow, removed 12 redundant places. [2022-07-12 10:09:04,945 INFO L242 Difference]: Finished difference. Result has 146 places, 98 transitions, 312 flow [2022-07-12 10:09:04,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=312, PETRI_PLACES=146, PETRI_TRANSITIONS=98} [2022-07-12 10:09:04,946 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 27 predicate places. [2022-07-12 10:09:04,946 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 98 transitions, 312 flow [2022-07-12 10:09:04,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-12 10:09:04,947 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:04,947 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:04,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:09:04,947 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:04,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:04,948 INFO L85 PathProgramCache]: Analyzing trace with hash -102338471, now seen corresponding path program 2 times [2022-07-12 10:09:04,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:04,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60321299] [2022-07-12 10:09:04,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:04,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:05,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60321299] [2022-07-12 10:09:05,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60321299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:05,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:05,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512301139] [2022-07-12 10:09:05,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:05,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:05,074 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2022-07-12 10:09:05,076 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 98 transitions, 312 flow. Second operand has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-12 10:09:05,076 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:05,076 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2022-07-12 10:09:05,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:05,408 INFO L129 PetriNetUnfolder]: 364/942 cut-off events. [2022-07-12 10:09:05,409 INFO L130 PetriNetUnfolder]: For 2351/2351 co-relation queries the response was YES. [2022-07-12 10:09:05,413 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 942 events. 364/942 cut-off events. For 2351/2351 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5560 event pairs, 137 based on Foata normal form. 28/922 useless extension candidates. Maximal degree in co-relation 2710. Up to 182 conditions per place. [2022-07-12 10:09:05,416 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 20 selfloop transitions, 4 changer transitions 31/130 dead transitions. [2022-07-12 10:09:05,416 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 130 transitions, 619 flow [2022-07-12 10:09:05,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 10:09:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-12 10:09:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2022-07-12 10:09:05,419 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8458646616541353 [2022-07-12 10:09:05,419 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2022-07-12 10:09:05,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2022-07-12 10:09:05,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:05,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2022-07-12 10:09:05,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 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-07-12 10:09:05,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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-07-12 10:09:05,423 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 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-07-12 10:09:05,423 INFO L186 Difference]: Start difference. First operand has 146 places, 98 transitions, 312 flow. Second operand 7 states and 675 transitions. [2022-07-12 10:09:05,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 130 transitions, 619 flow [2022-07-12 10:09:05,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 544 flow, removed 27 selfloop flow, removed 13 redundant places. [2022-07-12 10:09:05,432 INFO L242 Difference]: Finished difference. Result has 132 places, 95 transitions, 270 flow [2022-07-12 10:09:05,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=270, PETRI_PLACES=132, PETRI_TRANSITIONS=95} [2022-07-12 10:09:05,434 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-07-12 10:09:05,434 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 95 transitions, 270 flow [2022-07-12 10:09:05,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 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-07-12 10:09:05,435 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:05,435 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:05,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:09:05,436 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:05,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:05,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1353675639, now seen corresponding path program 1 times [2022-07-12 10:09:05,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:05,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764003871] [2022-07-12 10:09:05,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:05,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:05,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764003871] [2022-07-12 10:09:05,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764003871] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:05,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:05,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 10:09:05,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984376082] [2022-07-12 10:09:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:05,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 10:09:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:05,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 10:09:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:09:05,551 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:05,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 95 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-07-12 10:09:05,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:05,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:05,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:05,845 INFO L129 PetriNetUnfolder]: 517/1221 cut-off events. [2022-07-12 10:09:05,845 INFO L130 PetriNetUnfolder]: For 1321/1321 co-relation queries the response was YES. [2022-07-12 10:09:05,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 1221 events. 517/1221 cut-off events. For 1321/1321 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7278 event pairs, 22 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 2725. Up to 315 conditions per place. [2022-07-12 10:09:05,854 INFO L132 encePairwiseOnDemand]: 104/114 looper letters, 25 selfloop transitions, 6 changer transitions 42/149 dead transitions. [2022-07-12 10:09:05,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 149 transitions, 582 flow [2022-07-12 10:09:05,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 985 transitions. [2022-07-12 10:09:05,857 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8640350877192983 [2022-07-12 10:09:05,858 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 985 transitions. [2022-07-12 10:09:05,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 985 transitions. [2022-07-12 10:09:05,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:05,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 985 transitions. [2022-07-12 10:09:05,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.5) internal successors, (985), 10 states have internal predecessors, (985), 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-07-12 10:09:05,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-07-12 10:09:05,862 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-07-12 10:09:05,863 INFO L186 Difference]: Start difference. First operand has 132 places, 95 transitions, 270 flow. Second operand 10 states and 985 transitions. [2022-07-12 10:09:05,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 149 transitions, 582 flow [2022-07-12 10:09:05,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 546 flow, removed 7 selfloop flow, removed 11 redundant places. [2022-07-12 10:09:05,867 INFO L242 Difference]: Finished difference. Result has 132 places, 97 transitions, 288 flow [2022-07-12 10:09:05,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=288, PETRI_PLACES=132, PETRI_TRANSITIONS=97} [2022-07-12 10:09:05,868 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 13 predicate places. [2022-07-12 10:09:05,868 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 97 transitions, 288 flow [2022-07-12 10:09:05,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.0) internal successors, (558), 6 states have internal predecessors, (558), 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-07-12 10:09:05,869 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:05,869 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:09:05,869 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:05,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 376198336, now seen corresponding path program 1 times [2022-07-12 10:09:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:05,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058570231] [2022-07-12 10:09:05,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:05,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:05,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058570231] [2022-07-12 10:09:05,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058570231] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:05,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:05,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:09:05,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011182537] [2022-07-12 10:09:05,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:05,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:09:05,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:09:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:09:05,997 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:05,997 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 97 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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-07-12 10:09:05,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:05,998 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:05,998 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:06,248 INFO L129 PetriNetUnfolder]: 184/567 cut-off events. [2022-07-12 10:09:06,248 INFO L130 PetriNetUnfolder]: For 892/892 co-relation queries the response was YES. [2022-07-12 10:09:06,250 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1606 conditions, 567 events. 184/567 cut-off events. For 892/892 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2709 event pairs, 12 based on Foata normal form. 19/578 useless extension candidates. Maximal degree in co-relation 1585. Up to 133 conditions per place. [2022-07-12 10:09:06,252 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 28 selfloop transitions, 9 changer transitions 31/144 dead transitions. [2022-07-12 10:09:06,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 703 flow [2022-07-12 10:09:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:09:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:09:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 980 transitions. [2022-07-12 10:09:06,256 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8596491228070176 [2022-07-12 10:09:06,256 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 980 transitions. [2022-07-12 10:09:06,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 980 transitions. [2022-07-12 10:09:06,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:06,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 980 transitions. [2022-07-12 10:09:06,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 98.0) internal successors, (980), 10 states have internal predecessors, (980), 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-07-12 10:09:06,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-07-12 10:09:06,262 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 114.0) internal successors, (1254), 11 states have internal predecessors, (1254), 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-07-12 10:09:06,262 INFO L186 Difference]: Start difference. First operand has 132 places, 97 transitions, 288 flow. Second operand 10 states and 980 transitions. [2022-07-12 10:09:06,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 703 flow [2022-07-12 10:09:06,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 144 transitions, 677 flow, removed 7 selfloop flow, removed 6 redundant places. [2022-07-12 10:09:06,267 INFO L242 Difference]: Finished difference. Result has 135 places, 100 transitions, 354 flow [2022-07-12 10:09:06,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=354, PETRI_PLACES=135, PETRI_TRANSITIONS=100} [2022-07-12 10:09:06,270 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 16 predicate places. [2022-07-12 10:09:06,270 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 100 transitions, 354 flow [2022-07-12 10:09:06,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 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-07-12 10:09:06,270 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:06,271 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:06,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:09:06,271 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash -953214407, now seen corresponding path program 1 times [2022-07-12 10:09:06,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:06,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794676952] [2022-07-12 10:09:06,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:06,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:09:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:09:06,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:09:06,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794676952] [2022-07-12 10:09:06,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794676952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:09:06,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:09:06,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:09:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30733444] [2022-07-12 10:09:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:09:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:09:06,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:09:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:09:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:09:06,433 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 114 [2022-07-12 10:09:06,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 100 transitions, 354 flow. Second operand has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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-07-12 10:09:06,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:09:06,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 114 [2022-07-12 10:09:06,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:09:06,622 INFO L129 PetriNetUnfolder]: 54/242 cut-off events. [2022-07-12 10:09:06,622 INFO L130 PetriNetUnfolder]: For 564/568 co-relation queries the response was YES. [2022-07-12 10:09:06,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 242 events. 54/242 cut-off events. For 564/568 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 741 event pairs, 7 based on Foata normal form. 7/244 useless extension candidates. Maximal degree in co-relation 702. Up to 49 conditions per place. [2022-07-12 10:09:06,625 INFO L132 encePairwiseOnDemand]: 105/114 looper letters, 19 selfloop transitions, 12 changer transitions 19/126 dead transitions. [2022-07-12 10:09:06,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 126 transitions, 640 flow [2022-07-12 10:09:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 10:09:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-07-12 10:09:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1053 transitions. [2022-07-12 10:09:06,628 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8397129186602871 [2022-07-12 10:09:06,628 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1053 transitions. [2022-07-12 10:09:06,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1053 transitions. [2022-07-12 10:09:06,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:09:06,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1053 transitions. [2022-07-12 10:09:06,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.72727272727273) internal successors, (1053), 11 states have internal predecessors, (1053), 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-07-12 10:09:06,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-07-12 10:09:06,634 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 114.0) internal successors, (1368), 12 states have internal predecessors, (1368), 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-07-12 10:09:06,634 INFO L186 Difference]: Start difference. First operand has 135 places, 100 transitions, 354 flow. Second operand 11 states and 1053 transitions. [2022-07-12 10:09:06,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 126 transitions, 640 flow [2022-07-12 10:09:06,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 126 transitions, 493 flow, removed 63 selfloop flow, removed 14 redundant places. [2022-07-12 10:09:06,639 INFO L242 Difference]: Finished difference. Result has 133 places, 100 transitions, 324 flow [2022-07-12 10:09:06,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=324, PETRI_PLACES=133, PETRI_TRANSITIONS=100} [2022-07-12 10:09:06,640 INFO L279 CegarLoopForPetriNet]: 119 programPoint places, 14 predicate places. [2022-07-12 10:09:06,640 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 100 transitions, 324 flow [2022-07-12 10:09:06,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 93.0) internal successors, (744), 8 states have internal predecessors, (744), 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-07-12 10:09:06,641 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:09:06,641 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:06,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:09:06,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-07-12 10:09:06,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:09:06,642 INFO L85 PathProgramCache]: Analyzing trace with hash -183876306, now seen corresponding path program 1 times [2022-07-12 10:09:06,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:09:06,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952176777] [2022-07-12 10:09:06,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:09:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:09:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:06,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:09:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:09:06,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:09:06,766 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:09:06,767 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-07-12 10:09:06,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:09:06,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-07-12 10:09:06,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-07-12 10:09:06,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-07-12 10:09:06,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:09:06,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:09:06,770 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:09:06,776 INFO L226 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-07-12 10:09:06,776 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 10:09:06,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 10:09:06 BasicIcfg [2022-07-12 10:09:06,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 10:09:06,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 10:09:06,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 10:09:06,909 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 10:09:06,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:09:00" (3/4) ... [2022-07-12 10:09:06,911 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 10:09:07,009 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 10:09:07,009 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 10:09:07,010 INFO L158 Benchmark]: Toolchain (without parser) took 8013.57ms. Allocated memory was 94.4MB in the beginning and 358.6MB in the end (delta: 264.2MB). Free memory was 60.7MB in the beginning and 97.8MB in the end (delta: -37.0MB). Peak memory consumption was 227.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,010 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 10:09:07,011 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.36ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 57.1MB in the end (delta: 3.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,011 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.71ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,011 INFO L158 Benchmark]: Boogie Preprocessor took 55.41ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,011 INFO L158 Benchmark]: RCFGBuilder took 893.44ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 52.4MB in the beginning and 38.4MB in the end (delta: 14.0MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,012 INFO L158 Benchmark]: TraceAbstraction took 6378.18ms. Allocated memory was 123.7MB in the beginning and 358.6MB in the end (delta: 234.9MB). Free memory was 38.4MB in the beginning and 130.3MB in the end (delta: -91.8MB). Peak memory consumption was 142.9MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,012 INFO L158 Benchmark]: Witness Printer took 100.80ms. Allocated memory is still 358.6MB. Free memory was 129.2MB in the beginning and 97.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-12 10:09:07,014 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 94.4MB. Free memory was 48.6MB in the beginning and 48.5MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 500.36ms. Allocated memory is still 94.4MB. Free memory was 60.5MB in the beginning and 57.1MB in the end (delta: 3.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.71ms. Allocated memory is still 94.4MB. Free memory was 57.1MB in the beginning and 54.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.41ms. Allocated memory is still 94.4MB. Free memory was 54.5MB in the beginning and 52.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 893.44ms. Allocated memory was 94.4MB in the beginning and 123.7MB in the end (delta: 29.4MB). Free memory was 52.4MB in the beginning and 38.4MB in the end (delta: 14.0MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6378.18ms. Allocated memory was 123.7MB in the beginning and 358.6MB in the end (delta: 234.9MB). Free memory was 38.4MB in the beginning and 130.3MB in the end (delta: -91.8MB). Peak memory consumption was 142.9MB. Max. memory is 16.1GB. * Witness Printer took 100.80ms. Allocated memory is still 358.6MB. Free memory was 129.2MB in the beginning and 97.8MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L717] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L718] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L720] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L721] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L722] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L723] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L724] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L725] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L726] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L727] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0] [L728] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L729] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L730] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L731] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0] [L732] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L733] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L734] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L735] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L736] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L738] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L740] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L829] 0 pthread_t t1828; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L830] FCALL, FORK 0 pthread_create(&t1828, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1828, ((void *)0), P0, ((void *)0))=-2, t1828={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L831] 0 pthread_t t1829; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L832] FCALL, FORK 0 pthread_create(&t1829, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1829, ((void *)0), P1, ((void *)0))=-1, t1828={5:0}, t1829={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1830; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L834] FCALL, FORK 0 pthread_create(&t1830, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1830, ((void *)0), P2, ((void *)0))=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EBX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L840] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L847] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1828={5:0}, t1829={6:0}, t1830={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 548 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 822 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1080 IncrementalHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 97 mSDtfsCounter, 1080 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=433occurred in iteration=3, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 779 NumberOfCodeBlocks, 779 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 2440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-12 10:09:07,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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