./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe019_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/safe019_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 e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 09:57:16,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 09:57:16,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 09:57:16,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 09:57:16,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 09:57:16,051 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 09:57:16,053 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 09:57:16,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 09:57:16,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 09:57:16,062 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 09:57:16,063 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 09:57:16,065 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 09:57:16,065 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 09:57:16,067 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 09:57:16,068 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 09:57:16,075 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 09:57:16,076 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 09:57:16,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 09:57:16,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 09:57:16,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 09:57:16,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 09:57:16,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 09:57:16,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 09:57:16,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 09:57:16,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 09:57:16,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 09:57:16,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 09:57:16,108 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 09:57:16,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 09:57:16,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 09:57:16,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 09:57:16,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 09:57:16,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 09:57:16,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 09:57:16,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 09:57:16,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 09:57:16,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 09:57:16,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 09:57:16,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 09:57:16,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 09:57:16,120 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 09:57:16,121 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 09:57:16,152 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 09:57:16,153 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 09:57:16,154 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 09:57:16,154 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 09:57:16,155 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 09:57:16,155 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 09:57:16,156 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 09:57:16,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 09:57:16,156 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 09:57:16,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 09:57:16,157 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 09:57:16,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 09:57:16,159 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 09:57:16,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 09:57:16,159 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 09:57:16,159 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 09:57:16,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 09:57:16,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 09:57:16,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 09:57:16,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:16,160 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 09:57:16,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 09:57:16,162 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 09:57:16,162 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 09:57:16,162 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 09:57:16,162 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 -> e9fa0a1b11704376245a2fedbc5c4fb7e02255cba008bc8067c3e06529a17976 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 09:57:16,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 09:57:16,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 09:57:16,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 09:57:16,472 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 09:57:16,472 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 09:57:16,474 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-09-01 09:57:17,734 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 09:57:17,964 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 09:57:17,965 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2023-09-01 09:57:17,977 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d17ed9e/925e473cd20149789235f33f4bbb9142/FLAG46d3ceb0f [2023-09-01 09:57:17,992 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5d17ed9e/925e473cd20149789235f33f4bbb9142 [2023-09-01 09:57:17,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 09:57:17,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 09:57:17,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:17,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 09:57:18,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 09:57:18,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:17" (1/1) ... [2023-09-01 09:57:18,002 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15ddcaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18, skipping insertion in model container [2023-09-01 09:57:18,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 09:57:17" (1/1) ... [2023-09-01 09:57:18,010 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 09:57:18,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 09:57:18,216 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-09-01 09:57:18,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:18,471 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 09:57:18,482 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i[995,1008] [2023-09-01 09:57:18,551 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 09:57:18,590 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:18,590 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 09:57:18,596 INFO L208 MainTranslator]: Completed translation [2023-09-01 09:57:18,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18 WrapperNode [2023-09-01 09:57:18,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 09:57:18,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:18,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 09:57:18,598 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 09:57:18,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,680 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 185 [2023-09-01 09:57:18,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 09:57:18,682 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 09:57:18,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 09:57:18,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 09:57:18,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,705 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,737 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 09:57:18,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 09:57:18,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 09:57:18,743 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 09:57:18,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (1/1) ... [2023-09-01 09:57:18,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 09:57:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 09:57:18,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 09:57:18,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-09-01 09:57:18,823 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-09-01 09:57:18,823 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-09-01 09:57:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-09-01 09:57:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-09-01 09:57:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-09-01 09:57:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-09-01 09:57:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-09-01 09:57:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 09:57:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 09:57:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 09:57:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 09:57:18,825 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 09:57:18,981 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 09:57:18,984 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 09:57:19,449 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 09:57:19,763 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 09:57:19,763 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-09-01 09:57:19,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19 BoogieIcfgContainer [2023-09-01 09:57:19,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 09:57:19,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 09:57:19,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 09:57:19,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 09:57:19,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 09:57:17" (1/3) ... [2023-09-01 09:57:19,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b80dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:19, skipping insertion in model container [2023-09-01 09:57:19,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 09:57:18" (2/3) ... [2023-09-01 09:57:19,771 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b80dfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 09:57:19, skipping insertion in model container [2023-09-01 09:57:19,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19" (3/3) ... [2023-09-01 09:57:19,772 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2023-09-01 09:57:19,780 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 09:57:19,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 09:57:19,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 09:57:19,791 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 09:57:19,867 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-01 09:57:19,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-09-01 09:57:19,974 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-09-01 09:57:19,974 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:19,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2023-09-01 09:57:19,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-09-01 09:57:19,995 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 125 transitions, 262 flow [2023-09-01 09:57:19,999 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 09:57:20,013 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 125 transitions, 262 flow [2023-09-01 09:57:20,015 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 137 places, 125 transitions, 262 flow [2023-09-01 09:57:20,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 125 transitions, 262 flow [2023-09-01 09:57:20,047 INFO L130 PetriNetUnfolder]: 1/125 cut-off events. [2023-09-01 09:57:20,047 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:20,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 1/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 47 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-09-01 09:57:20,052 INFO L119 LiptonReduction]: Number of co-enabled transitions 1736 [2023-09-01 09:57:28,226 INFO L134 LiptonReduction]: Checked pairs total: 4893 [2023-09-01 09:57:28,227 INFO L136 LiptonReduction]: Total number of compositions: 104 [2023-09-01 09:57:28,247 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 09:57:28,255 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;@5ee3e562, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 09:57:28,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 09:57:28,293 INFO L130 PetriNetUnfolder]: 1/25 cut-off events. [2023-09-01 09:57:28,294 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:28,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:28,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:28,296 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:28,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -630249958, now seen corresponding path program 1 times [2023-09-01 09:57:28,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:28,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406180531] [2023-09-01 09:57:28,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:28,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:28,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:28,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406180531] [2023-09-01 09:57:28,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406180531] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:28,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86740492] [2023-09-01 09:57:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:28,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 09:57:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 09:57:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 09:57:28,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 247 [2023-09-01 09:57:28,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:28,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:28,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 247 [2023-09-01 09:57:28,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:29,335 INFO L130 PetriNetUnfolder]: 2483/3464 cut-off events. [2023-09-01 09:57:29,336 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2023-09-01 09:57:29,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 3464 events. 2483/3464 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 15783 event pairs, 2483 based on Foata normal form. 144/3454 useless extension candidates. Maximal degree in co-relation 7000. Up to 3445 conditions per place. [2023-09-01 09:57:29,357 INFO L137 encePairwiseOnDemand]: 246/247 looper letters, 22 selfloop transitions, 0 changer transitions 1/25 dead transitions. [2023-09-01 09:57:29,357 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 25 transitions, 108 flow [2023-09-01 09:57:29,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 09:57:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 09:57:29,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 286 transitions. [2023-09-01 09:57:29,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5789473684210527 [2023-09-01 09:57:29,370 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 286 transitions. [2023-09-01 09:57:29,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 286 transitions. [2023-09-01 09:57:29,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:29,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 286 transitions. [2023-09-01 09:57:29,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.0) internal successors, (286), 2 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:29,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:29,382 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:29,384 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 2 states and 286 transitions. [2023-09-01 09:57:29,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 25 transitions, 108 flow [2023-09-01 09:57:29,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 104 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:29,388 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2023-09-01 09:57:29,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2023-09-01 09:57:29,393 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2023-09-01 09:57:29,393 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 56 flow [2023-09-01 09:57:29,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:29,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:29,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:29,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 09:57:29,395 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:29,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash -630221128, now seen corresponding path program 1 times [2023-09-01 09:57:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:29,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991256244] [2023-09-01 09:57:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:29,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:30,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:30,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991256244] [2023-09-01 09:57:30,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991256244] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:30,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:30,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:30,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773401036] [2023-09-01 09:57:30,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:30,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:30,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:30,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 247 [2023-09-01 09:57:30,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:30,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:30,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 247 [2023-09-01 09:57:30,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:30,759 INFO L130 PetriNetUnfolder]: 2083/3178 cut-off events. [2023-09-01 09:57:30,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 09:57:30,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 3178 events. 2083/3178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 16842 event pairs, 399 based on Foata normal form. 144/3319 useless extension candidates. Maximal degree in co-relation 6224. Up to 2013 conditions per place. [2023-09-01 09:57:30,778 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 36 selfloop transitions, 2 changer transitions 19/59 dead transitions. [2023-09-01 09:57:30,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 59 transitions, 246 flow [2023-09-01 09:57:30,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:30,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:30,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 709 transitions. [2023-09-01 09:57:30,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740890688259109 [2023-09-01 09:57:30,783 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 709 transitions. [2023-09-01 09:57:30,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 709 transitions. [2023-09-01 09:57:30,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:30,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 709 transitions. [2023-09-01 09:57:30,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:30,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:30,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:30,791 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 56 flow. Second operand 5 states and 709 transitions. [2023-09-01 09:57:30,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 59 transitions, 246 flow [2023-09-01 09:57:30,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 59 transitions, 246 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 09:57:30,792 INFO L231 Difference]: Finished difference. Result has 41 places, 24 transitions, 68 flow [2023-09-01 09:57:30,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=24} [2023-09-01 09:57:30,794 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-09-01 09:57:30,794 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 24 transitions, 68 flow [2023-09-01 09:57:30,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:30,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:30,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:30,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 09:57:30,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:30,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1937959561, now seen corresponding path program 1 times [2023-09-01 09:57:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518312618] [2023-09-01 09:57:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:31,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:31,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:31,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518312618] [2023-09-01 09:57:31,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518312618] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:31,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:31,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:57:31,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410007239] [2023-09-01 09:57:31,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:31,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:31,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:31,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 247 [2023-09-01 09:57:31,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 24 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:31,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:31,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 247 [2023-09-01 09:57:31,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:31,819 INFO L130 PetriNetUnfolder]: 1815/2736 cut-off events. [2023-09-01 09:57:31,819 INFO L131 PetriNetUnfolder]: For 571/571 co-relation queries the response was YES. [2023-09-01 09:57:31,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6018 conditions, 2736 events. 1815/2736 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 13816 event pairs, 338 based on Foata normal form. 96/2831 useless extension candidates. Maximal degree in co-relation 6011. Up to 1912 conditions per place. [2023-09-01 09:57:31,840 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 31 selfloop transitions, 2 changer transitions 16/51 dead transitions. [2023-09-01 09:57:31,841 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 227 flow [2023-09-01 09:57:31,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-09-01 09:57:31,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5595141700404859 [2023-09-01 09:57:31,844 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-09-01 09:57:31,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-09-01 09:57:31,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:31,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-09-01 09:57:31,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:31,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:31,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:31,850 INFO L175 Difference]: Start difference. First operand has 41 places, 24 transitions, 68 flow. Second operand 5 states and 691 transitions. [2023-09-01 09:57:31,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 227 flow [2023-09-01 09:57:31,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 217 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:31,860 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 72 flow [2023-09-01 09:57:31,861 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-09-01 09:57:31,861 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-09-01 09:57:31,862 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 72 flow [2023-09-01 09:57:31,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:31,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:31,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:31,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 09:57:31,863 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:31,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1359621863, now seen corresponding path program 1 times [2023-09-01 09:57:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:31,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822087370] [2023-09-01 09:57:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822087370] [2023-09-01 09:57:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822087370] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:32,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:32,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504327508] [2023-09-01 09:57:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:32,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:32,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:32,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:32,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:32,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:32,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:32,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:32,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:32,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:33,012 INFO L130 PetriNetUnfolder]: 2229/3267 cut-off events. [2023-09-01 09:57:33,012 INFO L131 PetriNetUnfolder]: For 547/547 co-relation queries the response was YES. [2023-09-01 09:57:33,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7436 conditions, 3267 events. 2229/3267 cut-off events. For 547/547 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16773 event pairs, 455 based on Foata normal form. 72/3335 useless extension candidates. Maximal degree in co-relation 7428. Up to 1217 conditions per place. [2023-09-01 09:57:33,030 INFO L137 encePairwiseOnDemand]: 242/247 looper letters, 40 selfloop transitions, 3 changer transitions 21/66 dead transitions. [2023-09-01 09:57:33,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 66 transitions, 303 flow [2023-09-01 09:57:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:33,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions. [2023-09-01 09:57:33,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5546558704453441 [2023-09-01 09:57:33,038 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 822 transitions. [2023-09-01 09:57:33,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions. [2023-09-01 09:57:33,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:33,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions. [2023-09-01 09:57:33,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:33,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:33,044 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:33,044 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 72 flow. Second operand 6 states and 822 transitions. [2023-09-01 09:57:33,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 66 transitions, 303 flow [2023-09-01 09:57:33,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 293 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-09-01 09:57:33,052 INFO L231 Difference]: Finished difference. Result has 45 places, 24 transitions, 82 flow [2023-09-01 09:57:33,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=45, PETRI_TRANSITIONS=24} [2023-09-01 09:57:33,054 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-09-01 09:57:33,054 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 24 transitions, 82 flow [2023-09-01 09:57:33,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:33,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:33,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:33,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 09:57:33,055 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:33,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash -802220554, now seen corresponding path program 1 times [2023-09-01 09:57:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:33,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62188332] [2023-09-01 09:57:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:35,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62188332] [2023-09-01 09:57:35,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62188332] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:35,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:35,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-09-01 09:57:35,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742523712] [2023-09-01 09:57:35,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:35,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-09-01 09:57:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:35,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-09-01 09:57:35,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-09-01 09:57:35,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2023-09-01 09:57:35,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 24 transitions, 82 flow. Second operand has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:35,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:35,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2023-09-01 09:57:35,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:35,938 INFO L130 PetriNetUnfolder]: 1486/2190 cut-off events. [2023-09-01 09:57:35,938 INFO L131 PetriNetUnfolder]: For 1101/1101 co-relation queries the response was YES. [2023-09-01 09:57:35,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 2190 events. 1486/2190 cut-off events. For 1101/1101 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9719 event pairs, 309 based on Foata normal form. 64/2254 useless extension candidates. Maximal degree in co-relation 5326. Up to 1755 conditions per place. [2023-09-01 09:57:35,953 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 41 selfloop transitions, 6 changer transitions 13/61 dead transitions. [2023-09-01 09:57:35,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 309 flow [2023-09-01 09:57:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-09-01 09:57:35,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5074224021592443 [2023-09-01 09:57:35,957 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-09-01 09:57:35,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-09-01 09:57:35,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:35,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-09-01 09:57:35,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:35,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:35,964 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:35,964 INFO L175 Difference]: Start difference. First operand has 45 places, 24 transitions, 82 flow. Second operand 6 states and 752 transitions. [2023-09-01 09:57:35,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 309 flow [2023-09-01 09:57:35,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 61 transitions, 279 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-09-01 09:57:35,969 INFO L231 Difference]: Finished difference. Result has 46 places, 29 transitions, 108 flow [2023-09-01 09:57:35,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2023-09-01 09:57:35,971 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-09-01 09:57:35,971 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 108 flow [2023-09-01 09:57:35,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 116.875) internal successors, (935), 8 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:35,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:35,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:35,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 09:57:35,972 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:35,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 833815455, now seen corresponding path program 1 times [2023-09-01 09:57:35,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:35,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761214694] [2023-09-01 09:57:35,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:35,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:36,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:36,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761214694] [2023-09-01 09:57:36,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761214694] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:57:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317223124] [2023-09-01 09:57:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:36,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:36,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:36,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:36,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 247 [2023-09-01 09:57:36,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:36,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:36,530 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 247 [2023-09-01 09:57:36,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:37,037 INFO L130 PetriNetUnfolder]: 1729/2494 cut-off events. [2023-09-01 09:57:37,037 INFO L131 PetriNetUnfolder]: For 1139/1139 co-relation queries the response was YES. [2023-09-01 09:57:37,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6348 conditions, 2494 events. 1729/2494 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11056 event pairs, 1082 based on Foata normal form. 48/2541 useless extension candidates. Maximal degree in co-relation 6338. Up to 2088 conditions per place. [2023-09-01 09:57:37,056 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 30 selfloop transitions, 10 changer transitions 8/49 dead transitions. [2023-09-01 09:57:37,057 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 49 transitions, 263 flow [2023-09-01 09:57:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:37,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-09-01 09:57:37,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5295546558704454 [2023-09-01 09:57:37,059 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-09-01 09:57:37,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-09-01 09:57:37,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:37,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-09-01 09:57:37,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:37,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:37,064 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:37,064 INFO L175 Difference]: Start difference. First operand has 46 places, 29 transitions, 108 flow. Second operand 5 states and 654 transitions. [2023-09-01 09:57:37,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 49 transitions, 263 flow [2023-09-01 09:57:37,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 49 transitions, 255 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:37,071 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 166 flow [2023-09-01 09:57:37,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-09-01 09:57:37,074 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-09-01 09:57:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 166 flow [2023-09-01 09:57:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:37,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 09:57:37,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:37,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -460826115, now seen corresponding path program 2 times [2023-09-01 09:57:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429644634] [2023-09-01 09:57:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:38,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:57:38,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:38,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429644634] [2023-09-01 09:57:38,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429644634] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:38,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:38,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:38,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726268393] [2023-09-01 09:57:38,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:38,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:38,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:38,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:38,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:38,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 247 [2023-09-01 09:57:38,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:38,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 247 [2023-09-01 09:57:38,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:38,671 INFO L130 PetriNetUnfolder]: 1795/2596 cut-off events. [2023-09-01 09:57:38,672 INFO L131 PetriNetUnfolder]: For 1732/1732 co-relation queries the response was YES. [2023-09-01 09:57:38,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7821 conditions, 2596 events. 1795/2596 cut-off events. For 1732/1732 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11661 event pairs, 1070 based on Foata normal form. 60/2655 useless extension candidates. Maximal degree in co-relation 7810. Up to 2108 conditions per place. [2023-09-01 09:57:38,692 INFO L137 encePairwiseOnDemand]: 238/247 looper letters, 31 selfloop transitions, 13 changer transitions 14/59 dead transitions. [2023-09-01 09:57:38,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 371 flow [2023-09-01 09:57:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2023-09-01 09:57:38,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52834008097166 [2023-09-01 09:57:38,696 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2023-09-01 09:57:38,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2023-09-01 09:57:38,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:38,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2023-09-01 09:57:38,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,703 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,703 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 166 flow. Second operand 6 states and 783 transitions. [2023-09-01 09:57:38,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 371 flow [2023-09-01 09:57:38,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 352 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:38,710 INFO L231 Difference]: Finished difference. Result has 52 places, 39 transitions, 228 flow [2023-09-01 09:57:38,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=52, PETRI_TRANSITIONS=39} [2023-09-01 09:57:38,710 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 14 predicate places. [2023-09-01 09:57:38,710 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 39 transitions, 228 flow [2023-09-01 09:57:38,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:38,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:38,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 09:57:38,712 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:38,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash -459962176, now seen corresponding path program 1 times [2023-09-01 09:57:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025910681] [2023-09-01 09:57:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025910681] [2023-09-01 09:57:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025910681] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-01 09:57:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910800630] [2023-09-01 09:57:38,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:38,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 09:57:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 09:57:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 09:57:38,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:38,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 39 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:38,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:38,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:38,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:39,411 INFO L130 PetriNetUnfolder]: 1197/1779 cut-off events. [2023-09-01 09:57:39,411 INFO L131 PetriNetUnfolder]: For 3303/3438 co-relation queries the response was YES. [2023-09-01 09:57:39,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6374 conditions, 1779 events. 1197/1779 cut-off events. For 3303/3438 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7989 event pairs, 258 based on Foata normal form. 163/1935 useless extension candidates. Maximal degree in co-relation 6361. Up to 1608 conditions per place. [2023-09-01 09:57:39,426 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 54 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2023-09-01 09:57:39,426 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 469 flow [2023-09-01 09:57:39,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 09:57:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 09:57:39,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-09-01 09:57:39,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.562753036437247 [2023-09-01 09:57:39,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-09-01 09:57:39,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-09-01 09:57:39,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:39,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-09-01 09:57:39,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:39,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:39,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:39,431 INFO L175 Difference]: Start difference. First operand has 52 places, 39 transitions, 228 flow. Second operand 3 states and 417 transitions. [2023-09-01 09:57:39,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 469 flow [2023-09-01 09:57:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 444 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:39,437 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 241 flow [2023-09-01 09:57:39,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-09-01 09:57:39,439 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-09-01 09:57:39,439 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 241 flow [2023-09-01 09:57:39,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:39,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:39,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:39,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 09:57:39,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:39,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash 773162674, now seen corresponding path program 1 times [2023-09-01 09:57:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523347751] [2023-09-01 09:57:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:39,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:39,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523347751] [2023-09-01 09:57:39,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523347751] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:39,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:39,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 09:57:39,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719415508] [2023-09-01 09:57:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:39,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 09:57:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:39,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 09:57:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 09:57:39,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:39,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:39,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:39,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:39,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:40,049 INFO L130 PetriNetUnfolder]: 688/1093 cut-off events. [2023-09-01 09:57:40,049 INFO L131 PetriNetUnfolder]: For 1976/2056 co-relation queries the response was YES. [2023-09-01 09:57:40,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4308 conditions, 1093 events. 688/1093 cut-off events. For 1976/2056 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4689 event pairs, 84 based on Foata normal form. 133/1219 useless extension candidates. Maximal degree in co-relation 4295. Up to 666 conditions per place. [2023-09-01 09:57:40,058 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 70 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-09-01 09:57:40,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 617 flow [2023-09-01 09:57:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 09:57:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 09:57:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-09-01 09:57:40,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5637651821862348 [2023-09-01 09:57:40,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-09-01 09:57:40,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-09-01 09:57:40,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:40,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-09-01 09:57:40,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,065 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 241 flow. Second operand 4 states and 557 transitions. [2023-09-01 09:57:40,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 617 flow [2023-09-01 09:57:40,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 09:57:40,071 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 288 flow [2023-09-01 09:57:40,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2023-09-01 09:57:40,072 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-09-01 09:57:40,072 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 288 flow [2023-09-01 09:57:40,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:40,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:40,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 09:57:40,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:40,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:40,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1613123840, now seen corresponding path program 1 times [2023-09-01 09:57:40,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508647458] [2023-09-01 09:57:40,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:40,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:40,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508647458] [2023-09-01 09:57:40,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508647458] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:40,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:40,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:40,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358994376] [2023-09-01 09:57:40,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:40,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:40,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:40,353 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:40,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 288 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:40,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:40,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:40,805 INFO L130 PetriNetUnfolder]: 1339/2156 cut-off events. [2023-09-01 09:57:40,805 INFO L131 PetriNetUnfolder]: For 4968/5069 co-relation queries the response was YES. [2023-09-01 09:57:40,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9031 conditions, 2156 events. 1339/2156 cut-off events. For 4968/5069 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 10730 event pairs, 241 based on Foata normal form. 131/2279 useless extension candidates. Maximal degree in co-relation 9017. Up to 1221 conditions per place. [2023-09-01 09:57:40,819 INFO L137 encePairwiseOnDemand]: 243/247 looper letters, 67 selfloop transitions, 2 changer transitions 33/105 dead transitions. [2023-09-01 09:57:40,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 843 flow [2023-09-01 09:57:40,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:40,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:40,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-09-01 09:57:40,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5578947368421052 [2023-09-01 09:57:40,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-09-01 09:57:40,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-09-01 09:57:40,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:40,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-09-01 09:57:40,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,827 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,827 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 288 flow. Second operand 5 states and 689 transitions. [2023-09-01 09:57:40,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 843 flow [2023-09-01 09:57:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 105 transitions, 801 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-09-01 09:57:40,835 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 285 flow [2023-09-01 09:57:40,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2023-09-01 09:57:40,836 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2023-09-01 09:57:40,836 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 285 flow [2023-09-01 09:57:40,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:40,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:40,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:40,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 09:57:40,838 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:40,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash -300813236, now seen corresponding path program 2 times [2023-09-01 09:57:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588517502] [2023-09-01 09:57:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588517502] [2023-09-01 09:57:41,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588517502] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:41,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:41,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 09:57:41,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819944388] [2023-09-01 09:57:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:41,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 09:57:41,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 09:57:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-09-01 09:57:41,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:41,175 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:41,175 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:41,175 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:41,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:41,438 INFO L130 PetriNetUnfolder]: 678/1110 cut-off events. [2023-09-01 09:57:41,438 INFO L131 PetriNetUnfolder]: For 2426/2526 co-relation queries the response was YES. [2023-09-01 09:57:41,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 1110 events. 678/1110 cut-off events. For 2426/2526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5115 event pairs, 57 based on Foata normal form. 156/1243 useless extension candidates. Maximal degree in co-relation 4456. Up to 397 conditions per place. [2023-09-01 09:57:41,446 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 75 selfloop transitions, 13 changer transitions 0/93 dead transitions. [2023-09-01 09:57:41,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 93 transitions, 727 flow [2023-09-01 09:57:41,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 09:57:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 09:57:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-09-01 09:57:41,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619433198380567 [2023-09-01 09:57:41,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-09-01 09:57:41,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-09-01 09:57:41,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:41,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-09-01 09:57:41,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:41,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:41,453 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 247.0) internal successors, (1482), 6 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:41,453 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 285 flow. Second operand 5 states and 694 transitions. [2023-09-01 09:57:41,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 93 transitions, 727 flow [2023-09-01 09:57:41,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 93 transitions, 714 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:41,458 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 326 flow [2023-09-01 09:57:41,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=326, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2023-09-01 09:57:41,458 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-09-01 09:57:41,459 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 326 flow [2023-09-01 09:57:41,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:41,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:41,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:41,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 09:57:41,460 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:57:41,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:41,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1113364253, now seen corresponding path program 1 times [2023-09-01 09:57:41,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:41,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836881347] [2023-09-01 09:57:41,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:41,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:42,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:42,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:42,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836881347] [2023-09-01 09:57:42,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836881347] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:42,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:42,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:57:42,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272198867] [2023-09-01 09:57:42,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:42,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 09:57:42,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:42,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 09:57:42,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 09:57:43,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 247 [2023-09-01 09:57:43,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 326 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:43,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:43,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 247 [2023-09-01 09:57:43,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:43,557 INFO L130 PetriNetUnfolder]: 1001/1687 cut-off events. [2023-09-01 09:57:43,557 INFO L131 PetriNetUnfolder]: For 5000/5010 co-relation queries the response was YES. [2023-09-01 09:57:43,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7764 conditions, 1687 events. 1001/1687 cut-off events. For 5000/5010 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8561 event pairs, 240 based on Foata normal form. 15/1693 useless extension candidates. Maximal degree in co-relation 7748. Up to 981 conditions per place. [2023-09-01 09:57:43,568 INFO L137 encePairwiseOnDemand]: 237/247 looper letters, 58 selfloop transitions, 13 changer transitions 29/102 dead transitions. [2023-09-01 09:57:43,568 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 102 transitions, 927 flow [2023-09-01 09:57:43,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-09-01 09:57:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-09-01 09:57:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 907 transitions. [2023-09-01 09:57:43,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245806824754193 [2023-09-01 09:57:43,572 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 907 transitions. [2023-09-01 09:57:43,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 907 transitions. [2023-09-01 09:57:43,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:43,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 907 transitions. [2023-09-01 09:57:43,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.57142857142858) internal successors, (907), 7 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:43,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:43,595 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 247.0) internal successors, (1976), 8 states have internal predecessors, (1976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:43,595 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 326 flow. Second operand 7 states and 907 transitions. [2023-09-01 09:57:43,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 102 transitions, 927 flow [2023-09-01 09:57:43,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 102 transitions, 837 flow, removed 22 selfloop flow, removed 3 redundant places. [2023-09-01 09:57:43,612 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 369 flow [2023-09-01 09:57:43,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=369, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-09-01 09:57:43,613 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2023-09-01 09:57:43,613 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 369 flow [2023-09-01 09:57:43,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:43,614 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:43,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:43,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 09:57:43,614 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:43,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:43,615 INFO L85 PathProgramCache]: Analyzing trace with hash -36945931, now seen corresponding path program 1 times [2023-09-01 09:57:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:43,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876802753] [2023-09-01 09:57:43,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:43,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 09:57:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 09:57:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 09:57:43,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876802753] [2023-09-01 09:57:43,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876802753] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 09:57:43,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 09:57:43,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-09-01 09:57:43,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475237668] [2023-09-01 09:57:43,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 09:57:43,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 09:57:43,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 09:57:44,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 09:57:44,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 09:57:44,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 247 [2023-09-01 09:57:44,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:44,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 09:57:44,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 247 [2023-09-01 09:57:44,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 09:57:44,315 INFO L130 PetriNetUnfolder]: 783/1277 cut-off events. [2023-09-01 09:57:44,315 INFO L131 PetriNetUnfolder]: For 4340/4443 co-relation queries the response was YES. [2023-09-01 09:57:44,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5800 conditions, 1277 events. 783/1277 cut-off events. For 4340/4443 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6360 event pairs, 51 based on Foata normal form. 130/1384 useless extension candidates. Maximal degree in co-relation 5780. Up to 480 conditions per place. [2023-09-01 09:57:44,323 INFO L137 encePairwiseOnDemand]: 241/247 looper letters, 57 selfloop transitions, 17 changer transitions 29/105 dead transitions. [2023-09-01 09:57:44,323 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 994 flow [2023-09-01 09:57:44,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 09:57:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 09:57:44,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2023-09-01 09:57:44,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.553306342780027 [2023-09-01 09:57:44,326 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2023-09-01 09:57:44,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2023-09-01 09:57:44,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 09:57:44,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2023-09-01 09:57:44,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:44,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:44,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 247.0) internal successors, (1729), 7 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:44,332 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 369 flow. Second operand 6 states and 820 transitions. [2023-09-01 09:57:44,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 994 flow [2023-09-01 09:57:44,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 105 transitions, 854 flow, removed 46 selfloop flow, removed 7 redundant places. [2023-09-01 09:57:44,347 INFO L231 Difference]: Finished difference. Result has 63 places, 41 transitions, 288 flow [2023-09-01 09:57:44,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=41} [2023-09-01 09:57:44,348 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-09-01 09:57:44,349 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 41 transitions, 288 flow [2023-09-01 09:57:44,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.33333333333334) internal successors, (776), 6 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 09:57:44,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 09:57:44,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:44,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 09:57:44,350 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 09:57:44,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 09:57:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1586549304, now seen corresponding path program 1 times [2023-09-01 09:57:44,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 09:57:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714905036] [2023-09-01 09:57:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 09:57:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 09:57:44,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:57:44,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 09:57:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 09:57:44,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 09:57:44,616 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 09:57:44,617 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-09-01 09:57:44,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-09-01 09:57:44,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-09-01 09:57:44,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-09-01 09:57:44,621 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-09-01 09:57:44,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 09:57:44,622 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 09:57:44,627 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 09:57:44,627 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 09:57:44,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 09:57:44 BasicIcfg [2023-09-01 09:57:44,746 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 09:57:44,747 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 09:57:44,747 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 09:57:44,747 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 09:57:44,747 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 09:57:19" (3/4) ... [2023-09-01 09:57:44,749 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 09:57:44,858 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 09:57:44,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 09:57:44,858 INFO L158 Benchmark]: Toolchain (without parser) took 26863.31ms. Allocated memory was 77.6MB in the beginning and 1.0GB in the end (delta: 947.9MB). Free memory was 48.6MB in the beginning and 517.3MB in the end (delta: -468.8MB). Peak memory consumption was 480.8MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,859 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 09:57:44,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 600.05ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 41.0MB in the end (delta: 7.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.44ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 38.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,861 INFO L158 Benchmark]: Boogie Preprocessor took 59.57ms. Allocated memory is still 77.6MB. Free memory was 38.1MB in the beginning and 35.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,861 INFO L158 Benchmark]: RCFGBuilder took 1022.92ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 35.4MB in the beginning and 41.8MB in the end (delta: -6.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,862 INFO L158 Benchmark]: TraceAbstraction took 24979.37ms. Allocated memory was 94.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 41.2MB in the beginning and 536.3MB in the end (delta: -495.1MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,862 INFO L158 Benchmark]: Witness Printer took 111.27ms. Allocated memory is still 1.0GB. Free memory was 536.3MB in the beginning and 517.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-09-01 09:57:44,864 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 56.6MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 600.05ms. Allocated memory is still 77.6MB. Free memory was 48.4MB in the beginning and 41.0MB in the end (delta: 7.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.44ms. Allocated memory is still 77.6MB. Free memory was 41.0MB in the beginning and 38.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.57ms. Allocated memory is still 77.6MB. Free memory was 38.1MB in the beginning and 35.4MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1022.92ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 35.4MB in the beginning and 41.8MB in the end (delta: -6.4MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * TraceAbstraction took 24979.37ms. Allocated memory was 94.4MB in the beginning and 1.0GB in the end (delta: 931.1MB). Free memory was 41.2MB in the beginning and 536.3MB in the end (delta: -495.1MB). Peak memory consumption was 436.7MB. Max. memory is 16.1GB. * Witness Printer took 111.27ms. Allocated memory is still 1.0GB. Free memory was 536.3MB in the beginning and 517.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2s, 137 PlacesBefore, 38 PlacesAfterwards, 125 TransitionsBefore, 26 TransitionsAfterwards, 1736 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 104 TotalNumberOfCompositions, 4893 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1862, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 894, independent: 857, independent conditional: 0, independent unconditional: 857, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1862, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 894, unknown conditional: 0, unknown unconditional: 894] , Statistics on independence cache: Total cache size (in pairs): 93, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, 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_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2225, ((void *)0), P0, ((void *)0))=9, t2225={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2226, ((void *)0), P1, ((void *)0))=10, t2225={7:0}, t2226={5:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2227; [L785] 1 __unbuffered_p0_EBX = 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 2 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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] FCALL, FORK 0 pthread_create(&t2227, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2227, ((void *)0), P2, ((void *)0))=11, t2225={7:0}, t2226={5:0}, t2227={6:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] 0 pthread_t t2228; [L809] 3 __unbuffered_p2_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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] 3 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L861] FCALL, FORK 0 pthread_create(&t2228, ((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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2228, ((void *)0), P3, ((void *)0))=12, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] 4 y = 2 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] 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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2225={7:0}, t2226={5:0}, t2227={6:0}, t2228={8:0}, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L891] 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=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 855]: 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: 857]: 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: 861]: 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: 859]: 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, 174 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: 24.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 702 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 310 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 285 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1866 IncrementalHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 25 mSDtfsCounter, 1866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=12, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1864 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-09-01 09:57:44,896 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