./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.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/thin002_power.oepc.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 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 --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:59:19,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:59:19,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:59:19,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:59:19,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:59:19,540 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:59:19,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:59:19,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:59:19,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:59:19,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:59:19,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:59:19,555 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:59:19,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:59:19,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:59:19,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:59:19,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:59:19,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:59:19,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:59:19,565 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:59:19,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:59:19,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:59:19,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:59:19,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:59:19,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:59:19,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:59:19,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:59:19,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:59:19,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:59:19,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:59:19,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:59:19,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:59:19,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:59:19,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:59:19,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:59:19,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:59:19,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:59:19,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:59:19,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:59:19,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:59:19,588 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:59:19,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:59:19,596 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:59:19,627 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:59:19,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:59:19,628 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:59:19,628 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:59:19,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:59:19,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:59:19,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:59:19,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:59:19,629 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:59:19,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:59:19,630 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:59:19,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:59:19,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:59:19,632 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:59:19,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:59:19,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:59:19,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:59:19,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:59:19,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:19,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:59:19,633 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:59:19,634 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:59:19,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:59:19,634 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:59:19,634 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 -> 8cac3035eaeb2816ec7d27d980ff4447cc10ff3a409a1a8662d4bf55d93fe6d5 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:59:19,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:59:19,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:59:19,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:59:19,899 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:59:19,899 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:59:19,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2023-09-01 09:59:20,866 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:59:21,092 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:59:21,094 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2023-09-01 09:59:21,105 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ea373c9/de1467a66e3b4c23badbb65e9570090e/FLAG0b4ff5aa4 [2023-09-01 09:59:21,114 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9ea373c9/de1467a66e3b4c23badbb65e9570090e [2023-09-01 09:59:21,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:59:21,116 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:59:21,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:21,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:59:21,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:59:21,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47051933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21, skipping insertion in model container [2023-09-01 09:59:21,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,127 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:59:21,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:59:21,241 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/thin002_power.oepc.i[995,1008] [2023-09-01 09:59:21,432 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:21,439 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:59:21,448 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/thin002_power.oepc.i[995,1008] [2023-09-01 09:59:21,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:59:21,519 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:21,520 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:59:21,524 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:59:21,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21 WrapperNode [2023-09-01 09:59:21,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:59:21,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:21,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:59:21,532 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:59:21,537 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:59:21" (1/1) ... [2023-09-01 09:59:21,579 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:59:21" (1/1) ... [2023-09-01 09:59:21,600 INFO L138 Inliner]: procedures = 177, calls = 82, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2023-09-01 09:59:21,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:59:21,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:59:21,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:59:21,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:59:21,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,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:59:21" (1/1) ... [2023-09-01 09:59:21,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,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:59:21" (1/1) ... [2023-09-01 09:59:21,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:59:21" (1/1) ... [2023-09-01 09:59:21,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:59:21,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:59:21,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:59:21,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:59:21,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (1/1) ... [2023-09-01 09:59:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:59:21,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:59:21,667 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:59:21,683 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:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:59:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:59:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:59:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:59:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:59:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:59:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:59:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:59:21,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:59:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:59:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:59:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:59:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:59:21,694 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:59:21,819 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:59:21,838 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:59:22,185 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:59:22,409 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:59:22,410 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:59:22,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:22 BoogieIcfgContainer [2023-09-01 09:59:22,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:59:22,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:59:22,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:59:22,415 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:59:22,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:59:21" (1/3) ... [2023-09-01 09:59:22,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3222a1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:22, skipping insertion in model container [2023-09-01 09:59:22,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:59:21" (2/3) ... [2023-09-01 09:59:22,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3222a1c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:59:22, skipping insertion in model container [2023-09-01 09:59:22,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:22" (3/3) ... [2023-09-01 09:59:22,417 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2023-09-01 09:59:22,422 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:59:22,428 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:59:22,428 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 09:59:22,428 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:59:22,485 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:59:22,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2023-09-01 09:59:22,557 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2023-09-01 09:59:22,557 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:22,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2023-09-01 09:59:22,569 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 147 transitions, 314 flow [2023-09-01 09:59:22,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 129 transitions, 270 flow [2023-09-01 09:59:22,574 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:59:22,580 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 129 transitions, 270 flow [2023-09-01 09:59:22,581 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 129 transitions, 270 flow [2023-09-01 09:59:22,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 129 transitions, 270 flow [2023-09-01 09:59:22,616 INFO L130 PetriNetUnfolder]: 1/129 cut-off events. [2023-09-01 09:59:22,617 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:22,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 129 events. 1/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2023-09-01 09:59:22,623 INFO L119 LiptonReduction]: Number of co-enabled transitions 1822 [2023-09-01 09:59:28,785 INFO L134 LiptonReduction]: Checked pairs total: 5161 [2023-09-01 09:59:28,786 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-09-01 09:59:28,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:59:28,798 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;@133bcdd1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:59:28,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:59:28,804 INFO L130 PetriNetUnfolder]: 1/26 cut-off events. [2023-09-01 09:59:28,804 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:59:28,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:28,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:28,805 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:59:28,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash -496138280, now seen corresponding path program 1 times [2023-09-01 09:59:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273973387] [2023-09-01 09:59:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:29,364 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:59:29,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:29,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273973387] [2023-09-01 09:59:29,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273973387] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:29,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:29,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:29,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200581266] [2023-09-01 09:59:29,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:29,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:29,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 254 [2023-09-01 09:59:29,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:59:29,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:29,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 254 [2023-09-01 09:59:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:29,902 INFO L130 PetriNetUnfolder]: 1814/2713 cut-off events. [2023-09-01 09:59:29,902 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-09-01 09:59:29,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5376 conditions, 2713 events. 1814/2713 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 14107 event pairs, 639 based on Foata normal form. 216/2808 useless extension candidates. Maximal degree in co-relation 5364. Up to 1773 conditions per place. [2023-09-01 09:59:29,915 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 32 selfloop transitions, 2 changer transitions 19/57 dead transitions. [2023-09-01 09:59:29,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 57 transitions, 238 flow [2023-09-01 09:59:29,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:29,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-09-01 09:59:29,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568503937007874 [2023-09-01 09:59:29,931 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-09-01 09:59:29,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-09-01 09:59:29,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:29,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-09-01 09:59:29,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 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:59:29,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:29,951 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:29,952 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 5 states and 722 transitions. [2023-09-01 09:59:29,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 57 transitions, 238 flow [2023-09-01 09:59:29,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:29,957 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 70 flow [2023-09-01 09:59:29,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, 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=5, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2023-09-01 09:59:29,961 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-09-01 09:59:29,961 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 70 flow [2023-09-01 09:59:29,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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:59:29,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:29,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:29,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:59:29,963 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:59:29,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:29,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1799537742, now seen corresponding path program 1 times [2023-09-01 09:59:29,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:29,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365895156] [2023-09-01 09:59:29,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:29,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:30,255 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:59:30,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:30,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365895156] [2023-09-01 09:59:30,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365895156] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:30,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:30,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:30,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231097986] [2023-09-01 09:59:30,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:30,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:30,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:30,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 70 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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:59:30,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:30,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:30,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:30,795 INFO L130 PetriNetUnfolder]: 2107/3150 cut-off events. [2023-09-01 09:59:30,796 INFO L131 PetriNetUnfolder]: For 402/402 co-relation queries the response was YES. [2023-09-01 09:59:30,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6899 conditions, 3150 events. 2107/3150 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17544 event pairs, 617 based on Foata normal form. 96/3220 useless extension candidates. Maximal degree in co-relation 6886. Up to 941 conditions per place. [2023-09-01 09:59:30,804 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 44 selfloop transitions, 3 changer transitions 20/70 dead transitions. [2023-09-01 09:59:30,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 70 transitions, 311 flow [2023-09-01 09:59:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:30,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2023-09-01 09:59:30,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5610236220472441 [2023-09-01 09:59:30,807 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2023-09-01 09:59:30,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2023-09-01 09:59:30,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:30,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2023-09-01 09:59:30,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 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:59:30,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:30,813 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:30,813 INFO L175 Difference]: Start difference. First operand has 42 places, 25 transitions, 70 flow. Second operand 6 states and 855 transitions. [2023-09-01 09:59:30,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 70 transitions, 311 flow [2023-09-01 09:59:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 70 transitions, 301 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:30,820 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 80 flow [2023-09-01 09:59:30,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-09-01 09:59:30,820 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-09-01 09:59:30,820 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 80 flow [2023-09-01 09:59:30,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 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:59:30,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:30,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:30,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:59:30,822 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:59:30,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:30,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1815950317, now seen corresponding path program 1 times [2023-09-01 09:59:30,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:30,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227139598] [2023-09-01 09:59:30,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:30,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:31,058 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:59:31,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:31,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227139598] [2023-09-01 09:59:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227139598] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:31,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:31,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928860319] [2023-09-01 09:59:31,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:31,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:31,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:31,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:31,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:31,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 254 [2023-09-01 09:59:31,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 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:59:31,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:31,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 254 [2023-09-01 09:59:31,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:31,259 INFO L130 PetriNetUnfolder]: 886/1446 cut-off events. [2023-09-01 09:59:31,259 INFO L131 PetriNetUnfolder]: For 483/483 co-relation queries the response was YES. [2023-09-01 09:59:31,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3306 conditions, 1446 events. 886/1446 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7629 event pairs, 200 based on Foata normal form. 48/1484 useless extension candidates. Maximal degree in co-relation 3291. Up to 895 conditions per place. [2023-09-01 09:59:31,266 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 30 selfloop transitions, 2 changer transitions 13/49 dead transitions. [2023-09-01 09:59:31,266 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 230 flow [2023-09-01 09:59:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-09-01 09:59:31,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5606299212598426 [2023-09-01 09:59:31,269 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-09-01 09:59:31,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-09-01 09:59:31,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:31,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-09-01 09:59:31,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 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:59:31,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:31,274 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:31,274 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 80 flow. Second operand 5 states and 712 transitions. [2023-09-01 09:59:31,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 230 flow [2023-09-01 09:59:31,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 208 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-09-01 09:59:31,277 INFO L231 Difference]: Finished difference. Result has 43 places, 25 transitions, 76 flow [2023-09-01 09:59:31,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=43, PETRI_TRANSITIONS=25} [2023-09-01 09:59:31,279 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-09-01 09:59:31,281 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 25 transitions, 76 flow [2023-09-01 09:59:31,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 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:59:31,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:31,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:31,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:59:31,282 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:59:31,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:31,283 INFO L85 PathProgramCache]: Analyzing trace with hash 404932490, now seen corresponding path program 1 times [2023-09-01 09:59:31,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:31,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035809099] [2023-09-01 09:59:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:31,534 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:59:31,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:31,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035809099] [2023-09-01 09:59:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035809099] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:31,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:31,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:31,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006304696] [2023-09-01 09:59:31,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:31,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:31,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:31,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:31,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:31,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 254 [2023-09-01 09:59:31,544 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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:59:31,544 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:31,545 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 254 [2023-09-01 09:59:31,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:31,706 INFO L130 PetriNetUnfolder]: 810/1288 cut-off events. [2023-09-01 09:59:31,706 INFO L131 PetriNetUnfolder]: For 361/361 co-relation queries the response was YES. [2023-09-01 09:59:31,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2962 conditions, 1288 events. 810/1288 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6313 event pairs, 222 based on Foata normal form. 32/1310 useless extension candidates. Maximal degree in co-relation 2948. Up to 810 conditions per place. [2023-09-01 09:59:31,711 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 27 selfloop transitions, 2 changer transitions 10/43 dead transitions. [2023-09-01 09:59:31,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 199 flow [2023-09-01 09:59:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 706 transitions. [2023-09-01 09:59:31,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5559055118110237 [2023-09-01 09:59:31,713 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 706 transitions. [2023-09-01 09:59:31,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 706 transitions. [2023-09-01 09:59:31,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:31,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 706 transitions. [2023-09-01 09:59:31,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.2) internal successors, (706), 5 states have internal predecessors, (706), 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:59:31,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:31,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:31,718 INFO L175 Difference]: Start difference. First operand has 43 places, 25 transitions, 76 flow. Second operand 5 states and 706 transitions. [2023-09-01 09:59:31,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 199 flow [2023-09-01 09:59:31,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 43 transitions, 189 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:31,719 INFO L231 Difference]: Finished difference. Result has 44 places, 25 transitions, 80 flow [2023-09-01 09:59:31,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2023-09-01 09:59:31,720 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 5 predicate places. [2023-09-01 09:59:31,720 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 25 transitions, 80 flow [2023-09-01 09:59:31,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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:59:31,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:31,721 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:59:31,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:59:31,721 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:59:31,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:31,721 INFO L85 PathProgramCache]: Analyzing trace with hash 2117121526, now seen corresponding path program 1 times [2023-09-01 09:59:31,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:31,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860644018] [2023-09-01 09:59:31,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:31,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:31,894 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:59:31,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860644018] [2023-09-01 09:59:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860644018] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:31,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:31,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244041951] [2023-09-01 09:59:31,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:31,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:31,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:31,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:31,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:31,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 25 transitions, 80 flow. Second operand has 5 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:59:31,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:31,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:31,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:32,168 INFO L130 PetriNetUnfolder]: 1272/1953 cut-off events. [2023-09-01 09:59:32,169 INFO L131 PetriNetUnfolder]: For 536/536 co-relation queries the response was YES. [2023-09-01 09:59:32,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4582 conditions, 1953 events. 1272/1953 cut-off events. For 536/536 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9719 event pairs, 464 based on Foata normal form. 36/1968 useless extension candidates. Maximal degree in co-relation 4567. Up to 667 conditions per place. [2023-09-01 09:59:32,178 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 38 selfloop transitions, 3 changer transitions 15/59 dead transitions. [2023-09-01 09:59:32,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 285 flow [2023-09-01 09:59:32,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2023-09-01 09:59:32,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5538057742782152 [2023-09-01 09:59:32,181 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 844 transitions. [2023-09-01 09:59:32,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 844 transitions. [2023-09-01 09:59:32,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:32,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 844 transitions. [2023-09-01 09:59:32,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 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:59:32,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:32,185 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:32,185 INFO L175 Difference]: Start difference. First operand has 44 places, 25 transitions, 80 flow. Second operand 6 states and 844 transitions. [2023-09-01 09:59:32,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 285 flow [2023-09-01 09:59:32,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 273 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:59:32,188 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 90 flow [2023-09-01 09:59:32,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-09-01 09:59:32,189 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-09-01 09:59:32,189 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 90 flow [2023-09-01 09:59:32,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:59:32,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:32,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:32,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:59:32,190 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:59:32,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1683082042, now seen corresponding path program 1 times [2023-09-01 09:59:32,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:32,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807028802] [2023-09-01 09:59:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:32,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:32,410 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:59:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807028802] [2023-09-01 09:59:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807028802] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741037881] [2023-09-01 09:59:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:32,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:32,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:32,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 90 flow. Second operand has 5 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:59:32,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:32,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:32,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:32,623 INFO L130 PetriNetUnfolder]: 884/1363 cut-off events. [2023-09-01 09:59:32,623 INFO L131 PetriNetUnfolder]: For 984/986 co-relation queries the response was YES. [2023-09-01 09:59:32,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 1363 events. 884/1363 cut-off events. For 984/986 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5849 event pairs, 332 based on Foata normal form. 36/1387 useless extension candidates. Maximal degree in co-relation 3358. Up to 475 conditions per place. [2023-09-01 09:59:32,627 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 30 selfloop transitions, 3 changer transitions 17/53 dead transitions. [2023-09-01 09:59:32,627 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 269 flow [2023-09-01 09:59:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:32,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:32,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 838 transitions. [2023-09-01 09:59:32,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5498687664041995 [2023-09-01 09:59:32,629 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 838 transitions. [2023-09-01 09:59:32,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 838 transitions. [2023-09-01 09:59:32,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:32,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 838 transitions. [2023-09-01 09:59:32,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 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:59:32,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:32,633 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:32,633 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 90 flow. Second operand 6 states and 838 transitions. [2023-09-01 09:59:32,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 269 flow [2023-09-01 09:59:32,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 237 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-09-01 09:59:32,637 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 88 flow [2023-09-01 09:59:32,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-09-01 09:59:32,639 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 8 predicate places. [2023-09-01 09:59:32,639 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 88 flow [2023-09-01 09:59:32,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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:59:32,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:32,640 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:59:32,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:59:32,640 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:59:32,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:32,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2131736476, now seen corresponding path program 1 times [2023-09-01 09:59:32,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:32,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660224356] [2023-09-01 09:59:32,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:32,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:32,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:33,539 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:59:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660224356] [2023-09-01 09:59:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660224356] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:59:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312706765] [2023-09-01 09:59:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:33,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:59:33,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:33,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:59:33,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:59:33,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 254 [2023-09-01 09:59:33,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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:59:33,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:33,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 254 [2023-09-01 09:59:33,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:33,797 INFO L130 PetriNetUnfolder]: 486/801 cut-off events. [2023-09-01 09:59:33,797 INFO L131 PetriNetUnfolder]: For 446/446 co-relation queries the response was YES. [2023-09-01 09:59:33,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 801 events. 486/801 cut-off events. For 446/446 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2860 event pairs, 122 based on Foata normal form. 32/833 useless extension candidates. Maximal degree in co-relation 1936. Up to 381 conditions per place. [2023-09-01 09:59:33,800 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 32 selfloop transitions, 3 changer transitions 10/48 dead transitions. [2023-09-01 09:59:33,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 48 transitions, 238 flow [2023-09-01 09:59:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2023-09-01 09:59:33,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5150918635170604 [2023-09-01 09:59:33,802 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2023-09-01 09:59:33,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2023-09-01 09:59:33,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:33,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2023-09-01 09:59:33,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 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:59:33,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:33,805 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:33,805 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 88 flow. Second operand 6 states and 785 transitions. [2023-09-01 09:59:33,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 48 transitions, 238 flow [2023-09-01 09:59:33,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 212 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-09-01 09:59:33,807 INFO L231 Difference]: Finished difference. Result has 46 places, 25 transitions, 82 flow [2023-09-01 09:59:33,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=46, PETRI_TRANSITIONS=25} [2023-09-01 09:59:33,808 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-09-01 09:59:33,808 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 82 flow [2023-09-01 09:59:33,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 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:59:33,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:33,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:33,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:59:33,809 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:59:33,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:33,809 INFO L85 PathProgramCache]: Analyzing trace with hash 700663320, now seen corresponding path program 1 times [2023-09-01 09:59:33,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:33,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81234355] [2023-09-01 09:59:33,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:33,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:33,985 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:59:33,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:33,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81234355] [2023-09-01 09:59:33,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81234355] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:33,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:33,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:59:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665816365] [2023-09-01 09:59:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:33,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:59:33,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:59:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:59:33,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:33,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 25 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:59:33,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:33,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:33,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:34,059 INFO L130 PetriNetUnfolder]: 334/562 cut-off events. [2023-09-01 09:59:34,059 INFO L131 PetriNetUnfolder]: For 154/156 co-relation queries the response was YES. [2023-09-01 09:59:34,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 562 events. 334/562 cut-off events. For 154/156 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1994 event pairs, 172 based on Foata normal form. 7/563 useless extension candidates. Maximal degree in co-relation 1309. Up to 498 conditions per place. [2023-09-01 09:59:34,068 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 30 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2023-09-01 09:59:34,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 190 flow [2023-09-01 09:59:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:59:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:59:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-09-01 09:59:34,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.562992125984252 [2023-09-01 09:59:34,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-09-01 09:59:34,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-09-01 09:59:34,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:34,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-09-01 09:59:34,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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:59:34,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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:59:34,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 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:59:34,073 INFO L175 Difference]: Start difference. First operand has 46 places, 25 transitions, 82 flow. Second operand 3 states and 429 transitions. [2023-09-01 09:59:34,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 190 flow [2023-09-01 09:59:34,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 180 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-09-01 09:59:34,075 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 105 flow [2023-09-01 09:59:34,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-09-01 09:59:34,077 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-09-01 09:59:34,077 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 105 flow [2023-09-01 09:59:34,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:59:34,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:34,077 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:59:34,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:59:34,078 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:59:34,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -125694340, now seen corresponding path program 1 times [2023-09-01 09:59:34,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:34,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427181910] [2023-09-01 09:59:34,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:34,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:34,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:34,282 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:59:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427181910] [2023-09-01 09:59:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427181910] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:34,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:34,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:59:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284160729] [2023-09-01 09:59:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:34,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:59:34,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:59:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:59:34,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:34,291 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 105 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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:59:34,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:34,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:34,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:34,357 INFO L130 PetriNetUnfolder]: 222/392 cut-off events. [2023-09-01 09:59:34,357 INFO L131 PetriNetUnfolder]: For 180/205 co-relation queries the response was YES. [2023-09-01 09:59:34,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 392 events. 222/392 cut-off events. For 180/205 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1352 event pairs, 43 based on Foata normal form. 24/409 useless extension candidates. Maximal degree in co-relation 1118. Up to 276 conditions per place. [2023-09-01 09:59:34,359 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 37 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2023-09-01 09:59:34,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 264 flow [2023-09-01 09:59:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:59:34,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:59:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-09-01 09:59:34,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.562007874015748 [2023-09-01 09:59:34,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-09-01 09:59:34,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-09-01 09:59:34,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:34,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-09-01 09:59:34,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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:59:34,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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:59:34,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 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:59:34,363 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 105 flow. Second operand 4 states and 571 transitions. [2023-09-01 09:59:34,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 264 flow [2023-09-01 09:59:34,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:59:34,364 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 152 flow [2023-09-01 09:59:34,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-09-01 09:59:34,365 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 6 predicate places. [2023-09-01 09:59:34,365 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 152 flow [2023-09-01 09:59:34,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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:59:34,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:34,365 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:59:34,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:59:34,365 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:59:34,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:34,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2115353818, now seen corresponding path program 1 times [2023-09-01 09:59:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:34,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430981003] [2023-09-01 09:59:34,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:34,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:34,542 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:59:34,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:34,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430981003] [2023-09-01 09:59:34,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430981003] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:34,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:34,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:59:34,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865471366] [2023-09-01 09:59:34,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:34,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:59:34,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:34,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:59:34,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:59:34,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:34,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 152 flow. Second operand has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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:59:34,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:34,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:34,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:34,632 INFO L130 PetriNetUnfolder]: 136/262 cut-off events. [2023-09-01 09:59:34,632 INFO L131 PetriNetUnfolder]: For 345/393 co-relation queries the response was YES. [2023-09-01 09:59:34,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 262 events. 136/262 cut-off events. For 345/393 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 838 event pairs, 16 based on Foata normal form. 34/289 useless extension candidates. Maximal degree in co-relation 898. Up to 131 conditions per place. [2023-09-01 09:59:34,633 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 41 selfloop transitions, 13 changer transitions 0/58 dead transitions. [2023-09-01 09:59:34,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 347 flow [2023-09-01 09:59:34,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:59:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:59:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-09-01 09:59:34,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590551181102362 [2023-09-01 09:59:34,635 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-09-01 09:59:34,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-09-01 09:59:34,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:34,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-09-01 09:59:34,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 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:59:34,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:34,638 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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:59:34,638 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 152 flow. Second operand 5 states and 710 transitions. [2023-09-01 09:59:34,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 347 flow [2023-09-01 09:59:34,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 329 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 09:59:34,639 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 202 flow [2023-09-01 09:59:34,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-09-01 09:59:34,640 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-09-01 09:59:34,640 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 202 flow [2023-09-01 09:59:34,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.6) internal successors, (673), 5 states have internal predecessors, (673), 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:59:34,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:34,640 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] [2023-09-01 09:59:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:59:34,641 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:59:34,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 269787996, now seen corresponding path program 1 times [2023-09-01 09:59:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731858418] [2023-09-01 09:59:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:34,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:59:34,838 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:59:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:59:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731858418] [2023-09-01 09:59:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731858418] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:59:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:59:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:59:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761502861] [2023-09-01 09:59:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:59:34,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:59:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:59:34,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:59:34,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:59:34,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 254 [2023-09-01 09:59:34,846 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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:59:34,846 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:59:34,846 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 254 [2023-09-01 09:59:34,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:59:34,918 INFO L130 PetriNetUnfolder]: 114/215 cut-off events. [2023-09-01 09:59:34,918 INFO L131 PetriNetUnfolder]: For 373/421 co-relation queries the response was YES. [2023-09-01 09:59:34,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 215 events. 114/215 cut-off events. For 373/421 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 682 event pairs, 12 based on Foata normal form. 27/234 useless extension candidates. Maximal degree in co-relation 788. Up to 76 conditions per place. [2023-09-01 09:59:34,919 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 37 selfloop transitions, 17 changer transitions 0/58 dead transitions. [2023-09-01 09:59:34,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 373 flow [2023-09-01 09:59:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:59:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:59:34,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2023-09-01 09:59:34,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518372703412073 [2023-09-01 09:59:34,921 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2023-09-01 09:59:34,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2023-09-01 09:59:34,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:59:34,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2023-09-01 09:59:34,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 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:59:34,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:34,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 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:59:34,925 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 202 flow. Second operand 6 states and 841 transitions. [2023-09-01 09:59:34,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 373 flow [2023-09-01 09:59:34,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 328 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-09-01 09:59:34,926 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 204 flow [2023-09-01 09:59:34,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-09-01 09:59:34,927 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 10 predicate places. [2023-09-01 09:59:34,927 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 204 flow [2023-09-01 09:59:34,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 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:59:34,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:59:34,928 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, 1] [2023-09-01 09:59:34,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:59:34,928 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:59:34,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:59:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1463507203, now seen corresponding path program 1 times [2023-09-01 09:59:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:59:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405939847] [2023-09-01 09:59:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:59:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:59:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:59:34,974 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:59:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:59:35,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:59:35,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:59:35,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:59:35,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-01 09:59:35,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:59:35,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:59:35,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-09-01 09:59:35,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:59:35,056 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:59:35,060 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:59:35,060 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:59:35,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:59:35 BasicIcfg [2023-09-01 09:59:35,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:59:35,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:59:35,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:59:35,147 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:59:35,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:59:22" (3/4) ... [2023-09-01 09:59:35,148 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:59:35,213 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:59:35,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:59:35,213 INFO L158 Benchmark]: Toolchain (without parser) took 14097.47ms. Allocated memory was 98.6MB in the beginning and 476.1MB in the end (delta: 377.5MB). Free memory was 75.3MB in the beginning and 185.7MB in the end (delta: -110.4MB). Peak memory consumption was 269.5MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,214 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:59:35,214 INFO L158 Benchmark]: CACSL2BoogieTranslator took 414.66ms. Allocated memory is still 98.6MB. Free memory was 75.0MB in the beginning and 78.5MB in the end (delta: -3.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,214 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.56ms. Allocated memory is still 98.6MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,214 INFO L158 Benchmark]: Boogie Preprocessor took 34.98ms. Allocated memory is still 98.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,214 INFO L158 Benchmark]: RCFGBuilder took 775.24ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 69.3MB in the end (delta: 4.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,215 INFO L158 Benchmark]: TraceAbstraction took 12733.02ms. Allocated memory was 98.6MB in the beginning and 476.1MB in the end (delta: 377.5MB). Free memory was 68.7MB in the beginning and 205.7MB in the end (delta: -136.9MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,215 INFO L158 Benchmark]: Witness Printer took 66.56ms. Allocated memory is still 476.1MB. Free memory was 205.7MB in the beginning and 185.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-09-01 09:59:35,216 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.15ms. Allocated memory is still 71.3MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 414.66ms. Allocated memory is still 98.6MB. Free memory was 75.0MB in the beginning and 78.5MB in the end (delta: -3.4MB). Peak memory consumption was 29.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.56ms. Allocated memory is still 98.6MB. Free memory was 78.5MB in the beginning and 75.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.98ms. Allocated memory is still 98.6MB. Free memory was 75.9MB in the beginning and 73.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 775.24ms. Allocated memory is still 98.6MB. Free memory was 73.8MB in the beginning and 69.3MB in the end (delta: 4.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12733.02ms. Allocated memory was 98.6MB in the beginning and 476.1MB in the end (delta: 377.5MB). Free memory was 68.7MB in the beginning and 205.7MB in the end (delta: -136.9MB). Peak memory consumption was 240.3MB. Max. memory is 16.1GB. * Witness Printer took 66.56ms. Allocated memory is still 476.1MB. Free memory was 205.7MB in the beginning and 185.7MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 141 PlacesBefore, 39 PlacesAfterwards, 129 TransitionsBefore, 27 TransitionsAfterwards, 1822 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 107 TotalNumberOfCompositions, 5161 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2583, independent: 2372, independent conditional: 0, independent unconditional: 2372, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 963, independent: 922, independent conditional: 0, independent unconditional: 922, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2583, independent: 1450, independent conditional: 0, independent unconditional: 1450, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 963, unknown conditional: 0, unknown unconditional: 963] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2705; [L862] FCALL, FORK 0 pthread_create(&t2705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2705, ((void *)0), P0, ((void *)0))=-2, t2705={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] EXPR 1 \read(a) [L777] EXPR 1 !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L777] 1 a = !a$w_buff0_used ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a : (weak$$choice1 ? a$w_buff0 : a$w_buff1)) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$w_buff1 : a$w_buff0) : (weak$$choice0 ? a$w_buff0 : a)))) [L778] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)))) [L779] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)))) [L780] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L781] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? weak$$choice0 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L782] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L783] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (a$w_buff0_used && !a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (weak$$choice0 ? a$r_buff1_thd1 : (_Bool)0) : (a$w_buff0_used && a$r_buff1_thd1 && a$w_buff1_used && !a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L784] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L785] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L786] EXPR 1 \read(a) [L786] 1 __unbuffered_p0_EAX = a [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] EXPR 1 \read(a) [L787] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L787] 1 a = a$flush_delayed ? a$mem_tmp : a [L788] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t2706; [L864] FCALL, FORK 0 pthread_create(&t2706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2706, ((void *)0), P1, ((void *)0))=-1, t2705={6:0}, t2706={7:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t2707; [L791] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L803] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L866] FCALL, FORK 0 pthread_create(&t2707, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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(&t2707, ((void *)0), P2, ((void *)0))=0, t2705={6:0}, t2706={7:0}, t2707={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L867] 0 pthread_t t2708; [L868] FCALL, FORK 0 pthread_create(&t2708, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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, pthread_create(&t2708, ((void *)0), P3, ((void *)0))=1, t2705={6:0}, t2706={7:0}, t2707={8:0}, t2708={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z=0] [L806] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=0] [L818] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=0] [L821] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L833] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L836] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 \read(a) [L839] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L840] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L841] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L842] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L843] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L796] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 1 return 0; [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 \read(a) [L874] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L875] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L876] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L877] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L878] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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, t2705={6:0}, t2706={7:0}, t2707={8:0}, t2708={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L885] 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$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a={3: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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 864]: 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: 868]: 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: 866]: 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: 862]: 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, 179 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: 12.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 517 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1100 IncrementalHoareTripleChecker+Invalid, 1174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 74 mSDtfsCounter, 1100 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=11, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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:59:35,235 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