./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/pthread-wmm/safe018_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 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:57:15,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:57:15,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:57:16,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:57:16,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:57:16,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:57:16,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:57:16,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:57:16,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:57:16,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:57:16,030 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:57:16,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:57:16,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:57:16,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:57:16,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:57:16,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:57:16,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:57:16,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:57:16,044 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:57:16,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:57:16,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:57:16,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:57:16,059 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:57:16,060 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:57:16,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:57:16,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:57:16,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:57:16,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:57:16,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:57:16,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:57:16,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:57:16,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:57:16,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:57:16,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:57:16,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:57:16,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:57:16,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:57:16,072 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:57:16,072 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:57:16,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:57:16,073 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:57:16,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:57:16,108 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:57:16,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:57:16,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:57:16,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:57:16,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:57:16,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:57:16,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:57:16,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:57:16,112 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:57:16,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:57:16,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:57:16,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:57:16,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:57:16,114 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:57:16,115 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:57:16,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:57:16,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:57:16,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:57:16,116 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:57:16,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:16,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:57:16,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:57:16,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:57:16,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:57:16,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:57:16,117 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:57:16,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:57:16,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:57:16,118 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:57:16,118 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:57:16,118 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:57:16,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:57:16,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:57:16,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:57:16,459 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:57:16,459 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:57:16,460 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-09-01 09:57:17,652 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:57:17,916 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:57:17,917 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i [2023-09-01 09:57:17,928 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5e832f/24618e41f13f475b902e853e544780ff/FLAGb3c3c4588 [2023-09-01 09:57:17,943 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31b5e832f/24618e41f13f475b902e853e544780ff [2023-09-01 09:57:17,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:57:17,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:57:17,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:17,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:57:17,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:57:17,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:17" (1/1) ... [2023-09-01 09:57:17,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afe852a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:17, skipping insertion in model container [2023-09-01 09:57:17,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:17" (1/1) ... [2023-09-01 09:57:17,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:57:18,001 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:57:18,171 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i[992,1005] [2023-09-01 09:57:18,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:18,426 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:57:18,439 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe018_rmo.opt.i[992,1005] [2023-09-01 09:57:18,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:18,542 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:18,542 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:18,548 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:57:18,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18 WrapperNode [2023-09-01 09:57:18,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:18,550 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:18,551 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:57:18,551 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:57:18,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,629 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-09-01 09:57:18,630 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:18,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:57:18,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:57:18,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:57:18,639 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,675 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:57:18,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:57:18,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:57:18,682 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:57:18,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:18,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:57:18,714 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) [2023-09-01 09:57:18,722 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 [2023-09-01 09:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:57:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:57:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:57:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:57:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:57:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:57:18,757 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:57:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:57:18,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:57:18,758 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:57:18,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:57:18,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:57:18,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:57:18,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:57:18,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:57:18,760 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:57:18,981 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:57:18,987 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:57:19,363 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:57:19,666 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:57:19,666 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:57:19,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19 BoogieIcfgContainer [2023-09-01 09:57:19,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:57:19,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:57:19,672 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:57:19,674 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:57:19,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:57:17" (1/3) ... [2023-09-01 09:57:19,675 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d65180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:19, skipping insertion in model container [2023-09-01 09:57:19,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (2/3) ... [2023-09-01 09:57:19,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d65180 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:19, skipping insertion in model container [2023-09-01 09:57:19,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19" (3/3) ... [2023-09-01 09:57:19,680 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2023-09-01 09:57:19,687 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:57:19,694 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:57:19,695 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 09:57:19,695 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:57:19,762 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:57:19,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2023-09-01 09:57:19,865 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2023-09-01 09:57:19,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:19,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2023-09-01 09:57:19,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2023-09-01 09:57:19,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 109 transitions, 227 flow [2023-09-01 09:57:19,880 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:57:19,892 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 109 transitions, 227 flow [2023-09-01 09:57:19,894 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 109 transitions, 227 flow [2023-09-01 09:57:19,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 109 transitions, 227 flow [2023-09-01 09:57:19,933 INFO L130 PetriNetUnfolder]: 1/109 cut-off events. [2023-09-01 09:57:19,935 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:19,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 1/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 39 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-09-01 09:57:19,939 INFO L119 LiptonReduction]: Number of co-enabled transitions 1138 [2023-09-01 09:57:25,181 INFO L134 LiptonReduction]: Checked pairs total: 3228 [2023-09-01 09:57:25,181 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-09-01 09:57:25,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:57:25,201 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@19f1d919, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:57:25,202 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-09-01 09:57:25,212 INFO L130 PetriNetUnfolder]: 1/21 cut-off events. [2023-09-01 09:57:25,213 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:25,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:25,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:25,215 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:25,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:25,223 INFO L85 PathProgramCache]: Analyzing trace with hash -2117094696, now seen corresponding path program 1 times [2023-09-01 09:57:25,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561964988] [2023-09-01 09:57:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:25,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:25,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:25,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561964988] [2023-09-01 09:57:25,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561964988] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844958532] [2023-09-01 09:57:25,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 09:57:25,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:25,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 09:57:25,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 09:57:25,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 216 [2023-09-01 09:57:25,527 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 53 flow. Second operand has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 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) [2023-09-01 09:57:25,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:25,528 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 216 [2023-09-01 09:57:25,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:25,815 INFO L130 PetriNetUnfolder]: 855/1292 cut-off events. [2023-09-01 09:57:25,815 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-09-01 09:57:25,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2619 conditions, 1292 events. 855/1292 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5361 event pairs, 855 based on Foata normal form. 64/1264 useless extension candidates. Maximal degree in co-relation 2608. Up to 1281 conditions per place. [2023-09-01 09:57:25,828 INFO L137 encePairwiseOnDemand]: 215/216 looper letters, 19 selfloop transitions, 0 changer transitions 1/21 dead transitions. [2023-09-01 09:57:25,829 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 21 transitions, 91 flow [2023-09-01 09:57:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 09:57:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 09:57:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 245 transitions. [2023-09-01 09:57:25,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5671296296296297 [2023-09-01 09:57:25,846 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 245 transitions. [2023-09-01 09:57:25,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 245 transitions. [2023-09-01 09:57:25,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:25,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 245 transitions. [2023-09-01 09:57:25,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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) [2023-09-01 09:57:25,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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) [2023-09-01 09:57:25,856 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 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) [2023-09-01 09:57:25,857 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 53 flow. Second operand 2 states and 245 transitions. [2023-09-01 09:57:25,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 21 transitions, 91 flow [2023-09-01 09:57:25,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:25,861 INFO L231 Difference]: Finished difference. Result has 29 places, 20 transitions, 46 flow [2023-09-01 09:57:25,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=29, PETRI_TRANSITIONS=20} [2023-09-01 09:57:25,865 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2023-09-01 09:57:25,866 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 46 flow [2023-09-01 09:57:25,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 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) [2023-09-01 09:57:25,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:25,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:25,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:57:25,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:25,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:25,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2116729516, now seen corresponding path program 1 times [2023-09-01 09:57:25,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:25,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554475664] [2023-09-01 09:57:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:25,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:26,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:26,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:26,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554475664] [2023-09-01 09:57:26,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554475664] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:26,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:26,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:26,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938552728] [2023-09-01 09:57:26,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:26,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:26,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:26,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:26,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 216 [2023-09-01 09:57:26,381 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-09-01 09:57:26,381 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:26,381 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 216 [2023-09-01 09:57:26,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:26,660 INFO L130 PetriNetUnfolder]: 727/1184 cut-off events. [2023-09-01 09:57:26,660 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:26,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 1184 events. 727/1184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5306 event pairs, 175 based on Foata normal form. 64/1248 useless extension candidates. Maximal degree in co-relation 2346. Up to 761 conditions per place. [2023-09-01 09:57:26,665 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 25 selfloop transitions, 2 changer transitions 16/44 dead transitions. [2023-09-01 09:57:26,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 44 transitions, 180 flow [2023-09-01 09:57:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:26,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-09-01 09:57:26,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2023-09-01 09:57:26,669 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-09-01 09:57:26,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-09-01 09:57:26,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:26,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-09-01 09:57:26,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 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) [2023-09-01 09:57:26,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:26,675 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:26,675 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 46 flow. Second operand 5 states and 600 transitions. [2023-09-01 09:57:26,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 44 transitions, 180 flow [2023-09-01 09:57:26,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 180 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:57:26,677 INFO L231 Difference]: Finished difference. Result has 35 places, 20 transitions, 58 flow [2023-09-01 09:57:26,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=35, PETRI_TRANSITIONS=20} [2023-09-01 09:57:26,677 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-09-01 09:57:26,678 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 20 transitions, 58 flow [2023-09-01 09:57:26,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 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) [2023-09-01 09:57:26,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:26,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:26,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:57:26,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:26,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1194123434, now seen corresponding path program 1 times [2023-09-01 09:57:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:26,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502916131] [2023-09-01 09:57:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:26,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:26,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502916131] [2023-09-01 09:57:26,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502916131] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:26,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:26,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038137142] [2023-09-01 09:57:26,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:26,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:26,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 216 [2023-09-01 09:57:26,970 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 20 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-09-01 09:57:26,970 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:26,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 216 [2023-09-01 09:57:26,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:27,209 INFO L130 PetriNetUnfolder]: 641/997 cut-off events. [2023-09-01 09:57:27,210 INFO L131 PetriNetUnfolder]: For 266/266 co-relation queries the response was YES. [2023-09-01 09:57:27,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2257 conditions, 997 events. 641/997 cut-off events. For 266/266 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4262 event pairs, 207 based on Foata normal form. 48/1041 useless extension candidates. Maximal degree in co-relation 2250. Up to 757 conditions per place. [2023-09-01 09:57:27,215 INFO L137 encePairwiseOnDemand]: 212/216 looper letters, 29 selfloop transitions, 2 changer transitions 14/46 dead transitions. [2023-09-01 09:57:27,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 209 flow [2023-09-01 09:57:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 592 transitions. [2023-09-01 09:57:27,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2023-09-01 09:57:27,218 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 592 transitions. [2023-09-01 09:57:27,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 592 transitions. [2023-09-01 09:57:27,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:27,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 592 transitions. [2023-09-01 09:57:27,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 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) [2023-09-01 09:57:27,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:27,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:27,223 INFO L175 Difference]: Start difference. First operand has 35 places, 20 transitions, 58 flow. Second operand 5 states and 592 transitions. [2023-09-01 09:57:27,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 209 flow [2023-09-01 09:57:27,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 199 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:27,226 INFO L231 Difference]: Finished difference. Result has 36 places, 20 transitions, 62 flow [2023-09-01 09:57:27,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=62, PETRI_PLACES=36, PETRI_TRANSITIONS=20} [2023-09-01 09:57:27,227 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-09-01 09:57:27,227 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 62 flow [2023-09-01 09:57:27,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-09-01 09:57:27,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:27,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:27,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:57:27,229 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:27,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 372232421, now seen corresponding path program 1 times [2023-09-01 09:57:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132892155] [2023-09-01 09:57:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:27,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:27,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132892155] [2023-09-01 09:57:27,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132892155] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:27,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177184731] [2023-09-01 09:57:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:27,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:27,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:27,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 216 [2023-09-01 09:57:27,504 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 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) [2023-09-01 09:57:27,504 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:27,504 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 216 [2023-09-01 09:57:27,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:27,844 INFO L130 PetriNetUnfolder]: 970/1479 cut-off events. [2023-09-01 09:57:27,844 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2023-09-01 09:57:27,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3437 conditions, 1479 events. 970/1479 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6010 event pairs, 263 based on Foata normal form. 48/1527 useless extension candidates. Maximal degree in co-relation 3429. Up to 556 conditions per place. [2023-09-01 09:57:27,850 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 29 selfloop transitions, 3 changer transitions 20/52 dead transitions. [2023-09-01 09:57:27,850 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 52 transitions, 241 flow [2023-09-01 09:57:27,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2023-09-01 09:57:27,853 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2023-09-01 09:57:27,853 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2023-09-01 09:57:27,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2023-09-01 09:57:27,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:27,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2023-09-01 09:57:27,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 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) [2023-09-01 09:57:27,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:27,858 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:27,858 INFO L175 Difference]: Start difference. First operand has 36 places, 20 transitions, 62 flow. Second operand 6 states and 696 transitions. [2023-09-01 09:57:27,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 52 transitions, 241 flow [2023-09-01 09:57:27,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 231 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:27,863 INFO L231 Difference]: Finished difference. Result has 39 places, 20 transitions, 72 flow [2023-09-01 09:57:27,863 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=20} [2023-09-01 09:57:27,864 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-09-01 09:57:27,864 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 20 transitions, 72 flow [2023-09-01 09:57:27,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.0) internal successors, (654), 6 states have internal predecessors, (654), 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) [2023-09-01 09:57:27,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:27,865 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:27,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:57:27,865 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:27,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:27,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1346996689, now seen corresponding path program 1 times [2023-09-01 09:57:27,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:27,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-09-01 09:57:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:27,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:27,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:28,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996758055] [2023-09-01 09:57:28,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996758055] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:28,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:28,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:57:28,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198124652] [2023-09-01 09:57:28,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:28,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:57:28,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:28,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:57:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:57:29,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 216 [2023-09-01 09:57:29,098 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 20 transitions, 72 flow. Second operand has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 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) [2023-09-01 09:57:29,098 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:29,098 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 216 [2023-09-01 09:57:29,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:29,441 INFO L130 PetriNetUnfolder]: 464/745 cut-off events. [2023-09-01 09:57:29,441 INFO L131 PetriNetUnfolder]: For 487/487 co-relation queries the response was YES. [2023-09-01 09:57:29,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 745 events. 464/745 cut-off events. For 487/487 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2796 event pairs, 255 based on Foata normal form. 36/781 useless extension candidates. Maximal degree in co-relation 1845. Up to 612 conditions per place. [2023-09-01 09:57:29,446 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 27 selfloop transitions, 5 changer transitions 12/45 dead transitions. [2023-09-01 09:57:29,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 45 transitions, 225 flow [2023-09-01 09:57:29,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2023-09-01 09:57:29,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49382716049382713 [2023-09-01 09:57:29,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 640 transitions. [2023-09-01 09:57:29,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions. [2023-09-01 09:57:29,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:29,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions. [2023-09-01 09:57:29,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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) [2023-09-01 09:57:29,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:29,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:29,454 INFO L175 Difference]: Start difference. First operand has 39 places, 20 transitions, 72 flow. Second operand 6 states and 640 transitions. [2023-09-01 09:57:29,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 45 transitions, 225 flow [2023-09-01 09:57:29,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 193 flow, removed 8 selfloop flow, removed 8 redundant places. [2023-09-01 09:57:29,457 INFO L231 Difference]: Finished difference. Result has 38 places, 24 transitions, 88 flow [2023-09-01 09:57:29,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=24} [2023-09-01 09:57:29,458 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-09-01 09:57:29,458 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 24 transitions, 88 flow [2023-09-01 09:57:29,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 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) [2023-09-01 09:57:29,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:29,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:29,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:57:29,459 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:29,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1321488214, now seen corresponding path program 1 times [2023-09-01 09:57:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:29,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299700955] [2023-09-01 09:57:29,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:29,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299700955] [2023-09-01 09:57:29,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299700955] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:29,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:29,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138785445] [2023-09-01 09:57:29,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:29,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:29,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:29,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 216 [2023-09-01 09:57:29,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 24 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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) [2023-09-01 09:57:29,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:29,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 216 [2023-09-01 09:57:29,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:29,816 INFO L130 PetriNetUnfolder]: 242/416 cut-off events. [2023-09-01 09:57:29,816 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2023-09-01 09:57:29,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 416 events. 242/416 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1467 event pairs, 55 based on Foata normal form. 21/437 useless extension candidates. Maximal degree in co-relation 1083. Up to 362 conditions per place. [2023-09-01 09:57:29,819 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 32 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2023-09-01 09:57:29,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 203 flow [2023-09-01 09:57:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-09-01 09:57:29,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5478395061728395 [2023-09-01 09:57:29,821 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-09-01 09:57:29,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-09-01 09:57:29,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:29,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-09-01 09:57:29,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-09-01 09:57:29,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-09-01 09:57:29,824 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 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) [2023-09-01 09:57:29,824 INFO L175 Difference]: Start difference. First operand has 38 places, 24 transitions, 88 flow. Second operand 3 states and 355 transitions. [2023-09-01 09:57:29,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 203 flow [2023-09-01 09:57:29,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 201 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:29,827 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 112 flow [2023-09-01 09:57:29,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-09-01 09:57:29,830 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2023-09-01 09:57:29,831 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 112 flow [2023-09-01 09:57:29,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 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) [2023-09-01 09:57:29,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:29,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:29,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:57:29,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:29,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 357784650, now seen corresponding path program 1 times [2023-09-01 09:57:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057589080] [2023-09-01 09:57:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057589080] [2023-09-01 09:57:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057589080] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:57:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248840651] [2023-09-01 09:57:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:30,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:57:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:57:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:57:31,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 216 [2023-09-01 09:57:31,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 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) [2023-09-01 09:57:31,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:31,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 216 [2023-09-01 09:57:31,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:31,416 INFO L130 PetriNetUnfolder]: 412/725 cut-off events. [2023-09-01 09:57:31,416 INFO L131 PetriNetUnfolder]: For 352/352 co-relation queries the response was YES. [2023-09-01 09:57:31,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 725 events. 412/725 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3219 event pairs, 86 based on Foata normal form. 30/755 useless extension candidates. Maximal degree in co-relation 2121. Up to 376 conditions per place. [2023-09-01 09:57:31,421 INFO L137 encePairwiseOnDemand]: 209/216 looper letters, 39 selfloop transitions, 9 changer transitions 13/62 dead transitions. [2023-09-01 09:57:31,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 364 flow [2023-09-01 09:57:31,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:57:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:57:31,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 774 transitions. [2023-09-01 09:57:31,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2023-09-01 09:57:31,424 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 774 transitions. [2023-09-01 09:57:31,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 774 transitions. [2023-09-01 09:57:31,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:31,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 774 transitions. [2023-09-01 09:57:31,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 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) [2023-09-01 09:57:31,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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) [2023-09-01 09:57:31,429 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 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) [2023-09-01 09:57:31,429 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 112 flow. Second operand 7 states and 774 transitions. [2023-09-01 09:57:31,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 364 flow [2023-09-01 09:57:31,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 62 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:31,431 INFO L231 Difference]: Finished difference. Result has 47 places, 30 transitions, 156 flow [2023-09-01 09:57:31,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=47, PETRI_TRANSITIONS=30} [2023-09-01 09:57:31,432 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-09-01 09:57:31,432 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 30 transitions, 156 flow [2023-09-01 09:57:31,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 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) [2023-09-01 09:57:31,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:31,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:31,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:57:31,433 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:31,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 372647900, now seen corresponding path program 1 times [2023-09-01 09:57:31,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:31,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107526244] [2023-09-01 09:57:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:31,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107526244] [2023-09-01 09:57:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107526244] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:31,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:57:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197105523] [2023-09-01 09:57:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:31,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:31,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:31,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:31,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 216 [2023-09-01 09:57:31,657 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 30 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-09-01 09:57:31,657 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:31,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 216 [2023-09-01 09:57:31,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:31,769 INFO L130 PetriNetUnfolder]: 149/305 cut-off events. [2023-09-01 09:57:31,770 INFO L131 PetriNetUnfolder]: For 345/345 co-relation queries the response was YES. [2023-09-01 09:57:31,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 305 events. 149/305 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 28 based on Foata normal form. 38/343 useless extension candidates. Maximal degree in co-relation 1029. Up to 144 conditions per place. [2023-09-01 09:57:31,772 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 45 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-09-01 09:57:31,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 385 flow [2023-09-01 09:57:31,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:57:31,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:57:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 471 transitions. [2023-09-01 09:57:31,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2023-09-01 09:57:31,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 471 transitions. [2023-09-01 09:57:31,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 471 transitions. [2023-09-01 09:57:31,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:31,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 471 transitions. [2023-09-01 09:57:31,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 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) [2023-09-01 09:57:31,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-09-01 09:57:31,778 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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) [2023-09-01 09:57:31,778 INFO L175 Difference]: Start difference. First operand has 47 places, 30 transitions, 156 flow. Second operand 4 states and 471 transitions. [2023-09-01 09:57:31,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 385 flow [2023-09-01 09:57:31,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 368 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:31,781 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 185 flow [2023-09-01 09:57:31,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-09-01 09:57:31,783 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2023-09-01 09:57:31,783 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 185 flow [2023-09-01 09:57:31,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 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) [2023-09-01 09:57:31,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:31,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:31,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:57:31,784 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:31,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1628550696, now seen corresponding path program 1 times [2023-09-01 09:57:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:31,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140096587] [2023-09-01 09:57:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:31,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:32,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:32,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140096587] [2023-09-01 09:57:32,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140096587] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:32,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:32,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:32,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067388991] [2023-09-01 09:57:32,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:32,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:32,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:32,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:32,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:32,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 216 [2023-09-01 09:57:32,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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) [2023-09-01 09:57:32,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:32,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 216 [2023-09-01 09:57:32,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:32,193 INFO L130 PetriNetUnfolder]: 105/213 cut-off events. [2023-09-01 09:57:32,193 INFO L131 PetriNetUnfolder]: For 370/370 co-relation queries the response was YES. [2023-09-01 09:57:32,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 213 events. 105/213 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 761 event pairs, 20 based on Foata normal form. 15/228 useless extension candidates. Maximal degree in co-relation 805. Up to 87 conditions per place. [2023-09-01 09:57:32,195 INFO L137 encePairwiseOnDemand]: 211/216 looper letters, 38 selfloop transitions, 10 changer transitions 4/53 dead transitions. [2023-09-01 09:57:32,195 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 53 transitions, 396 flow [2023-09-01 09:57:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2023-09-01 09:57:32,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5361111111111111 [2023-09-01 09:57:32,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2023-09-01 09:57:32,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2023-09-01 09:57:32,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:32,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2023-09-01 09:57:32,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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) [2023-09-01 09:57:32,201 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:32,202 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 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) [2023-09-01 09:57:32,202 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 185 flow. Second operand 5 states and 579 transitions. [2023-09-01 09:57:32,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 53 transitions, 396 flow [2023-09-01 09:57:32,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 360 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:32,205 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 187 flow [2023-09-01 09:57:32,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-09-01 09:57:32,205 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 15 predicate places. [2023-09-01 09:57:32,206 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 187 flow [2023-09-01 09:57:32,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 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) [2023-09-01 09:57:32,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:32,206 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:32,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:57:32,207 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:32,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1819534701, now seen corresponding path program 1 times [2023-09-01 09:57:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:32,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628066275] [2023-09-01 09:57:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:33,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:33,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628066275] [2023-09-01 09:57:33,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628066275] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:33,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:33,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:57:33,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971697717] [2023-09-01 09:57:33,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:33,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:57:33,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:33,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:57:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:57:34,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 216 [2023-09-01 09:57:34,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 187 flow. Second operand has 9 states, 9 states have (on average 106.11111111111111) internal successors, (955), 9 states have internal predecessors, (955), 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) [2023-09-01 09:57:34,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:34,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 216 [2023-09-01 09:57:34,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:34,393 INFO L130 PetriNetUnfolder]: 185/390 cut-off events. [2023-09-01 09:57:34,394 INFO L131 PetriNetUnfolder]: For 748/748 co-relation queries the response was YES. [2023-09-01 09:57:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 390 events. 185/390 cut-off events. For 748/748 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1741 event pairs, 62 based on Foata normal form. 1/391 useless extension candidates. Maximal degree in co-relation 1454. Up to 164 conditions per place. [2023-09-01 09:57:34,396 INFO L137 encePairwiseOnDemand]: 210/216 looper letters, 42 selfloop transitions, 4 changer transitions 23/70 dead transitions. [2023-09-01 09:57:34,396 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 550 flow [2023-09-01 09:57:34,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:34,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 666 transitions. [2023-09-01 09:57:34,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2023-09-01 09:57:34,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 666 transitions. [2023-09-01 09:57:34,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 666 transitions. [2023-09-01 09:57:34,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:34,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 666 transitions. [2023-09-01 09:57:34,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 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) [2023-09-01 09:57:34,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:34,405 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 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) [2023-09-01 09:57:34,405 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 187 flow. Second operand 6 states and 666 transitions. [2023-09-01 09:57:34,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 550 flow [2023-09-01 09:57:34,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 70 transitions, 472 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:34,410 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 175 flow [2023-09-01 09:57:34,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2023-09-01 09:57:34,412 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2023-09-01 09:57:34,412 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 175 flow [2023-09-01 09:57:34,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 106.11111111111111) internal successors, (955), 9 states have internal predecessors, (955), 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) [2023-09-01 09:57:34,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:34,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:34,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:57:34,413 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-09-01 09:57:34,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1843651163, now seen corresponding path program 2 times [2023-09-01 09:57:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:34,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940613743] [2023-09-01 09:57:34,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:34,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:57:34,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:57:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:57:34,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:57:34,633 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:57:34,634 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-09-01 09:57:34,639 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-09-01 09:57:34,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-09-01 09:57:34,640 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-09-01 09:57:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:57:34,641 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:34,645 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:57:34,646 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:57:34,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:57:34 BasicIcfg [2023-09-01 09:57:34,723 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:57:34,724 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:57:34,724 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:57:34,724 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:57:34,725 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19" (3/4) ... [2023-09-01 09:57:34,726 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:57:34,813 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:57:34,813 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:57:34,814 INFO L158 Benchmark]: Toolchain (without parser) took 16868.55ms. Allocated memory was 67.1MB in the beginning and 308.3MB in the end (delta: 241.2MB). Free memory was 37.9MB in the beginning and 195.2MB in the end (delta: -157.2MB). Peak memory consumption was 84.7MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,814 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:57:34,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.20ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 37.8MB in the beginning and 63.7MB in the end (delta: -26.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.78ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 61.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,815 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,815 INFO L158 Benchmark]: RCFGBuilder took 988.48ms. Allocated memory is still 96.5MB. Free memory was 59.0MB in the beginning and 59.3MB in the end (delta: -317.0kB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,816 INFO L158 Benchmark]: TraceAbstraction took 15052.03ms. Allocated memory was 96.5MB in the beginning and 308.3MB in the end (delta: 211.8MB). Free memory was 58.6MB in the beginning and 209.9MB in the end (delta: -151.3MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,816 INFO L158 Benchmark]: Witness Printer took 89.42ms. Allocated memory is still 308.3MB. Free memory was 209.9MB in the beginning and 195.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-09-01 09:57:34,817 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 67.1MB. Free memory was 45.7MB in the beginning and 45.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.20ms. Allocated memory was 67.1MB in the beginning and 96.5MB in the end (delta: 29.4MB). Free memory was 37.8MB in the beginning and 63.7MB in the end (delta: -26.0MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.78ms. Allocated memory is still 96.5MB. Free memory was 63.7MB in the beginning and 61.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 59.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 988.48ms. Allocated memory is still 96.5MB. Free memory was 59.0MB in the beginning and 59.3MB in the end (delta: -317.0kB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15052.03ms. Allocated memory was 96.5MB in the beginning and 308.3MB in the end (delta: 211.8MB). Free memory was 58.6MB in the beginning and 209.9MB in the end (delta: -151.3MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. * Witness Printer took 89.42ms. Allocated memory is still 308.3MB. Free memory was 209.9MB in the beginning and 195.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 118 PlacesBefore, 31 PlacesAfterwards, 109 TransitionsBefore, 22 TransitionsAfterwards, 1138 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 92 TotalNumberOfCompositions, 3228 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1291, independent: 1120, independent conditional: 0, independent unconditional: 1120, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 571, independent: 538, independent conditional: 0, independent unconditional: 538, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1291, independent: 582, independent conditional: 0, independent unconditional: 582, dependent: 138, dependent conditional: 0, dependent unconditional: 138, unknown: 571, unknown conditional: 0, unknown unconditional: 571] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={7:0}, t2217={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={7:0}, t2217={5:0}, t2218={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L827] 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) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] 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) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, 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, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] 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) [L768] EXPR 1 \read(x) [L768] 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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=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, x={3:0}, y=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, 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$$choice1=0, weak$$choice2=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, x={3:0}, y=1] [L792] 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) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] 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) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, 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$$choice1=0, weak$$choice2=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, x={3:0}, y=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=1] [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] 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) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={7:0}, t2217={5:0}, t2218={6:0}, weak$$choice1=0, weak$$choice2=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, x={3:0}, y=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=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, x={3:0}, y=1] - UnprovableResult [Line: 852]: 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: 850]: 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: 854]: 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, 148 locations, 4 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: 14.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1232 IncrementalHoareTripleChecker+Invalid, 1360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 36 mSDtfsCounter, 1232 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=9, InterpolantAutomatonStates: 49, 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.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 1670 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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! [2023-09-01 09:57:34,837 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