./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_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/safe019_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 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 --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:28,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:57:28,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:57:29,034 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:57:29,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:57:29,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:57:29,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:57:29,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:57:29,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:57:29,052 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:57:29,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:57:29,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:57:29,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:57:29,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:57:29,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:57:29,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:57:29,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:57:29,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:57:29,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:57:29,074 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:57:29,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:57:29,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:57:29,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:57:29,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:57:29,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:57:29,091 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:57:29,091 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:57:29,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:57:29,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:57:29,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:57:29,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:57:29,101 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:57:29,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:57:29,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:57:29,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:57:29,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:57:29,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:57:29,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:57:29,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:57:29,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:57:29,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:57:29,109 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:29,143 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:57:29,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:57:29,144 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:57:29,144 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:57:29,145 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:57:29,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:57:29,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:57:29,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:57:29,146 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:57:29,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:57:29,147 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:57:29,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:57:29,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:57:29,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:57:29,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:57:29,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:57:29,149 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:57:29,149 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:57:29,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:57:29,149 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:57:29,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:57:29,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:57:29,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:57:29,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:57:29,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:29,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:57:29,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:57:29,151 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:57:29,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:57:29,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:57:29,152 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:57:29,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:57:29,152 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:57:29,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:57:29,152 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:57:29,153 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 -> 2ad190c36ab064f1e4bfbebf06775e6b037058a5a86becabf7b70897d3619304 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:29,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:57:29,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:57:29,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:57:29,520 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:57:29,521 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:57:29,522 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-09-01 09:57:30,737 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:57:30,973 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:57:30,974 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-09-01 09:57:30,989 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8370542/edc3f9c236e245278a55835bac50737b/FLAG635652c76 [2023-09-01 09:57:31,004 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de8370542/edc3f9c236e245278a55835bac50737b [2023-09-01 09:57:31,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:57:31,006 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:57:31,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:31,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:57:31,011 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:57:31,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:31" (1/1) ... [2023-09-01 09:57:31,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e078c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:31, skipping insertion in model container [2023-09-01 09:57:31,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:31" (1/1) ... [2023-09-01 09:57:31,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:57:31,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:57:31,203 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/safe019_rmo.opt.i[992,1005] [2023-09-01 09:57:31,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:31,445 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:57:31,455 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/safe019_rmo.opt.i[992,1005] [2023-09-01 09:57:31,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:31,526 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:31,527 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:31,532 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:57:31,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:31 WrapperNode [2023-09-01 09:57:31,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:31,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:31,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:57:31,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:57:31,541 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:31" (1/1) ... [2023-09-01 09:57:31,574 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:31" (1/1) ... [2023-09-01 09:57:31,594 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 152 [2023-09-01 09:57:31,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:31,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:57:31,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:57:31,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:57:31,614 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:31" (1/1) ... [2023-09-01 09:57:31,614 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:31" (1/1) ... [2023-09-01 09:57:31,618 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:31" (1/1) ... [2023-09-01 09:57:31,618 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:31" (1/1) ... [2023-09-01 09:57:31,627 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:31" (1/1) ... [2023-09-01 09:57:31,629 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:31" (1/1) ... [2023-09-01 09:57:31,632 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:31" (1/1) ... [2023-09-01 09:57:31,633 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:31" (1/1) ... [2023-09-01 09:57:31,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:57:31,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:57:31,639 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:57:31,639 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:57:31,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:31" (1/1) ... [2023-09-01 09:57:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:31,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:57:31,670 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:31,708 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:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:57:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:57:31,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:57:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:57:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:57:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:57:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:57:31,732 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:57:31,732 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:57:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:57:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:57:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:57:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:57:31,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:57:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:57:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:57:31,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:57:31,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:57:31,735 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:31,940 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:57:31,942 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:57:32,469 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:57:32,726 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:57:32,726 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:57:32,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:32 BoogieIcfgContainer [2023-09-01 09:57:32,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:57:32,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:57:32,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:57:32,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:57:32,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:57:31" (1/3) ... [2023-09-01 09:57:32,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d3de89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:32, skipping insertion in model container [2023-09-01 09:57:32,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:31" (2/3) ... [2023-09-01 09:57:32,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23d3de89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:32, skipping insertion in model container [2023-09-01 09:57:32,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:32" (3/3) ... [2023-09-01 09:57:32,736 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2023-09-01 09:57:32,744 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:57:32,752 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:57:32,753 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 09:57:32,753 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:57:32,858 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:57:32,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 144 transitions, 308 flow [2023-09-01 09:57:32,993 INFO L130 PetriNetUnfolder]: 2/140 cut-off events. [2023-09-01 09:57:32,994 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:33,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 140 events. 2/140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-09-01 09:57:33,001 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 144 transitions, 308 flow [2023-09-01 09:57:33,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 126 transitions, 264 flow [2023-09-01 09:57:33,013 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:57:33,034 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 126 transitions, 264 flow [2023-09-01 09:57:33,037 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 126 transitions, 264 flow [2023-09-01 09:57:33,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 126 transitions, 264 flow [2023-09-01 09:57:33,096 INFO L130 PetriNetUnfolder]: 1/126 cut-off events. [2023-09-01 09:57:33,096 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:33,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 126 events. 1/126 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-09-01 09:57:33,101 INFO L119 LiptonReduction]: Number of co-enabled transitions 1836 [2023-09-01 09:57:39,823 INFO L134 LiptonReduction]: Checked pairs total: 4789 [2023-09-01 09:57:39,823 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-09-01 09:57:39,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:57:39,839 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;@550bce74, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:57:39,840 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:57:39,846 INFO L130 PetriNetUnfolder]: 0/23 cut-off events. [2023-09-01 09:57:39,847 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:39,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:39,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:39,848 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 2 more)] === [2023-09-01 09:57:39,853 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:39,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1552550354, now seen corresponding path program 1 times [2023-09-01 09:57:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:39,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042334713] [2023-09-01 09:57:39,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:39,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:40,574 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:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042334713] [2023-09-01 09:57:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042334713] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:40,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:40,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:57:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116416328] [2023-09-01 09:57:40,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:40,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:40,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:40,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:40,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 248 [2023-09-01 09:57:40,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:40,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:40,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 248 [2023-09-01 09:57:40,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:41,455 INFO L130 PetriNetUnfolder]: 2951/4086 cut-off events. [2023-09-01 09:57:41,455 INFO L131 PetriNetUnfolder]: For 79/79 co-relation queries the response was YES. [2023-09-01 09:57:41,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8342 conditions, 4086 events. 2951/4086 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19421 event pairs, 551 based on Foata normal form. 64/4145 useless extension candidates. Maximal degree in co-relation 8330. Up to 3423 conditions per place. [2023-09-01 09:57:41,485 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-09-01 09:57:41,486 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 183 flow [2023-09-01 09:57:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:41,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-09-01 09:57:41,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.571236559139785 [2023-09-01 09:57:41,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-09-01 09:57:41,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-09-01 09:57:41,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:41,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-09-01 09:57:41,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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:41,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:41,525 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:41,527 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 60 flow. Second operand 3 states and 425 transitions. [2023-09-01 09:57:41,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 183 flow [2023-09-01 09:57:41,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:41,533 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 64 flow [2023-09-01 09:57:41,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-09-01 09:57:41,539 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, -1 predicate places. [2023-09-01 09:57:41,540 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 64 flow [2023-09-01 09:57:41,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:41,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:41,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:41,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:57:41,544 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 2 more)] === [2023-09-01 09:57:41,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash 884419668, now seen corresponding path program 1 times [2023-09-01 09:57:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:41,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443971112] [2023-09-01 09:57:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:41,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:41,852 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:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443971112] [2023-09-01 09:57:41,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443971112] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:41,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:41,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:57:41,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780907966] [2023-09-01 09:57:41,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:41,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:41,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:41,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 248 [2023-09-01 09:57:41,866 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:41,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:41,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 248 [2023-09-01 09:57:41,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:42,663 INFO L130 PetriNetUnfolder]: 3661/5038 cut-off events. [2023-09-01 09:57:42,663 INFO L131 PetriNetUnfolder]: For 505/505 co-relation queries the response was YES. [2023-09-01 09:57:42,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11079 conditions, 5038 events. 3661/5038 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 21330 event pairs, 883 based on Foata normal form. 24/5062 useless extension candidates. Maximal degree in co-relation 11068. Up to 4495 conditions per place. [2023-09-01 09:57:42,696 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2023-09-01 09:57:42,697 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 169 flow [2023-09-01 09:57:42,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:42,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-09-01 09:57:42,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5631720430107527 [2023-09-01 09:57:42,699 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-09-01 09:57:42,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-09-01 09:57:42,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:42,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-09-01 09:57:42,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 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:42,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:42,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:42,704 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 64 flow. Second operand 3 states and 419 transitions. [2023-09-01 09:57:42,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 169 flow [2023-09-01 09:57:42,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 163 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:42,706 INFO L231 Difference]: Finished difference. Result has 37 places, 26 transitions, 79 flow [2023-09-01 09:57:42,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2023-09-01 09:57:42,707 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2023-09-01 09:57:42,707 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 79 flow [2023-09-01 09:57:42,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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:42,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:42,708 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:42,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:57:42,708 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 2 more)] === [2023-09-01 09:57:42,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:42,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1479285775, now seen corresponding path program 1 times [2023-09-01 09:57:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672434558] [2023-09-01 09:57:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:43,054 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:43,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:43,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672434558] [2023-09-01 09:57:43,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672434558] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 09:57:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416264346] [2023-09-01 09:57:43,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:43,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:43,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:43,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 248 [2023-09-01 09:57:43,066 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:43,066 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:43,066 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 248 [2023-09-01 09:57:43,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:43,877 INFO L130 PetriNetUnfolder]: 3366/4707 cut-off events. [2023-09-01 09:57:43,878 INFO L131 PetriNetUnfolder]: For 776/776 co-relation queries the response was YES. [2023-09-01 09:57:43,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10672 conditions, 4707 events. 3366/4707 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 20454 event pairs, 963 based on Foata normal form. 36/4743 useless extension candidates. Maximal degree in co-relation 10660. Up to 3712 conditions per place. [2023-09-01 09:57:43,914 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 35 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-09-01 09:57:43,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 185 flow [2023-09-01 09:57:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-09-01 09:57:43,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5739247311827957 [2023-09-01 09:57:43,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-09-01 09:57:43,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-09-01 09:57:43,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:43,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-09-01 09:57:43,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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:43,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:43,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:43,921 INFO L175 Difference]: Start difference. First operand has 37 places, 26 transitions, 79 flow. Second operand 3 states and 427 transitions. [2023-09-01 09:57:43,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 185 flow [2023-09-01 09:57:43,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 39 transitions, 181 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:43,923 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 84 flow [2023-09-01 09:57:43,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-09-01 09:57:43,924 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2023-09-01 09:57:43,924 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 84 flow [2023-09-01 09:57:43,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 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:43,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:43,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:43,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:57:43,925 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 2 more)] === [2023-09-01 09:57:43,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1386762813, now seen corresponding path program 1 times [2023-09-01 09:57:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491182142] [2023-09-01 09:57:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:44,235 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:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491182142] [2023-09-01 09:57:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491182142] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:44,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:44,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768454199] [2023-09-01 09:57:44,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:44,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 248 [2023-09-01 09:57:44,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:44,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:44,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 248 [2023-09-01 09:57:44,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:45,236 INFO L130 PetriNetUnfolder]: 4708/6553 cut-off events. [2023-09-01 09:57:45,237 INFO L131 PetriNetUnfolder]: For 1984/1984 co-relation queries the response was YES. [2023-09-01 09:57:45,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15094 conditions, 6553 events. 4708/6553 cut-off events. For 1984/1984 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 30344 event pairs, 2347 based on Foata normal form. 144/6697 useless extension candidates. Maximal degree in co-relation 15080. Up to 3773 conditions per place. [2023-09-01 09:57:45,278 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 37 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2023-09-01 09:57:45,278 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 40 transitions, 195 flow [2023-09-01 09:57:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-09-01 09:57:45,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658602150537635 [2023-09-01 09:57:45,282 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-09-01 09:57:45,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-09-01 09:57:45,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:45,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-09-01 09:57:45,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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:45,286 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:45,286 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 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:45,286 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 84 flow. Second operand 3 states and 421 transitions. [2023-09-01 09:57:45,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 40 transitions, 195 flow [2023-09-01 09:57:45,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 191 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:45,290 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 91 flow [2023-09-01 09:57:45,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-09-01 09:57:45,291 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2023-09-01 09:57:45,291 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 91 flow [2023-09-01 09:57:45,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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:45,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:45,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:45,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:57:45,292 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 2 more)] === [2023-09-01 09:57:45,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:45,293 INFO L85 PathProgramCache]: Analyzing trace with hash -349964310, now seen corresponding path program 1 times [2023-09-01 09:57:45,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:45,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920756489] [2023-09-01 09:57:45,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:45,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:45,580 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:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:45,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920756489] [2023-09-01 09:57:45,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920756489] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:45,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:45,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:45,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198098731] [2023-09-01 09:57:45,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:45,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:45,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:45,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:45,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:45,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 248 [2023-09-01 09:57:45,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 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:45,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:45,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 248 [2023-09-01 09:57:45,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:47,091 INFO L130 PetriNetUnfolder]: 7315/10204 cut-off events. [2023-09-01 09:57:47,091 INFO L131 PetriNetUnfolder]: For 4876/4876 co-relation queries the response was YES. [2023-09-01 09:57:47,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23584 conditions, 10204 events. 7315/10204 cut-off events. For 4876/4876 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 51662 event pairs, 1087 based on Foata normal form. 144/10348 useless extension candidates. Maximal degree in co-relation 23570. Up to 4849 conditions per place. [2023-09-01 09:57:47,138 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 43 selfloop transitions, 4 changer transitions 6/53 dead transitions. [2023-09-01 09:57:47,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 268 flow [2023-09-01 09:57:47,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:57:47,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:57:47,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-09-01 09:57:47,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5584677419354839 [2023-09-01 09:57:47,141 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-09-01 09:57:47,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-09-01 09:57:47,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:47,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-09-01 09:57:47,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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:47,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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:47,145 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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:47,145 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 91 flow. Second operand 4 states and 554 transitions. [2023-09-01 09:57:47,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 268 flow [2023-09-01 09:57:47,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 259 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:47,158 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 99 flow [2023-09-01 09:57:47,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-09-01 09:57:47,161 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2023-09-01 09:57:47,161 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 99 flow [2023-09-01 09:57:47,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 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:47,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:47,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:47,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:57:47,162 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 2 more)] === [2023-09-01 09:57:47,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1601980728, now seen corresponding path program 2 times [2023-09-01 09:57:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:47,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902448439] [2023-09-01 09:57:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:48,773 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:48,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:48,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902448439] [2023-09-01 09:57:48,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902448439] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:48,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:48,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866509549] [2023-09-01 09:57:48,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:48,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:48,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:48,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:48,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:48,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 248 [2023-09-01 09:57:48,887 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 26 transitions, 99 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 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:48,888 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:48,888 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 248 [2023-09-01 09:57:48,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:49,732 INFO L130 PetriNetUnfolder]: 3624/5148 cut-off events. [2023-09-01 09:57:49,733 INFO L131 PetriNetUnfolder]: For 2947/2971 co-relation queries the response was YES. [2023-09-01 09:57:49,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12357 conditions, 5148 events. 3624/5148 cut-off events. For 2947/2971 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 24717 event pairs, 2001 based on Foata normal form. 36/5148 useless extension candidates. Maximal degree in co-relation 12341. Up to 4171 conditions per place. [2023-09-01 09:57:49,765 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2023-09-01 09:57:49,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 53 transitions, 282 flow [2023-09-01 09:57:49,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:57:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:57:49,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 522 transitions. [2023-09-01 09:57:49,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5262096774193549 [2023-09-01 09:57:49,768 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 522 transitions. [2023-09-01 09:57:49,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 522 transitions. [2023-09-01 09:57:49,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:49,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 522 transitions. [2023-09-01 09:57:49,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:49,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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:49,773 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 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:49,773 INFO L175 Difference]: Start difference. First operand has 43 places, 26 transitions, 99 flow. Second operand 4 states and 522 transitions. [2023-09-01 09:57:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 53 transitions, 282 flow [2023-09-01 09:57:49,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 260 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:49,779 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 109 flow [2023-09-01 09:57:49,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2023-09-01 09:57:49,780 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2023-09-01 09:57:49,781 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 109 flow [2023-09-01 09:57:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 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:49,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:49,781 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:49,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:57:49,782 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 2 more)] === [2023-09-01 09:57:49,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:49,782 INFO L85 PathProgramCache]: Analyzing trace with hash 207010549, now seen corresponding path program 1 times [2023-09-01 09:57:49,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:49,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53812849] [2023-09-01 09:57:49,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:49,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:50,077 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:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53812849] [2023-09-01 09:57:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53812849] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:50,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:57:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872426188] [2023-09-01 09:57:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:50,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:50,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:50,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:50,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-09-01 09:57:50,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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:50,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:50,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-09-01 09:57:50,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:50,947 INFO L130 PetriNetUnfolder]: 3458/5053 cut-off events. [2023-09-01 09:57:50,947 INFO L131 PetriNetUnfolder]: For 1964/1987 co-relation queries the response was YES. [2023-09-01 09:57:50,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12290 conditions, 5053 events. 3458/5053 cut-off events. For 1964/1987 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 25728 event pairs, 610 based on Foata normal form. 389/5430 useless extension candidates. Maximal degree in co-relation 12274. Up to 3367 conditions per place. [2023-09-01 09:57:50,971 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 40 selfloop transitions, 5 changer transitions 31/78 dead transitions. [2023-09-01 09:57:50,971 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 78 transitions, 425 flow [2023-09-01 09:57:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2023-09-01 09:57:50,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5411290322580645 [2023-09-01 09:57:50,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2023-09-01 09:57:50,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2023-09-01 09:57:50,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:50,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2023-09-01 09:57:50,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 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:50,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:50,979 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:50,979 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 109 flow. Second operand 5 states and 671 transitions. [2023-09-01 09:57:50,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 78 transitions, 425 flow [2023-09-01 09:57:50,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 416 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:50,983 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 151 flow [2023-09-01 09:57:50,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2023-09-01 09:57:50,984 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 13 predicate places. [2023-09-01 09:57:50,985 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 151 flow [2023-09-01 09:57:50,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 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:50,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:50,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:50,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:57:50,986 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 2 more)] === [2023-09-01 09:57:50,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1769954921, now seen corresponding path program 1 times [2023-09-01 09:57:50,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633045331] [2023-09-01 09:57:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:51,331 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:51,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:51,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633045331] [2023-09-01 09:57:51,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633045331] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:51,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:51,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:51,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606350893] [2023-09-01 09:57:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:51,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:51,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:51,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-09-01 09:57:51,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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:51,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:51,348 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-09-01 09:57:51,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:51,863 INFO L130 PetriNetUnfolder]: 2031/3109 cut-off events. [2023-09-01 09:57:51,863 INFO L131 PetriNetUnfolder]: For 2110/2121 co-relation queries the response was YES. [2023-09-01 09:57:51,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9763 conditions, 3109 events. 2031/3109 cut-off events. For 2110/2121 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 15445 event pairs, 278 based on Foata normal form. 278/3375 useless extension candidates. Maximal degree in co-relation 9743. Up to 1225 conditions per place. [2023-09-01 09:57:51,879 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 52 selfloop transitions, 9 changer transitions 30/93 dead transitions. [2023-09-01 09:57:51,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 93 transitions, 577 flow [2023-09-01 09:57:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 806 transitions. [2023-09-01 09:57:51,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2023-09-01 09:57:51,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 806 transitions. [2023-09-01 09:57:51,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 806 transitions. [2023-09-01 09:57:51,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:51,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 806 transitions. [2023-09-01 09:57:51,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 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:51,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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:51,888 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 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:51,888 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 151 flow. Second operand 6 states and 806 transitions. [2023-09-01 09:57:51,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 93 transitions, 577 flow [2023-09-01 09:57:51,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 93 transitions, 570 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:51,902 INFO L231 Difference]: Finished difference. Result has 54 places, 36 transitions, 216 flow [2023-09-01 09:57:51,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2023-09-01 09:57:51,903 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2023-09-01 09:57:51,903 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 216 flow [2023-09-01 09:57:51,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 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:51,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:51,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:51,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:57:51,904 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 2 more)] === [2023-09-01 09:57:51,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:51,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1787334988, now seen corresponding path program 1 times [2023-09-01 09:57:51,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:51,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268408088] [2023-09-01 09:57:51,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:51,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:52,240 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:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268408088] [2023-09-01 09:57:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268408088] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:52,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:57:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809431182] [2023-09-01 09:57:52,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:52,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:52,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-09-01 09:57:52,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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:52,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:52,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-09-01 09:57:52,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:52,695 INFO L130 PetriNetUnfolder]: 1206/1893 cut-off events. [2023-09-01 09:57:52,696 INFO L131 PetriNetUnfolder]: For 2315/2320 co-relation queries the response was YES. [2023-09-01 09:57:52,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6773 conditions, 1893 events. 1206/1893 cut-off events. For 2315/2320 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8784 event pairs, 214 based on Foata normal form. 115/1996 useless extension candidates. Maximal degree in co-relation 6750. Up to 711 conditions per place. [2023-09-01 09:57:52,708 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 62 selfloop transitions, 13 changer transitions 27/104 dead transitions. [2023-09-01 09:57:52,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 104 transitions, 728 flow [2023-09-01 09:57:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:57:52,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:57:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 941 transitions. [2023-09-01 09:57:52,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5420506912442397 [2023-09-01 09:57:52,712 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 941 transitions. [2023-09-01 09:57:52,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 941 transitions. [2023-09-01 09:57:52,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:52,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 941 transitions. [2023-09-01 09:57:52,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.42857142857142) internal successors, (941), 7 states have internal predecessors, (941), 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:52,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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:52,721 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 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:52,721 INFO L175 Difference]: Start difference. First operand has 54 places, 36 transitions, 216 flow. Second operand 7 states and 941 transitions. [2023-09-01 09:57:52,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 104 transitions, 728 flow [2023-09-01 09:57:52,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 104 transitions, 666 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:52,739 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 266 flow [2023-09-01 09:57:52,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-09-01 09:57:52,740 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 20 predicate places. [2023-09-01 09:57:52,741 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 266 flow [2023-09-01 09:57:52,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 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:52,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:52,741 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, 1] [2023-09-01 09:57:52,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:57:52,742 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 2 more)] === [2023-09-01 09:57:52,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash -654664038, now seen corresponding path program 1 times [2023-09-01 09:57:52,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:52,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062123044] [2023-09-01 09:57:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:55,850 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:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:55,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062123044] [2023-09-01 09:57:55,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062123044] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:55,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:55,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-09-01 09:57:55,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978072712] [2023-09-01 09:57:55,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:55,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-09-01 09:57:55,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:55,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-09-01 09:57:55,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-09-01 09:57:56,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2023-09-01 09:57:56,095 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 40 transitions, 266 flow. Second operand has 11 states, 11 states have (on average 118.9090909090909) internal successors, (1308), 11 states have internal predecessors, (1308), 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:56,095 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:56,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2023-09-01 09:57:56,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:57,778 INFO L130 PetriNetUnfolder]: 4455/7102 cut-off events. [2023-09-01 09:57:57,779 INFO L131 PetriNetUnfolder]: For 12380/12384 co-relation queries the response was YES. [2023-09-01 09:57:57,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25278 conditions, 7102 events. 4455/7102 cut-off events. For 12380/12384 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 45110 event pairs, 848 based on Foata normal form. 26/7102 useless extension candidates. Maximal degree in co-relation 25254. Up to 1889 conditions per place. [2023-09-01 09:57:57,819 INFO L137 encePairwiseOnDemand]: 240/248 looper letters, 143 selfloop transitions, 17 changer transitions 92/254 dead transitions. [2023-09-01 09:57:57,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 254 transitions, 2361 flow [2023-09-01 09:57:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-09-01 09:57:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-09-01 09:57:57,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1544 transitions. [2023-09-01 09:57:57,824 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188172043010753 [2023-09-01 09:57:57,824 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1544 transitions. [2023-09-01 09:57:57,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1544 transitions. [2023-09-01 09:57:57,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:57,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1544 transitions. [2023-09-01 09:57:57,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 128.66666666666666) internal successors, (1544), 12 states have internal predecessors, (1544), 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:57,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 248.0) internal successors, (3224), 13 states have internal predecessors, (3224), 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:57,836 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 248.0) internal successors, (3224), 13 states have internal predecessors, (3224), 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:57,837 INFO L175 Difference]: Start difference. First operand has 57 places, 40 transitions, 266 flow. Second operand 12 states and 1544 transitions. [2023-09-01 09:57:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 254 transitions, 2361 flow [2023-09-01 09:57:58,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 254 transitions, 1895 flow, removed 160 selfloop flow, removed 5 redundant places. [2023-09-01 09:57:58,069 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 356 flow [2023-09-01 09:57:58,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=356, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-09-01 09:57:58,070 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2023-09-01 09:57:58,070 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 356 flow [2023-09-01 09:57:58,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 118.9090909090909) internal successors, (1308), 11 states have internal predecessors, (1308), 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:58,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:58,072 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, 1] [2023-09-01 09:57:58,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:57:58,072 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 2 more)] === [2023-09-01 09:57:58,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:58,073 INFO L85 PathProgramCache]: Analyzing trace with hash -681066232, now seen corresponding path program 2 times [2023-09-01 09:57:58,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:58,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779499419] [2023-09-01 09:57:58,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:58,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:59,834 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:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:59,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779499419] [2023-09-01 09:57:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779499419] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:57:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647405868] [2023-09-01 09:57:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:59,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:57:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:57:59,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:57:59,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 248 [2023-09-01 09:57:59,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 356 flow. Second operand has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:59,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:59,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 248 [2023-09-01 09:57:59,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:00,878 INFO L130 PetriNetUnfolder]: 4323/6902 cut-off events. [2023-09-01 09:58:00,878 INFO L131 PetriNetUnfolder]: For 12453/12460 co-relation queries the response was YES. [2023-09-01 09:58:00,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24075 conditions, 6902 events. 4323/6902 cut-off events. For 12453/12460 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 43423 event pairs, 1692 based on Foata normal form. 1/6847 useless extension candidates. Maximal degree in co-relation 24044. Up to 3936 conditions per place. [2023-09-01 09:58:00,909 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 74 selfloop transitions, 11 changer transitions 19/106 dead transitions. [2023-09-01 09:58:00,909 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 924 flow [2023-09-01 09:58:00,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:58:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:58:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions. [2023-09-01 09:58:00,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153225806451613 [2023-09-01 09:58:00,919 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions. [2023-09-01 09:58:00,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions. [2023-09-01 09:58:00,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:00,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions. [2023-09-01 09:58:00,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 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:58:00,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:00,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:00,926 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 356 flow. Second operand 5 states and 639 transitions. [2023-09-01 09:58:00,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 924 flow [2023-09-01 09:58:01,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 899 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-09-01 09:58:01,064 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 423 flow [2023-09-01 09:58:01,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2023-09-01 09:58:01,065 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2023-09-01 09:58:01,065 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 423 flow [2023-09-01 09:58:01,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:58:01,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:01,065 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, 1] [2023-09-01 09:58:01,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:58:01,066 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:01,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash -778472278, now seen corresponding path program 3 times [2023-09-01 09:58:01,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:01,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445155243] [2023-09-01 09:58:01,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:02,769 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:58:02,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:02,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445155243] [2023-09-01 09:58:02,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445155243] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:02,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:02,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-09-01 09:58:02,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972207778] [2023-09-01 09:58:02,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:02,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-09-01 09:58:02,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:02,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-09-01 09:58:02,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-09-01 09:58:02,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 248 [2023-09-01 09:58:02,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 423 flow. Second operand has 9 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 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:58:02,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:02,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 248 [2023-09-01 09:58:02,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:03,787 INFO L130 PetriNetUnfolder]: 4100/6539 cut-off events. [2023-09-01 09:58:03,787 INFO L131 PetriNetUnfolder]: For 14840/14842 co-relation queries the response was YES. [2023-09-01 09:58:03,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23358 conditions, 6539 events. 4100/6539 cut-off events. For 14840/14842 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 40576 event pairs, 1481 based on Foata normal form. 17/6520 useless extension candidates. Maximal degree in co-relation 23327. Up to 3383 conditions per place. [2023-09-01 09:58:03,837 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 66 selfloop transitions, 10 changer transitions 26/104 dead transitions. [2023-09-01 09:58:03,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 104 transitions, 897 flow [2023-09-01 09:58:03,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:58:03,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:58:03,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-09-01 09:58:03,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5129032258064516 [2023-09-01 09:58:03,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-09-01 09:58:03,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-09-01 09:58:03,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:03,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-09-01 09:58:03,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 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:58:03,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:03,844 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:03,844 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 423 flow. Second operand 5 states and 636 transitions. [2023-09-01 09:58:03,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 104 transitions, 897 flow [2023-09-01 09:58:03,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 104 transitions, 882 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-09-01 09:58:03,970 INFO L231 Difference]: Finished difference. Result has 73 places, 58 transitions, 458 flow [2023-09-01 09:58:03,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=458, PETRI_PLACES=73, PETRI_TRANSITIONS=58} [2023-09-01 09:58:03,971 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2023-09-01 09:58:03,971 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 58 transitions, 458 flow [2023-09-01 09:58:03,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.33333333333333) internal successors, (1074), 9 states have internal predecessors, (1074), 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:58:03,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:03,973 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, 1, 1] [2023-09-01 09:58:03,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:58:03,973 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:03,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:03,974 INFO L85 PathProgramCache]: Analyzing trace with hash 18936920, now seen corresponding path program 1 times [2023-09-01 09:58:03,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:03,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578717375] [2023-09-01 09:58:03,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:04,242 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:58:04,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578717375] [2023-09-01 09:58:04,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578717375] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:04,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:04,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:58:04,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633782036] [2023-09-01 09:58:04,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:04,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:58:04,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:04,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:58:04,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:58:04,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 248 [2023-09-01 09:58:04,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 58 transitions, 458 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:58:04,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:04,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 248 [2023-09-01 09:58:04,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:05,224 INFO L130 PetriNetUnfolder]: 5425/8659 cut-off events. [2023-09-01 09:58:05,225 INFO L131 PetriNetUnfolder]: For 27509/27509 co-relation queries the response was YES. [2023-09-01 09:58:05,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32346 conditions, 8659 events. 5425/8659 cut-off events. For 27509/27509 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 56131 event pairs, 967 based on Foata normal form. 19/8678 useless extension candidates. Maximal degree in co-relation 32312. Up to 2673 conditions per place. [2023-09-01 09:58:05,305 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 66 selfloop transitions, 3 changer transitions 91/160 dead transitions. [2023-09-01 09:58:05,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 160 transitions, 1569 flow [2023-09-01 09:58:05,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:58:05,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:58:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2023-09-01 09:58:05,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2023-09-01 09:58:05,308 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2023-09-01 09:58:05,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2023-09-01 09:58:05,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:05,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2023-09-01 09:58:05,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 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:58:05,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:05,313 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 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:58:05,313 INFO L175 Difference]: Start difference. First operand has 73 places, 58 transitions, 458 flow. Second operand 5 states and 690 transitions. [2023-09-01 09:58:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 160 transitions, 1569 flow [2023-09-01 09:58:05,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 160 transitions, 1530 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:58:05,471 INFO L231 Difference]: Finished difference. Result has 75 places, 57 transitions, 450 flow [2023-09-01 09:58:05,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=450, PETRI_PLACES=75, PETRI_TRANSITIONS=57} [2023-09-01 09:58:05,472 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 38 predicate places. [2023-09-01 09:58:05,472 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 57 transitions, 450 flow [2023-09-01 09:58:05,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 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:58:05,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:05,473 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, 1, 1] [2023-09-01 09:58:05,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:58:05,473 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:05,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:05,474 INFO L85 PathProgramCache]: Analyzing trace with hash -2038091944, now seen corresponding path program 2 times [2023-09-01 09:58:05,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:05,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602073163] [2023-09-01 09:58:05,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:05,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:58:05,814 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:58:05,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:58:05,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602073163] [2023-09-01 09:58:05,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602073163] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:58:05,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:58:05,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:58:05,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000843990] [2023-09-01 09:58:05,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:58:05,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:58:05,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:58:05,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:58:05,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:58:05,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 248 [2023-09-01 09:58:05,833 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 57 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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:58:05,833 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:58:05,833 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 248 [2023-09-01 09:58:05,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:58:06,388 INFO L130 PetriNetUnfolder]: 2399/3958 cut-off events. [2023-09-01 09:58:06,389 INFO L131 PetriNetUnfolder]: For 10592/10608 co-relation queries the response was YES. [2023-09-01 09:58:06,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14927 conditions, 3958 events. 2399/3958 cut-off events. For 10592/10608 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24368 event pairs, 418 based on Foata normal form. 84/4016 useless extension candidates. Maximal degree in co-relation 14894. Up to 1536 conditions per place. [2023-09-01 09:58:06,402 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 45 selfloop transitions, 17 changer transitions 69/132 dead transitions. [2023-09-01 09:58:06,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 1318 flow [2023-09-01 09:58:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-09-01 09:58:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-09-01 09:58:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1046 transitions. [2023-09-01 09:58:06,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272177419354839 [2023-09-01 09:58:06,405 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1046 transitions. [2023-09-01 09:58:06,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1046 transitions. [2023-09-01 09:58:06,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:58:06,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1046 transitions. [2023-09-01 09:58:06,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 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:58:06,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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:58:06,411 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 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:58:06,412 INFO L175 Difference]: Start difference. First operand has 75 places, 57 transitions, 450 flow. Second operand 8 states and 1046 transitions. [2023-09-01 09:58:06,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 1318 flow [2023-09-01 09:58:06,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 132 transitions, 1231 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-09-01 09:58:06,481 INFO L231 Difference]: Finished difference. Result has 77 places, 39 transitions, 283 flow [2023-09-01 09:58:06,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=283, PETRI_PLACES=77, PETRI_TRANSITIONS=39} [2023-09-01 09:58:06,482 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2023-09-01 09:58:06,482 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 39 transitions, 283 flow [2023-09-01 09:58:06,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 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:58:06,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:58:06,483 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, 1, 1, 1, 1] [2023-09-01 09:58:06,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:58:06,483 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:58:06,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:58:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash -458953910, now seen corresponding path program 1 times [2023-09-01 09:58:06,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:58:06,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498464170] [2023-09-01 09:58:06,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:58:06,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:58:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:58:06,564 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:58:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:58:06,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:58:06,678 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:58:06,679 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:58:06,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-01 09:58:06,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:58:06,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:58:06,681 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-09-01 09:58:06,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 09:58:06,682 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:58:06,687 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:58:06,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:58:06,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:58:06 BasicIcfg [2023-09-01 09:58:06,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:58:06,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:58:06,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:58:06,765 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:58:06,766 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:32" (3/4) ... [2023-09-01 09:58:06,767 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:58:06,870 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:58:06,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:58:06,871 INFO L158 Benchmark]: Toolchain (without parser) took 35864.81ms. Allocated memory was 62.9MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 39.2MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 409.7MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,871 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 52.4MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:58:06,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.06ms. Allocated memory is still 62.9MB. Free memory was 39.1MB in the beginning and 29.5MB in the end (delta: 9.6MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.40ms. Allocated memory is still 62.9MB. Free memory was 29.2MB in the beginning and 26.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,872 INFO L158 Benchmark]: Boogie Preprocessor took 42.71ms. Allocated memory is still 62.9MB. Free memory was 26.7MB in the beginning and 40.2MB in the end (delta: -13.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,873 INFO L158 Benchmark]: RCFGBuilder took 1090.19ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.2MB in the beginning and 34.4MB in the end (delta: 5.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,873 INFO L158 Benchmark]: TraceAbstraction took 34034.70ms. Allocated memory was 75.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 33.9MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 365.5MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,873 INFO L158 Benchmark]: Witness Printer took 105.45ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-09-01 09:58:06,875 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.20ms. Allocated memory is still 52.4MB. Free memory was 30.3MB in the beginning and 30.3MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 526.06ms. Allocated memory is still 62.9MB. Free memory was 39.1MB in the beginning and 29.5MB in the end (delta: 9.6MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.40ms. Allocated memory is still 62.9MB. Free memory was 29.2MB in the beginning and 26.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.71ms. Allocated memory is still 62.9MB. Free memory was 26.7MB in the beginning and 40.2MB in the end (delta: -13.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * RCFGBuilder took 1090.19ms. Allocated memory was 62.9MB in the beginning and 75.5MB in the end (delta: 12.6MB). Free memory was 40.2MB in the beginning and 34.4MB in the end (delta: 5.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * TraceAbstraction took 34034.70ms. Allocated memory was 75.5MB in the beginning and 1.9GB in the end (delta: 1.8GB). Free memory was 33.9MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 365.5MB. Max. memory is 16.1GB. * Witness Printer took 105.45ms. Allocated memory is still 1.9GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 22.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 138 PlacesBefore, 37 PlacesAfterwards, 126 TransitionsBefore, 24 TransitionsAfterwards, 1836 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 104 TotalNumberOfCompositions, 4789 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1657, independent: 1451, independent conditional: 0, independent unconditional: 1451, dependent: 206, dependent conditional: 0, dependent unconditional: 206, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 938, independent: 894, independent conditional: 0, independent unconditional: 894, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1657, independent: 557, independent conditional: 0, independent unconditional: 557, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 938, unknown conditional: 0, unknown unconditional: 938] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((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_buff0_thd4=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$r_buff1_thd4=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(&t2245, ((void *)0), P0, ((void *)0))=-3, t2245={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((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_buff0_thd4=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$r_buff1_thd4=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(&t2246, ((void *)0), P1, ((void *)0))=-2, t2245={7:0}, t2246={8: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((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_buff0_thd4=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$r_buff1_thd4=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(&t2247, ((void *)0), P2, ((void *)0))=-1, t2245={7:0}, t2246={8:0}, t2247={9: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L877] 0 pthread_t t2248; [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] 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) [L815] EXPR 3 \read(x) [L815] 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) [L815] 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) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] 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)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 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_buff0_thd4=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$r_buff1_thd4=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L829] 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_buff0_thd4=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$r_buff1_thd4=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L832] 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) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] 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) [L832] 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) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 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 [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 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_buff0_thd4=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$r_buff1_thd4=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((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_buff0_thd4=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$r_buff1_thd4=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, pthread_create(&t2248, ((void *)0), P3, ((void *)0))=0, t2245={7:0}, t2246={8:0}, t2247={9:0}, t2248={5: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L846] 4 y = 2 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_buff0_thd4=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$r_buff1_thd4=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=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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] 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) [L773] EXPR 1 \read(x) [L773] 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) [L773] 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) [L774] 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)) [L775] 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)) [L776] 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)) [L777] 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)) [L778] 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)) [L779] 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)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L797] 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) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] 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) [L797] 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) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 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 [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 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=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 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) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] 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) [L884] 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) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 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 [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={7:0}, t2246={8:0}, t2247={9:0}, t2248={5: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __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_buff0_thd4=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$r_buff1_thd4=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}, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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=2] - UnprovableResult [Line: 874]: 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: 878]: 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: 872]: 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: 876]: 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 9 procedures, 176 locations, 5 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: 33.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 946 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 775 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 400 mSDsCounter, 335 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2156 IncrementalHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 335 mSolverCounterUnsat, 24 mSDtfsCounter, 2156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=12, InterpolantAutomatonStates: 73, 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.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.4s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 3306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:58:06,906 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