/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:38:41,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:38:41,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:38:41,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:38:41,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:38:41,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:38:41,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:38:41,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:38:41,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:38:41,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:38:41,285 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:38:41,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:38:41,285 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:38:41,287 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:38:41,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:38:41,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:38:41,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:38:41,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:38:41,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:38:41,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:38:41,288 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:38:41,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:38:41,289 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:38:41,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:38:41,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:38:41,290 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:38:41,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:38:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:38:41,291 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:38:41,291 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:38:41,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:38:41,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:38:41,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:38:41,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:38:41,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:38:41,293 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:38:41,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:38:41,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:38:41,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:38:41,604 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:38:41,605 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:38:41,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 11:38:42,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:38:43,192 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:38:43,193 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 11:38:43,211 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f854027e3/4b1d135072ee463081ebaf5d5951d6b4/FLAG5477a031d [2023-08-24 11:38:43,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f854027e3/4b1d135072ee463081ebaf5d5951d6b4 [2023-08-24 11:38:43,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:38:43,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:38:43,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:38:43,226 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:38:43,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:38:43,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68707b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43, skipping insertion in model container [2023-08-24 11:38:43,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,269 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:38:43,403 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 11:38:43,583 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:38:43,595 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:38:43,606 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-24 11:38:43,622 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:38:43,623 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:38:43,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:38:43,718 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:38:43,718 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:38:43,725 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:38:43,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43 WrapperNode [2023-08-24 11:38:43,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:38:43,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:38:43,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:38:43,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:38:43,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,801 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-24 11:38:43,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:38:43,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:38:43,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:38:43,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:38:43,810 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,824 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:38:43,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:38:43,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:38:43,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:38:43,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (1/1) ... [2023-08-24 11:38:43,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:38:43,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:38:43,885 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-08-24 11:38:43,910 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-08-24 11:38:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:38:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:38:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:38:43,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:38:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:38:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:38:43,920 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:38:43,920 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:38:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:38:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:38:43,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:38:43,921 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:38:43,922 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:38:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:38:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:38:43,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:38:43,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:38:43,924 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:38:44,053 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:38:44,055 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:38:44,357 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:38:44,484 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:38:44,484 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:38:44,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:38:44 BoogieIcfgContainer [2023-08-24 11:38:44,487 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:38:44,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:38:44,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:38:44,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:38:44,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:38:43" (1/3) ... [2023-08-24 11:38:44,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57229763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:38:44, skipping insertion in model container [2023-08-24 11:38:44,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:38:43" (2/3) ... [2023-08-24 11:38:44,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57229763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:38:44, skipping insertion in model container [2023-08-24 11:38:44,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:38:44" (3/3) ... [2023-08-24 11:38:44,495 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 11:38:44,514 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:38:44,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:38:44,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:38:44,578 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:38:44,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 11:38:44,666 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 11:38:44,666 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:38:44,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 11:38:44,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 132 transitions, 284 flow [2023-08-24 11:38:44,675 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 128 transitions, 268 flow [2023-08-24 11:38:44,678 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:38:44,686 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 11:38:44,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 128 transitions, 268 flow [2023-08-24 11:38:44,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 128 transitions, 268 flow [2023-08-24 11:38:44,714 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2023-08-24 11:38:44,714 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:38:44,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 89. Up to 2 conditions per place. [2023-08-24 11:38:44,717 INFO L119 LiptonReduction]: Number of co-enabled transitions 3300 [2023-08-24 11:38:48,661 INFO L134 LiptonReduction]: Checked pairs total: 10097 [2023-08-24 11:38:48,661 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-08-24 11:38:48,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:38:48,677 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=false, 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;@41ee7db1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:38:48,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:38:48,679 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:38:48,679 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 11:38:48,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:38:48,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:48,680 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 11:38:48,680 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:48,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:48,684 INFO L85 PathProgramCache]: Analyzing trace with hash 552505, now seen corresponding path program 1 times [2023-08-24 11:38:48,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:48,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67425804] [2023-08-24 11:38:48,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:48,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:49,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67425804] [2023-08-24 11:38:49,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67425804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:49,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:49,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:38:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76825466] [2023-08-24 11:38:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:49,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:38:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:49,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:38:49,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:38:49,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 241 [2023-08-24 11:38:49,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-08-24 11:38:49,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:49,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 241 [2023-08-24 11:38:49,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:50,012 INFO L124 PetriNetUnfolderBase]: 4903/6743 cut-off events. [2023-08-24 11:38:50,013 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-08-24 11:38:50,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13591 conditions, 6743 events. 4903/6743 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33838 event pairs, 2535 based on Foata normal form. 0/6401 useless extension candidates. Maximal degree in co-relation 13579. Up to 5335 conditions per place. [2023-08-24 11:38:50,055 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-08-24 11:38:50,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-08-24 11:38:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:38:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:38:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-24 11:38:50,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5477178423236515 [2023-08-24 11:38:50,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-24 11:38:50,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-24 11:38:50,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:50,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-24 11:38:50,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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-08-24 11:38:50,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:50,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:50,084 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 396 transitions. [2023-08-24 11:38:50,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-08-24 11:38:50,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:38:50,089 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-08-24 11:38:50,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-08-24 11:38:50,093 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 11:38:50,093 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-08-24 11:38:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 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-08-24 11:38:50,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:50,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:38:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:38:50,095 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:50,095 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash -502598528, now seen corresponding path program 1 times [2023-08-24 11:38:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:50,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185850432] [2023-08-24 11:38:50,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:50,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:50,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:50,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:50,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:50,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185850432] [2023-08-24 11:38:50,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185850432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:50,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:50,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:38:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735531075] [2023-08-24 11:38:50,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:50,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:38:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:50,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:38:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:38:50,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-24 11:38:50,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-08-24 11:38:50,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:50,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-24 11:38:50,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:51,089 INFO L124 PetriNetUnfolderBase]: 5847/7943 cut-off events. [2023-08-24 11:38:51,090 INFO L125 PetriNetUnfolderBase]: For 521/521 co-relation queries the response was YES. [2023-08-24 11:38:51,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16607 conditions, 7943 events. 5847/7943 cut-off events. For 521/521 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 39253 event pairs, 1383 based on Foata normal form. 32/7966 useless extension candidates. Maximal degree in co-relation 16597. Up to 7393 conditions per place. [2023-08-24 11:38:51,133 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 36 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2023-08-24 11:38:51,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 178 flow [2023-08-24 11:38:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:38:51,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:38:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-24 11:38:51,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200553250345782 [2023-08-24 11:38:51,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-24 11:38:51,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-24 11:38:51,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:51,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-24 11:38:51,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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-08-24 11:38:51,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:51,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:51,144 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 376 transitions. [2023-08-24 11:38:51,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 178 flow [2023-08-24 11:38:51,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:38:51,146 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2023-08-24 11:38:51,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-08-24 11:38:51,150 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-08-24 11:38:51,150 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 85 flow [2023-08-24 11:38:51,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 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-08-24 11:38:51,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:51,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:38:51,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:38:51,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:51,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:51,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1599312791, now seen corresponding path program 1 times [2023-08-24 11:38:51,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:51,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46577356] [2023-08-24 11:38:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:51,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46577356] [2023-08-24 11:38:51,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46577356] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:51,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:38:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270916061] [2023-08-24 11:38:51,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:51,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:38:51,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:51,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:38:51,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:38:51,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-08-24 11:38:51,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-08-24 11:38:51,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:51,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-08-24 11:38:51,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:53,719 INFO L124 PetriNetUnfolderBase]: 19083/25899 cut-off events. [2023-08-24 11:38:53,720 INFO L125 PetriNetUnfolderBase]: For 3072/3072 co-relation queries the response was YES. [2023-08-24 11:38:53,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55730 conditions, 25899 events. 19083/25899 cut-off events. For 3072/3072 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 142716 event pairs, 1704 based on Foata normal form. 740/26639 useless extension candidates. Maximal degree in co-relation 55719. Up to 15559 conditions per place. [2023-08-24 11:38:53,835 INFO L140 encePairwiseOnDemand]: 231/241 looper letters, 66 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2023-08-24 11:38:53,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 79 transitions, 369 flow [2023-08-24 11:38:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:38:53,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:38:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 487 transitions. [2023-08-24 11:38:53,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051867219917012 [2023-08-24 11:38:53,838 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 487 transitions. [2023-08-24 11:38:53,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 487 transitions. [2023-08-24 11:38:53,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:53,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 487 transitions. [2023-08-24 11:38:53,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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-08-24 11:38:53,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:38:53,842 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:38:53,842 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 85 flow. Second operand 4 states and 487 transitions. [2023-08-24 11:38:53,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 79 transitions, 369 flow [2023-08-24 11:38:53,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 79 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:38:53,844 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 190 flow [2023-08-24 11:38:53,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-24 11:38:53,845 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2023-08-24 11:38:53,845 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 190 flow [2023-08-24 11:38:53,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 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-08-24 11:38:53,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:53,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:38:53,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:38:53,846 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:53,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2025780680, now seen corresponding path program 1 times [2023-08-24 11:38:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048563840] [2023-08-24 11:38:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:53,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048563840] [2023-08-24 11:38:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048563840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:54,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:38:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967661967] [2023-08-24 11:38:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:54,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:38:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:38:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:38:54,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-08-24 11:38:54,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 190 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:38:54,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:54,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-08-24 11:38:54,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:55,892 INFO L124 PetriNetUnfolderBase]: 18222/24736 cut-off events. [2023-08-24 11:38:55,892 INFO L125 PetriNetUnfolderBase]: For 18091/18091 co-relation queries the response was YES. [2023-08-24 11:38:55,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65921 conditions, 24736 events. 18222/24736 cut-off events. For 18091/18091 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 127735 event pairs, 4702 based on Foata normal form. 215/24951 useless extension candidates. Maximal degree in co-relation 65906. Up to 10589 conditions per place. [2023-08-24 11:38:56,028 INFO L140 encePairwiseOnDemand]: 232/241 looper letters, 68 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2023-08-24 11:38:56,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 484 flow [2023-08-24 11:38:56,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:38:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:38:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-24 11:38:56,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927385892116183 [2023-08-24 11:38:56,031 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-24 11:38:56,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-24 11:38:56,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:56,031 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-24 11:38:56,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 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-08-24 11:38:56,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:38:56,035 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:38:56,035 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 190 flow. Second operand 4 states and 475 transitions. [2023-08-24 11:38:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 484 flow [2023-08-24 11:38:56,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 484 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:38:56,042 INFO L231 Difference]: Finished difference. Result has 52 places, 52 transitions, 316 flow [2023-08-24 11:38:56,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=316, PETRI_PLACES=52, PETRI_TRANSITIONS=52} [2023-08-24 11:38:56,043 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-08-24 11:38:56,043 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 52 transitions, 316 flow [2023-08-24 11:38:56,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:38:56,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:56,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:38:56,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:38:56,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:56,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:56,045 INFO L85 PathProgramCache]: Analyzing trace with hash -988761192, now seen corresponding path program 1 times [2023-08-24 11:38:56,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:56,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124655542] [2023-08-24 11:38:56,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:56,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124655542] [2023-08-24 11:38:56,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124655542] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:56,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:56,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:38:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088241436] [2023-08-24 11:38:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:56,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:38:56,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:56,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:38:56,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:38:56,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 241 [2023-08-24 11:38:56,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 52 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:38:56,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:56,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 241 [2023-08-24 11:38:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:57,767 INFO L124 PetriNetUnfolderBase]: 12417/17960 cut-off events. [2023-08-24 11:38:57,767 INFO L125 PetriNetUnfolderBase]: For 25553/26287 co-relation queries the response was YES. [2023-08-24 11:38:57,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50631 conditions, 17960 events. 12417/17960 cut-off events. For 25553/26287 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 111434 event pairs, 3656 based on Foata normal form. 376/17710 useless extension candidates. Maximal degree in co-relation 50611. Up to 11434 conditions per place. [2023-08-24 11:38:57,876 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 52 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-24 11:38:57,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 504 flow [2023-08-24 11:38:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:38:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:38:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-24 11:38:57,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311203319502075 [2023-08-24 11:38:57,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-24 11:38:57,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-24 11:38:57,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:57,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-24 11:38:57,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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-08-24 11:38:57,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:57,885 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 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-08-24 11:38:57,885 INFO L175 Difference]: Start difference. First operand has 52 places, 52 transitions, 316 flow. Second operand 3 states and 384 transitions. [2023-08-24 11:38:57,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 504 flow [2023-08-24 11:38:57,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 501 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:38:57,899 INFO L231 Difference]: Finished difference. Result has 54 places, 52 transitions, 327 flow [2023-08-24 11:38:57,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=54, PETRI_TRANSITIONS=52} [2023-08-24 11:38:57,901 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-08-24 11:38:57,901 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 52 transitions, 327 flow [2023-08-24 11:38:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:38:57,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:57,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:38:57,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:38:57,902 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:57,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash 199604137, now seen corresponding path program 1 times [2023-08-24 11:38:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307152974] [2023-08-24 11:38:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307152974] [2023-08-24 11:38:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307152974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:58,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:58,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:38:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685139773] [2023-08-24 11:38:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:58,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:38:58,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:58,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:38:58,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:38:58,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:38:58,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 52 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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-08-24 11:38:58,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:58,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:38:58,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:38:59,365 INFO L124 PetriNetUnfolderBase]: 10415/15561 cut-off events. [2023-08-24 11:38:59,365 INFO L125 PetriNetUnfolderBase]: For 18811/20493 co-relation queries the response was YES. [2023-08-24 11:38:59,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42401 conditions, 15561 events. 10415/15561 cut-off events. For 18811/20493 co-relation queries the response was YES. Maximal size of possible extension queue 833. Compared 101837 event pairs, 1801 based on Foata normal form. 1369/16425 useless extension candidates. Maximal degree in co-relation 42379. Up to 9203 conditions per place. [2023-08-24 11:38:59,462 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 96 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2023-08-24 11:38:59,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 125 transitions, 895 flow [2023-08-24 11:38:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:38:59,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:38:59,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 607 transitions. [2023-08-24 11:38:59,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037344398340249 [2023-08-24 11:38:59,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 607 transitions. [2023-08-24 11:38:59,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 607 transitions. [2023-08-24 11:38:59,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:38:59,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 607 transitions. [2023-08-24 11:38:59,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 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-08-24 11:38:59,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-24 11:38:59,471 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 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-08-24 11:38:59,472 INFO L175 Difference]: Start difference. First operand has 54 places, 52 transitions, 327 flow. Second operand 5 states and 607 transitions. [2023-08-24 11:38:59,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 125 transitions, 895 flow [2023-08-24 11:38:59,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 125 transitions, 874 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 11:38:59,483 INFO L231 Difference]: Finished difference. Result has 58 places, 61 transitions, 387 flow [2023-08-24 11:38:59,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=58, PETRI_TRANSITIONS=61} [2023-08-24 11:38:59,486 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-08-24 11:38:59,486 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 61 transitions, 387 flow [2023-08-24 11:38:59,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 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-08-24 11:38:59,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:38:59,487 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-08-24 11:38:59,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:38:59,490 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:38:59,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:38:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1737666356, now seen corresponding path program 1 times [2023-08-24 11:38:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:38:59,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809520871] [2023-08-24 11:38:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:38:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:38:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:38:59,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:38:59,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:38:59,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809520871] [2023-08-24 11:38:59,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809520871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:38:59,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:38:59,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:38:59,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353817566] [2023-08-24 11:38:59,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:38:59,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:38:59,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:38:59,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:38:59,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:38:59,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:38:59,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 61 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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-08-24 11:38:59,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:38:59,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:38:59,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:00,994 INFO L124 PetriNetUnfolderBase]: 8458/13000 cut-off events. [2023-08-24 11:39:00,995 INFO L125 PetriNetUnfolderBase]: For 18638/19824 co-relation queries the response was YES. [2023-08-24 11:39:01,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43096 conditions, 13000 events. 8458/13000 cut-off events. For 18638/19824 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 87179 event pairs, 1025 based on Foata normal form. 912/13492 useless extension candidates. Maximal degree in co-relation 43072. Up to 3862 conditions per place. [2023-08-24 11:39:01,057 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 134 selfloop transitions, 19 changer transitions 0/172 dead transitions. [2023-08-24 11:39:01,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 172 transitions, 1293 flow [2023-08-24 11:39:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:39:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:39:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2023-08-24 11:39:01,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050385299347955 [2023-08-24 11:39:01,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2023-08-24 11:39:01,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2023-08-24 11:39:01,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:01,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2023-08-24 11:39:01,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 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-08-24 11:39:01,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:01,068 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:01,068 INFO L175 Difference]: Start difference. First operand has 58 places, 61 transitions, 387 flow. Second operand 7 states and 852 transitions. [2023-08-24 11:39:01,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 172 transitions, 1293 flow [2023-08-24 11:39:01,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 172 transitions, 1288 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:39:01,115 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 516 flow [2023-08-24 11:39:01,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2023-08-24 11:39:01,115 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 22 predicate places. [2023-08-24 11:39:01,116 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 516 flow [2023-08-24 11:39:01,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 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-08-24 11:39:01,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:01,116 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-08-24 11:39:01,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:39:01,116 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:01,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:01,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1691158552, now seen corresponding path program 1 times [2023-08-24 11:39:01,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:01,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436594078] [2023-08-24 11:39:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:01,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:01,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436594078] [2023-08-24 11:39:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436594078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:39:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869058475] [2023-08-24 11:39:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:01,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:39:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:39:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:39:01,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 241 [2023-08-24 11:39:01,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 516 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-08-24 11:39:01,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:01,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 241 [2023-08-24 11:39:01,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:02,902 INFO L124 PetriNetUnfolderBase]: 12715/19517 cut-off events. [2023-08-24 11:39:02,902 INFO L125 PetriNetUnfolderBase]: For 54557/56038 co-relation queries the response was YES. [2023-08-24 11:39:02,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76160 conditions, 19517 events. 12715/19517 cut-off events. For 54557/56038 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 135766 event pairs, 2662 based on Foata normal form. 311/19463 useless extension candidates. Maximal degree in co-relation 76132. Up to 9742 conditions per place. [2023-08-24 11:39:02,985 INFO L140 encePairwiseOnDemand]: 238/241 looper letters, 97 selfloop transitions, 3 changer transitions 28/144 dead transitions. [2023-08-24 11:39:02,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 144 transitions, 1316 flow [2023-08-24 11:39:02,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:39:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:39:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2023-08-24 11:39:02,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238589211618258 [2023-08-24 11:39:02,988 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2023-08-24 11:39:02,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2023-08-24 11:39:02,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:02,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2023-08-24 11:39:02,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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-08-24 11:39:02,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:39:02,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 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-08-24 11:39:02,991 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 516 flow. Second operand 4 states and 505 transitions. [2023-08-24 11:39:02,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 144 transitions, 1316 flow [2023-08-24 11:39:03,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 144 transitions, 1181 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-08-24 11:39:03,634 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 499 flow [2023-08-24 11:39:03,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=499, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-08-24 11:39:03,634 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 24 predicate places. [2023-08-24 11:39:03,635 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 499 flow [2023-08-24 11:39:03,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 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-08-24 11:39:03,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:03,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:03,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:39:03,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:03,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 579770698, now seen corresponding path program 1 times [2023-08-24 11:39:03,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:03,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214549346] [2023-08-24 11:39:03,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:03,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:03,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:03,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214549346] [2023-08-24 11:39:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214549346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:03,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:03,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:39:03,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981861002] [2023-08-24 11:39:03,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:03,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:39:03,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:03,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:39:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:39:03,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:39:03,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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-08-24 11:39:03,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:03,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:39:03,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:05,390 INFO L124 PetriNetUnfolderBase]: 10960/16902 cut-off events. [2023-08-24 11:39:05,390 INFO L125 PetriNetUnfolderBase]: For 32738/34249 co-relation queries the response was YES. [2023-08-24 11:39:05,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58883 conditions, 16902 events. 10960/16902 cut-off events. For 32738/34249 co-relation queries the response was YES. Maximal size of possible extension queue 943. Compared 119806 event pairs, 1109 based on Foata normal form. 597/17021 useless extension candidates. Maximal degree in co-relation 58854. Up to 4184 conditions per place. [2023-08-24 11:39:05,474 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 147 selfloop transitions, 28 changer transitions 13/209 dead transitions. [2023-08-24 11:39:05,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 209 transitions, 1664 flow [2023-08-24 11:39:05,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:39:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:39:05,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1095 transitions. [2023-08-24 11:39:05,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048409405255878 [2023-08-24 11:39:05,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1095 transitions. [2023-08-24 11:39:05,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1095 transitions. [2023-08-24 11:39:05,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:05,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1095 transitions. [2023-08-24 11:39:05,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.66666666666667) internal successors, (1095), 9 states have internal predecessors, (1095), 0 states have call successors, (0), 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-08-24 11:39:05,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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-08-24 11:39:05,485 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 241.0) internal successors, (2410), 10 states have internal predecessors, (2410), 0 states have call successors, (0), 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-08-24 11:39:05,485 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 499 flow. Second operand 9 states and 1095 transitions. [2023-08-24 11:39:05,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 209 transitions, 1664 flow [2023-08-24 11:39:06,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 209 transitions, 1656 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:39:06,351 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 676 flow [2023-08-24 11:39:06,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=676, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2023-08-24 11:39:06,352 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 34 predicate places. [2023-08-24 11:39:06,352 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 676 flow [2023-08-24 11:39:06,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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-08-24 11:39:06,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:06,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:06,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:39:06,353 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:06,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash -584392209, now seen corresponding path program 1 times [2023-08-24 11:39:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:06,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023662284] [2023-08-24 11:39:06,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023662284] [2023-08-24 11:39:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023662284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:06,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:06,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:39:06,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587816101] [2023-08-24 11:39:06,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:06,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:39:06,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:39:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:39:06,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 241 [2023-08-24 11:39:06,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 676 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 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-08-24 11:39:06,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:06,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 241 [2023-08-24 11:39:06,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:10,119 INFO L124 PetriNetUnfolderBase]: 19063/30151 cut-off events. [2023-08-24 11:39:10,119 INFO L125 PetriNetUnfolderBase]: For 92622/94307 co-relation queries the response was YES. [2023-08-24 11:39:10,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120756 conditions, 30151 events. 19063/30151 cut-off events. For 92622/94307 co-relation queries the response was YES. Maximal size of possible extension queue 1676. Compared 239979 event pairs, 4554 based on Foata normal form. 288/29638 useless extension candidates. Maximal degree in co-relation 120723. Up to 16098 conditions per place. [2023-08-24 11:39:10,383 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 138 selfloop transitions, 13 changer transitions 76/248 dead transitions. [2023-08-24 11:39:10,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 248 transitions, 2546 flow [2023-08-24 11:39:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:39:10,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:39:10,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 751 transitions. [2023-08-24 11:39:10,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193637621023514 [2023-08-24 11:39:10,386 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 751 transitions. [2023-08-24 11:39:10,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 751 transitions. [2023-08-24 11:39:10,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:10,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 751 transitions. [2023-08-24 11:39:10,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.16666666666667) internal successors, (751), 6 states have internal predecessors, (751), 0 states have call successors, (0), 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-08-24 11:39:10,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-24 11:39:10,390 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 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-08-24 11:39:10,390 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 676 flow. Second operand 6 states and 751 transitions. [2023-08-24 11:39:10,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 248 transitions, 2546 flow [2023-08-24 11:39:14,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 248 transitions, 2109 flow, removed 154 selfloop flow, removed 4 redundant places. [2023-08-24 11:39:14,579 INFO L231 Difference]: Finished difference. Result has 82 places, 93 transitions, 707 flow [2023-08-24 11:39:14,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=707, PETRI_PLACES=82, PETRI_TRANSITIONS=93} [2023-08-24 11:39:14,580 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 38 predicate places. [2023-08-24 11:39:14,580 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 93 transitions, 707 flow [2023-08-24 11:39:14,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 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-08-24 11:39:14,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:14,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:14,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:39:14,581 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:14,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:14,581 INFO L85 PathProgramCache]: Analyzing trace with hash 193183587, now seen corresponding path program 2 times [2023-08-24 11:39:14,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558430256] [2023-08-24 11:39:14,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:15,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558430256] [2023-08-24 11:39:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558430256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:39:15,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054218167] [2023-08-24 11:39:15,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:15,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:39:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:15,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:39:15,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:39:15,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:39:15,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 93 transitions, 707 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 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-08-24 11:39:15,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:15,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:39:15,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:17,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L829-->L845: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_56 256) 0)) (.cse8 (= (mod v_~a$r_buff0_thd4~0_60 256) 0))) (let ((.cse10 (not .cse8)) (.cse11 (and .cse8 (= (mod v_~a$w_buff1_used~0_135 256) 0))) (.cse9 (and .cse3 .cse8)) (.cse12 (= (mod v_~a$w_buff0_used~0_148 256) 0))) (let ((.cse5 (or .cse11 .cse9 .cse12)) (.cse6 (and (not .cse12) .cse10))) (let ((.cse2 (= (mod v_~a$w_buff1_used~0_134 256) 0)) (.cse7 (ite .cse5 v_~a~0_85 (ite .cse6 v_~a$w_buff0~0_65 v_~a$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0))) (.cse4 (= (mod v_~a$w_buff0_used~0_147 256) 0))) (and (= v_~a$flush_delayed~0_23 0) (= (ite .cse0 v_~a$r_buff1_thd4~0_56 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_59 256) 0))) (or (and .cse1 .cse2) (and .cse1 .cse3) .cse4)) v_~a$r_buff1_thd4~0_56 0)) v_~a$r_buff1_thd4~0_55) (= v_~a$w_buff1~0_58 v_~a$w_buff1~0_57) (= v_~a$w_buff0~0_65 v_~a$w_buff0~0_64) (= (ite .cse0 v_~a$w_buff0_used~0_148 (ite .cse5 v_~a$w_buff0_used~0_148 (ite .cse6 0 v_~a$w_buff0_used~0_148))) v_~a$w_buff0_used~0_147) (= v_~a~0_85 v_~a$mem_tmp~0_14) (= .cse7 v_~__unbuffered_p3_EBX~0_10) (= v_~a$r_buff0_thd4~0_59 (ite .cse0 v_~a$r_buff0_thd4~0_60 (ite (or (and .cse8 .cse2) .cse9 .cse4) v_~a$r_buff0_thd4~0_60 (ite (and (not .cse4) .cse10) 0 v_~a$r_buff0_thd4~0_60)))) (= v_~a~0_84 (ite .cse0 v_~a$mem_tmp~0_14 .cse7)) (= (ite .cse0 v_~a$w_buff1_used~0_135 (ite (or .cse11 .cse9 .cse4) v_~a$w_buff1_used~0_135 0)) v_~a$w_buff1_used~0_134)))))) InVars {~a~0=v_~a~0_85, ~a$w_buff1~0=v_~a$w_buff1~0_58, ~a$w_buff0~0=v_~a$w_buff0~0_65, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_56, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_148, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_135, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_60} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_55, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_147, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_84, ~a$mem_tmp~0=v_~a$mem_tmp~0_14, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_57, ~a$flush_delayed~0=v_~a$flush_delayed~0_23, ~a$w_buff0~0=v_~a$w_buff0~0_64, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_30, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][64], [Black: 189#(<= ~__unbuffered_cnt~0 1), Black: 190#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 118#L789true, 218#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 155#true, P1Thread1of1ForFork3InUse, Black: 201#(= ~y~0 1), 65#P2EXITtrue, P0Thread1of1ForFork1InUse, 225#true, 244#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (< 0 (+ (div ~a$r_buff0_thd2~0 256) 1)) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 152#(<= ~z~0 0), Black: 214#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 204#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 220#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 213#(<= ~__unbuffered_cnt~0 2), 120#L763true, Black: 158#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 59#L3true, Black: 165#(= ~__unbuffered_p3_EAX~0 0), Black: 227#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 229#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 228#(and (= ~a~0 1) (= ~a$w_buff0_used~0 0)), Black: 173#(= ~__unbuffered_p1_EAX~0 0), Black: 179#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 78#L845true, Black: 181#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 178#(= ~__unbuffered_cnt~0 0), 163#true]) [2023-08-24 11:39:17,243 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,243 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,243 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,243 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,243 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([386] L763-->L766: Formula: (= v_~x~0_1 1) InVars {} OutVars{~x~0=v_~x~0_1} AuxVars[] AssignedVars[~x~0][73], [113#L766true, Black: 189#(<= ~__unbuffered_cnt~0 1), Black: 190#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 166#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, P3Thread1of1ForFork2InUse, 118#L789true, 218#(and (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P1Thread1of1ForFork3InUse, 158#(or (not (= 2 ~__unbuffered_p1_EAX~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 201#(= ~y~0 1), 65#P2EXITtrue, P0Thread1of1ForFork1InUse, 244#(and (<= ~a$r_buff0_thd2~0 0) (= ~a$r_buff1_thd4~0 0) (= ~a$r_buff1_thd2~0 0) (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (< 0 (+ (div ~a$r_buff0_thd2~0 256) 1)) (= ~a$r_buff0_thd1~0 1) (= ~a$r_buff0_thd4~0 0)), Black: 152#(<= ~z~0 0), Black: 214#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 204#(and (= ~__unbuffered_p1_EBX~0 1) (= ~y~0 1)), Black: 220#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 213#(<= ~__unbuffered_cnt~0 2), Black: 155#true, 59#L3true, Black: 165#(= ~__unbuffered_p3_EAX~0 0), Black: 229#(not (= ~__unbuffered_p3_EBX~0 0)), Black: 163#true, Black: 228#(and (= ~a~0 1) (= ~a$w_buff0_used~0 0)), Black: 173#(= ~__unbuffered_p1_EAX~0 0), 25#L829true, 227#(and (= ~a$w_buff0~0 1) (= ~a$w_buff0_used~0 1) (= ~a$r_buff0_thd1~0 1)), Black: 179#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 181#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), Black: 178#(= ~__unbuffered_cnt~0 0)]) [2023-08-24 11:39:17,244 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,244 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,244 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:17,244 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-08-24 11:39:18,433 INFO L124 PetriNetUnfolderBase]: 19700/31829 cut-off events. [2023-08-24 11:39:18,434 INFO L125 PetriNetUnfolderBase]: For 87565/91168 co-relation queries the response was YES. [2023-08-24 11:39:18,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131208 conditions, 31829 events. 19700/31829 cut-off events. For 87565/91168 co-relation queries the response was YES. Maximal size of possible extension queue 1765. Compared 262569 event pairs, 3389 based on Foata normal form. 1024/32154 useless extension candidates. Maximal degree in co-relation 131172. Up to 10993 conditions per place. [2023-08-24 11:39:18,757 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 153 selfloop transitions, 12 changer transitions 76/262 dead transitions. [2023-08-24 11:39:18,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 262 transitions, 2352 flow [2023-08-24 11:39:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:39:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:39:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2023-08-24 11:39:18,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49259039715471253 [2023-08-24 11:39:18,760 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2023-08-24 11:39:18,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2023-08-24 11:39:18,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:18,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2023-08-24 11:39:18,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 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-08-24 11:39:18,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:18,765 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:18,765 INFO L175 Difference]: Start difference. First operand has 82 places, 93 transitions, 707 flow. Second operand 7 states and 831 transitions. [2023-08-24 11:39:18,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 262 transitions, 2352 flow [2023-08-24 11:39:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 262 transitions, 2348 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 11:39:23,053 INFO L231 Difference]: Finished difference. Result has 88 places, 98 transitions, 798 flow [2023-08-24 11:39:23,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=798, PETRI_PLACES=88, PETRI_TRANSITIONS=98} [2023-08-24 11:39:23,054 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2023-08-24 11:39:23,054 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 98 transitions, 798 flow [2023-08-24 11:39:23,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 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-08-24 11:39:23,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:23,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:23,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:39:23,056 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:23,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1884111661, now seen corresponding path program 3 times [2023-08-24 11:39:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691952358] [2023-08-24 11:39:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:23,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:23,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691952358] [2023-08-24 11:39:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691952358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:39:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304340726] [2023-08-24 11:39:23,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:39:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:39:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:39:23,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 241 [2023-08-24 11:39:23,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 98 transitions, 798 flow. Second operand has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 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-08-24 11:39:23,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:23,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 241 [2023-08-24 11:39:23,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:26,317 INFO L124 PetriNetUnfolderBase]: 17698/28157 cut-off events. [2023-08-24 11:39:26,317 INFO L125 PetriNetUnfolderBase]: For 101769/104676 co-relation queries the response was YES. [2023-08-24 11:39:26,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124746 conditions, 28157 events. 17698/28157 cut-off events. For 101769/104676 co-relation queries the response was YES. Maximal size of possible extension queue 1707. Compared 227035 event pairs, 989 based on Foata normal form. 566/27966 useless extension candidates. Maximal degree in co-relation 124710. Up to 6922 conditions per place. [2023-08-24 11:39:26,473 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 149 selfloop transitions, 30 changer transitions 100/298 dead transitions. [2023-08-24 11:39:26,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 298 transitions, 2798 flow [2023-08-24 11:39:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 11:39:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 11:39:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1310 transitions. [2023-08-24 11:39:26,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941531497548095 [2023-08-24 11:39:26,477 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1310 transitions. [2023-08-24 11:39:26,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1310 transitions. [2023-08-24 11:39:26,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:26,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1310 transitions. [2023-08-24 11:39:26,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.0909090909091) internal successors, (1310), 11 states have internal predecessors, (1310), 0 states have call successors, (0), 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-08-24 11:39:26,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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-08-24 11:39:26,483 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 241.0) internal successors, (2892), 12 states have internal predecessors, (2892), 0 states have call successors, (0), 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-08-24 11:39:26,483 INFO L175 Difference]: Start difference. First operand has 88 places, 98 transitions, 798 flow. Second operand 11 states and 1310 transitions. [2023-08-24 11:39:26,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 298 transitions, 2798 flow [2023-08-24 11:39:31,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 298 transitions, 2717 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-08-24 11:39:31,047 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 715 flow [2023-08-24 11:39:31,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=715, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2023-08-24 11:39:31,047 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 50 predicate places. [2023-08-24 11:39:31,047 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 715 flow [2023-08-24 11:39:31,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.0) internal successors, (770), 7 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-08-24 11:39:31,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:31,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:31,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:39:31,048 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:31,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:31,048 INFO L85 PathProgramCache]: Analyzing trace with hash -937626459, now seen corresponding path program 1 times [2023-08-24 11:39:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:31,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461897959] [2023-08-24 11:39:31,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:31,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:39:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:39:31,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:39:31,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461897959] [2023-08-24 11:39:31,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461897959] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:39:31,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:39:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:39:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448426930] [2023-08-24 11:39:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:39:31,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 11:39:31,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:39:31,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 11:39:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 11:39:31,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-24 11:39:31,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 715 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:31,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:39:31,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-24 11:39:31,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:39:34,899 INFO L124 PetriNetUnfolderBase]: 15747/26439 cut-off events. [2023-08-24 11:39:34,900 INFO L125 PetriNetUnfolderBase]: For 103088/106525 co-relation queries the response was YES. [2023-08-24 11:39:35,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123980 conditions, 26439 events. 15747/26439 cut-off events. For 103088/106525 co-relation queries the response was YES. Maximal size of possible extension queue 1617. Compared 226075 event pairs, 2063 based on Foata normal form. 1049/26969 useless extension candidates. Maximal degree in co-relation 123940. Up to 13707 conditions per place. [2023-08-24 11:39:35,127 INFO L140 encePairwiseOnDemand]: 235/241 looper letters, 109 selfloop transitions, 7 changer transitions 54/188 dead transitions. [2023-08-24 11:39:35,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 188 transitions, 1881 flow [2023-08-24 11:39:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:39:35,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:39:35,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 803 transitions. [2023-08-24 11:39:35,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759928867812685 [2023-08-24 11:39:35,130 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 803 transitions. [2023-08-24 11:39:35,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 803 transitions. [2023-08-24 11:39:35,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:39:35,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 803 transitions. [2023-08-24 11:39:35,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 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-08-24 11:39:35,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:35,136 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 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-08-24 11:39:35,136 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 715 flow. Second operand 7 states and 803 transitions. [2023-08-24 11:39:35,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 188 transitions, 1881 flow [2023-08-24 11:39:37,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 188 transitions, 1584 flow, removed 59 selfloop flow, removed 10 redundant places. [2023-08-24 11:39:37,411 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 613 flow [2023-08-24 11:39:37,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=613, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2023-08-24 11:39:37,411 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 47 predicate places. [2023-08-24 11:39:37,411 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 613 flow [2023-08-24 11:39:37,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:39:37,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:39:37,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:37,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:39:37,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:39:37,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:39:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1750430487, now seen corresponding path program 2 times [2023-08-24 11:39:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:39:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568693682] [2023-08-24 11:39:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:39:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:39:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:39:37,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:39:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:39:37,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:39:37,562 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:39:37,563 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:39:37,564 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:39:37,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:39:37,571 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:39:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:39:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:39:37,572 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:39:37,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-24 11:39:37,573 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:39:37,579 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:39:37,579 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:39:37,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:39:37 BasicIcfg [2023-08-24 11:39:37,674 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:39:37,674 INFO L158 Benchmark]: Toolchain (without parser) took 54449.12ms. Allocated memory was 343.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 318.7MB in the beginning and 6.1GB in the end (delta: -5.7GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-24 11:39:37,674 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 343.9MB. Free memory is still 320.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:39:37,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 343.9MB. Free memory was 318.2MB in the beginning and 294.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:39:37,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.16ms. Allocated memory is still 343.9MB. Free memory was 294.1MB in the beginning and 291.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 11:39:37,675 INFO L158 Benchmark]: Boogie Preprocessor took 52.01ms. Allocated memory is still 343.9MB. Free memory was 291.5MB in the beginning and 289.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:39:37,676 INFO L158 Benchmark]: RCFGBuilder took 632.54ms. Allocated memory is still 343.9MB. Free memory was 289.4MB in the beginning and 301.2MB in the end (delta: -11.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-24 11:39:37,676 INFO L158 Benchmark]: TraceAbstraction took 53184.81ms. Allocated memory was 343.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 300.2MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-24 11:39:37,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 343.9MB. Free memory is still 320.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.23ms. Allocated memory is still 343.9MB. Free memory was 318.2MB in the beginning and 294.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 74.16ms. Allocated memory is still 343.9MB. Free memory was 294.1MB in the beginning and 291.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 52.01ms. Allocated memory is still 343.9MB. Free memory was 291.5MB in the beginning and 289.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 632.54ms. Allocated memory is still 343.9MB. Free memory was 289.4MB in the beginning and 301.2MB in the end (delta: -11.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * TraceAbstraction took 53184.81ms. Allocated memory was 343.9MB in the beginning and 7.3GB in the end (delta: 6.9GB). Free memory was 300.2MB in the beginning and 6.1GB in the end (delta: -5.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 139 PlacesBefore, 44 PlacesAfterwards, 128 TransitionsBefore, 32 TransitionsAfterwards, 3300 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 10097 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3639, independent: 3371, independent conditional: 0, independent unconditional: 3371, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1752, independent: 1705, independent conditional: 0, independent unconditional: 1705, dependent: 47, dependent conditional: 0, dependent unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3639, independent: 1666, independent conditional: 0, independent unconditional: 1666, dependent: 221, dependent conditional: 0, dependent unconditional: 221, unknown: 1752, unknown conditional: 0, unknown unconditional: 1752] , Statistics on independence cache: Total cache size (in pairs): 173, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t601; [L870] FCALL, FORK 0 pthread_create(&t601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t601, ((void *)0), P0, ((void *)0))=-3, t601={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t602; [L872] FCALL, FORK 0 pthread_create(&t602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t602, ((void *)0), P1, ((void *)0))=-2, t601={5:0}, t602={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t603; [L874] FCALL, FORK 0 pthread_create(&t603, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t603, ((void *)0), P2, ((void *)0))=-1, t601={5:0}, t602={6:0}, t603={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t604; [L876] FCALL, FORK 0 pthread_create(&t604, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t604, ((void *)0), P3, ((void *)0))=0, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L788] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L805] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L808] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L825] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L791] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L792] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L793] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L794] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L795] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=1, x=2, y=1, z=2] [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, 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, t601={5:0}, t602={6:0}, t603={7:0}, t604={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 870]: 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, 170 locations, 7 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: 53.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 44.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1758 IncrementalHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 15 mSDtfsCounter, 1758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=798occurred in iteration=11, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 1602 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-08-24 11:39:37,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...