/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/mix053.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:44:39,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:44:39,732 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:44:39,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:44:39,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:44:39,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:44:39,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:44:39,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:44:39,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:44:39,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:44:39,763 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:44:39,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:44:39,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:44:39,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:44:39,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:44:39,766 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:44:39,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:44:39,766 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:44:39,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:44:39,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:44:39,767 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:44:39,767 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:44:39,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:39,767 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:44:39,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:44:39,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:44:39,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:44:39,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:44:39,768 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:44:39,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:44:39,769 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:44:39,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:44:39,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:44:39,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:44:39,989 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:44:39,989 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:44:39,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-24 11:44:40,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:44:41,153 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:44:41,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053.opt.i [2023-08-24 11:44:41,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4894238/5db42470876a43a2bd5ce927cc064f17/FLAG45f7ea6bf [2023-08-24 11:44:41,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4894238/5db42470876a43a2bd5ce927cc064f17 [2023-08-24 11:44:41,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:44:41,187 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:44:41,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:41,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:44:41,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:44:41,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bdc46c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41, skipping insertion in model container [2023-08-24 11:44:41,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,237 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:44:41,367 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/mix053.opt.i[944,957] [2023-08-24 11:44:41,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:41,508 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:44:41,518 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/mix053.opt.i[944,957] [2023-08-24 11:44:41,531 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:41,536 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:44:41,555 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:44:41,576 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:41,576 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:44:41,581 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:44:41,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41 WrapperNode [2023-08-24 11:44:41,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:44:41,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:41,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:44:41,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:44:41,586 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:44:41" (1/1) ... [2023-08-24 11:44:41,598 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:44:41" (1/1) ... [2023-08-24 11:44:41,614 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2023-08-24 11:44:41,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:44:41,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:44:41,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:44:41,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:44:41,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,635 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,645 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:44:41,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:44:41,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:44:41,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:44:41,656 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (1/1) ... [2023-08-24 11:44:41,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:44:41,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:44:41,680 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:44:41,686 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:44:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:44:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:44:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:44:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:44:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:44:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:44:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:44:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:44:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:44:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 11:44:41,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 11:44:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-24 11:44:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-24 11:44:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:44:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:44:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:44:41,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:44:41,709 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:44:41,818 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:44:41,820 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:44:42,094 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:44:42,208 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:44:42,208 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:44:42,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:42 BoogieIcfgContainer [2023-08-24 11:44:42,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:44:42,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:44:42,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:44:42,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:44:42,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:44:41" (1/3) ... [2023-08-24 11:44:42,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6951266d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:42, skipping insertion in model container [2023-08-24 11:44:42,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:44:41" (2/3) ... [2023-08-24 11:44:42,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6951266d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:44:42, skipping insertion in model container [2023-08-24 11:44:42,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:44:42" (3/3) ... [2023-08-24 11:44:42,216 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053.opt.i [2023-08-24 11:44:42,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:44:42,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:44:42,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:44:42,270 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:44:42,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 270 flow [2023-08-24 11:44:42,351 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 11:44:42,351 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:42,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-24 11:44:42,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 125 transitions, 270 flow [2023-08-24 11:44:42,360 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 121 transitions, 254 flow [2023-08-24 11:44:42,362 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:44:42,371 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 121 transitions, 254 flow [2023-08-24 11:44:42,373 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 121 transitions, 254 flow [2023-08-24 11:44:42,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 121 transitions, 254 flow [2023-08-24 11:44:42,404 INFO L124 PetriNetUnfolderBase]: 2/121 cut-off events. [2023-08-24 11:44:42,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:42,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-24 11:44:42,407 INFO L119 LiptonReduction]: Number of co-enabled transitions 2620 [2023-08-24 11:44:45,443 INFO L134 LiptonReduction]: Checked pairs total: 6159 [2023-08-24 11:44:45,443 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-24 11:44:45,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:44:45,459 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;@26e4a71f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:44:45,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 11:44:45,472 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:44:45,472 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2023-08-24 11:44:45,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:44:45,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:45,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:45,473 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:45,476 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:45,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1951838619, now seen corresponding path program 1 times [2023-08-24 11:44:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516418897] [2023-08-24 11:44:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:45,804 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:44:45,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:45,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516418897] [2023-08-24 11:44:45,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516418897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:45,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:45,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:44:45,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590613232] [2023-08-24 11:44:45,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:45,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:45,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:45,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:45,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:45,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 232 [2023-08-24 11:44:45,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:44:45,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:45,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 232 [2023-08-24 11:44:45,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:46,156 INFO L124 PetriNetUnfolderBase]: 2075/3080 cut-off events. [2023-08-24 11:44:46,157 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-24 11:44:46,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6076 conditions, 3080 events. 2075/3080 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 15902 event pairs, 518 based on Foata normal form. 0/2932 useless extension candidates. Maximal degree in co-relation 6064. Up to 2098 conditions per place. [2023-08-24 11:44:46,172 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2023-08-24 11:44:46,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 150 flow [2023-08-24 11:44:46,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:46,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-24 11:44:46,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2023-08-24 11:44:46,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-24 11:44:46,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-24 11:44:46,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:46,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-24 11:44:46,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 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:44:46,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:46,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:46,198 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 372 transitions. [2023-08-24 11:44:46,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 150 flow [2023-08-24 11:44:46,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:46,203 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 60 flow [2023-08-24 11:44:46,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-24 11:44:46,207 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-08-24 11:44:46,207 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 60 flow [2023-08-24 11:44:46,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 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:44:46,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:46,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:46,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:44:46,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:46,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:46,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1183873960, now seen corresponding path program 1 times [2023-08-24 11:44:46,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:46,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356880421] [2023-08-24 11:44:46,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:46,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:46,361 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:44:46,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:46,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356880421] [2023-08-24 11:44:46,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356880421] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:46,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:46,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:44:46,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471302527] [2023-08-24 11:44:46,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:46,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:46,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:46,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:46,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-08-24 11:44:46,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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:44:46,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:46,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-08-24 11:44:46,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:46,597 INFO L124 PetriNetUnfolderBase]: 2213/3098 cut-off events. [2023-08-24 11:44:46,598 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-08-24 11:44:46,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6500 conditions, 3098 events. 2213/3098 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14023 event pairs, 723 based on Foata normal form. 24/3109 useless extension candidates. Maximal degree in co-relation 6490. Up to 2835 conditions per place. [2023-08-24 11:44:46,609 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 33 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2023-08-24 11:44:46,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 38 transitions, 166 flow [2023-08-24 11:44:46,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:46,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-08-24 11:44:46,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2023-08-24 11:44:46,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-08-24 11:44:46,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-08-24 11:44:46,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:46,611 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-08-24 11:44:46,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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:44:46,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:46,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:46,614 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 60 flow. Second operand 3 states and 364 transitions. [2023-08-24 11:44:46,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 38 transitions, 166 flow [2023-08-24 11:44:46,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:46,616 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-24 11:44:46,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-24 11:44:46,619 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-08-24 11:44:46,619 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-24 11:44:46,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 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:44:46,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:46,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:46,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:44:46,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:46,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1954614324, now seen corresponding path program 1 times [2023-08-24 11:44:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877373734] [2023-08-24 11:44:46,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:46,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:46,719 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:44:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877373734] [2023-08-24 11:44:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877373734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:44:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451957899] [2023-08-24 11:44:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:46,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:46,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:46,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:46,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:46,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-08-24 11:44:46,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:44:46,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:46,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-08-24 11:44:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:47,009 INFO L124 PetriNetUnfolderBase]: 2749/3874 cut-off events. [2023-08-24 11:44:47,009 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2023-08-24 11:44:47,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8503 conditions, 3874 events. 2749/3874 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 17462 event pairs, 1091 based on Foata normal form. 24/3882 useless extension candidates. Maximal degree in co-relation 8492. Up to 3385 conditions per place. [2023-08-24 11:44:47,025 INFO L140 encePairwiseOnDemand]: 228/232 looper letters, 37 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-24 11:44:47,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 43 transitions, 198 flow [2023-08-24 11:44:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:47,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-24 11:44:47,027 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272988505747126 [2023-08-24 11:44:47,027 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-24 11:44:47,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-24 11:44:47,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:47,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-24 11:44:47,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:44:47,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:47,029 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:47,029 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 75 flow. Second operand 3 states and 367 transitions. [2023-08-24 11:44:47,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 43 transitions, 198 flow [2023-08-24 11:44:47,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 194 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:44:47,031 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 91 flow [2023-08-24 11:44:47,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-08-24 11:44:47,032 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-08-24 11:44:47,034 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 91 flow [2023-08-24 11:44:47,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 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:44:47,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:47,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:47,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:44:47,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:47,036 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash -463491664, now seen corresponding path program 1 times [2023-08-24 11:44:47,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:47,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219872484] [2023-08-24 11:44:47,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:47,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:47,153 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:44:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219872484] [2023-08-24 11:44:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219872484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:44:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317612438] [2023-08-24 11:44:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:47,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:47,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:47,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:47,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:47,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:44:47,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:47,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:47,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:47,656 INFO L124 PetriNetUnfolderBase]: 5732/7997 cut-off events. [2023-08-24 11:44:47,656 INFO L125 PetriNetUnfolderBase]: For 2402/2402 co-relation queries the response was YES. [2023-08-24 11:44:47,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18786 conditions, 7997 events. 5732/7997 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 39409 event pairs, 1817 based on Foata normal form. 220/8217 useless extension candidates. Maximal degree in co-relation 18773. Up to 4728 conditions per place. [2023-08-24 11:44:47,690 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 40 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2023-08-24 11:44:47,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 261 flow [2023-08-24 11:44:47,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 353 transitions. [2023-08-24 11:44:47,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.507183908045977 [2023-08-24 11:44:47,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 353 transitions. [2023-08-24 11:44:47,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 353 transitions. [2023-08-24 11:44:47,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:47,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 353 transitions. [2023-08-24 11:44:47,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 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:44:47,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:47,694 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:47,694 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 91 flow. Second operand 3 states and 353 transitions. [2023-08-24 11:44:47,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 261 flow [2023-08-24 11:44:47,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:44:47,697 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 190 flow [2023-08-24 11:44:47,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-08-24 11:44:47,698 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-24 11:44:47,698 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 190 flow [2023-08-24 11:44:47,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 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:44:47,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:47,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:47,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:44:47,699 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:47,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:47,699 INFO L85 PathProgramCache]: Analyzing trace with hash -463489866, now seen corresponding path program 1 times [2023-08-24 11:44:47,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:47,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519698188] [2023-08-24 11:44:47,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:44:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519698188] [2023-08-24 11:44:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519698188] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:47,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:47,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:44:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994381125] [2023-08-24 11:44:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:44:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:44:47,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:44:47,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:47,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 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:44:47,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:47,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:47,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:48,254 INFO L124 PetriNetUnfolderBase]: 3941/5900 cut-off events. [2023-08-24 11:44:48,254 INFO L125 PetriNetUnfolderBase]: For 5764/6198 co-relation queries the response was YES. [2023-08-24 11:44:48,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15998 conditions, 5900 events. 3941/5900 cut-off events. For 5764/6198 co-relation queries the response was YES. Maximal size of possible extension queue 412. Compared 34141 event pairs, 676 based on Foata normal form. 605/6382 useless extension candidates. Maximal degree in co-relation 15982. Up to 3992 conditions per place. [2023-08-24 11:44:48,280 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 74 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-24 11:44:48,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 94 transitions, 602 flow [2023-08-24 11:44:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:44:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:44:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 575 transitions. [2023-08-24 11:44:48,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956896551724138 [2023-08-24 11:44:48,282 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 575 transitions. [2023-08-24 11:44:48,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 575 transitions. [2023-08-24 11:44:48,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:48,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 575 transitions. [2023-08-24 11:44:48,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 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:44:48,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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:44:48,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 232.0) internal successors, (1392), 6 states have internal predecessors, (1392), 0 states have call successors, (0), 0 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:44:48,285 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 190 flow. Second operand 5 states and 575 transitions. [2023-08-24 11:44:48,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 94 transitions, 602 flow [2023-08-24 11:44:48,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 94 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:48,293 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 243 flow [2023-08-24 11:44:48,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-24 11:44:48,294 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 7 predicate places. [2023-08-24 11:44:48,295 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 243 flow [2023-08-24 11:44:48,295 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:44:48,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:48,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:48,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:44:48,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:48,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:48,295 INFO L85 PathProgramCache]: Analyzing trace with hash -191871567, now seen corresponding path program 1 times [2023-08-24 11:44:48,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:48,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24633887] [2023-08-24 11:44:48,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:48,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:48,407 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:44:48,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:48,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24633887] [2023-08-24 11:44:48,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24633887] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:48,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:48,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:44:48,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130668875] [2023-08-24 11:44:48,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:48,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:44:48,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:48,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:44:48,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:44:48,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:48,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:48,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:48,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:48,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:49,036 INFO L124 PetriNetUnfolderBase]: 6791/9976 cut-off events. [2023-08-24 11:44:49,036 INFO L125 PetriNetUnfolderBase]: For 12242/12242 co-relation queries the response was YES. [2023-08-24 11:44:49,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34835 conditions, 9976 events. 6791/9976 cut-off events. For 12242/12242 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 56879 event pairs, 1636 based on Foata normal form. 106/10082 useless extension candidates. Maximal degree in co-relation 34816. Up to 4178 conditions per place. [2023-08-24 11:44:49,076 INFO L140 encePairwiseOnDemand]: 224/232 looper letters, 69 selfloop transitions, 14 changer transitions 19/102 dead transitions. [2023-08-24 11:44:49,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 707 flow [2023-08-24 11:44:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:44:49,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:44:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-24 11:44:49,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107758620689655 [2023-08-24 11:44:49,078 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-24 11:44:49,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-24 11:44:49,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:49,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-24 11:44:49,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 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:44:49,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:44:49,080 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 232.0) internal successors, (1160), 5 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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:44:49,080 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 243 flow. Second operand 4 states and 474 transitions. [2023-08-24 11:44:49,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 707 flow [2023-08-24 11:44:49,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 102 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:44:49,093 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 296 flow [2023-08-24 11:44:49,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-24 11:44:49,093 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 12 predicate places. [2023-08-24 11:44:49,093 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 296 flow [2023-08-24 11:44:49,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:44:49,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:49,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:49,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:44:49,094 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:49,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -594551248, now seen corresponding path program 1 times [2023-08-24 11:44:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:49,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128112267] [2023-08-24 11:44:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:49,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:49,175 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:44:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:49,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128112267] [2023-08-24 11:44:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128112267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:49,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492364312] [2023-08-24 11:44:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:49,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:44:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:49,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:44:49,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:44:49,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:49,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:44:49,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:49,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:49,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:49,598 INFO L124 PetriNetUnfolderBase]: 3053/4884 cut-off events. [2023-08-24 11:44:49,598 INFO L125 PetriNetUnfolderBase]: For 8596/9006 co-relation queries the response was YES. [2023-08-24 11:44:49,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17615 conditions, 4884 events. 3053/4884 cut-off events. For 8596/9006 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 30028 event pairs, 307 based on Foata normal form. 649/5476 useless extension candidates. Maximal degree in co-relation 17592. Up to 2215 conditions per place. [2023-08-24 11:44:49,620 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 98 selfloop transitions, 14 changer transitions 2/125 dead transitions. [2023-08-24 11:44:49,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 125 transitions, 982 flow [2023-08-24 11:44:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:44:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:44:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-24 11:44:49,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49712643678160917 [2023-08-24 11:44:49,622 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-24 11:44:49,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-24 11:44:49,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:49,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-24 11:44:49,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:44:49,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:44:49,625 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:44:49,625 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 296 flow. Second operand 6 states and 692 transitions. [2023-08-24 11:44:49,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 125 transitions, 982 flow [2023-08-24 11:44:49,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 125 transitions, 956 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-24 11:44:49,647 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 406 flow [2023-08-24 11:44:49,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-24 11:44:49,648 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 17 predicate places. [2023-08-24 11:44:49,648 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 406 flow [2023-08-24 11:44:49,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:44:49,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:49,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:49,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:44:49,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:49,649 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1152261912, now seen corresponding path program 1 times [2023-08-24 11:44:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185710115] [2023-08-24 11:44:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:49,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:49,751 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:44:49,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:49,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185710115] [2023-08-24 11:44:49,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185710115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:49,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:49,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:44:49,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821534921] [2023-08-24 11:44:49,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:49,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:49,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:49,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:49,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:49,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 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:44:49,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:49,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:49,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:50,138 INFO L124 PetriNetUnfolderBase]: 2645/4271 cut-off events. [2023-08-24 11:44:50,139 INFO L125 PetriNetUnfolderBase]: For 10253/10699 co-relation queries the response was YES. [2023-08-24 11:44:50,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18588 conditions, 4271 events. 2645/4271 cut-off events. For 10253/10699 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 26288 event pairs, 175 based on Foata normal form. 463/4680 useless extension candidates. Maximal degree in co-relation 18561. Up to 2031 conditions per place. [2023-08-24 11:44:50,159 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 107 selfloop transitions, 23 changer transitions 17/158 dead transitions. [2023-08-24 11:44:50,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 158 transitions, 1326 flow [2023-08-24 11:44:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:44:50,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:44:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 921 transitions. [2023-08-24 11:44:50,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49622844827586204 [2023-08-24 11:44:50,162 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 921 transitions. [2023-08-24 11:44:50,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 921 transitions. [2023-08-24 11:44:50,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:50,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 921 transitions. [2023-08-24 11:44:50,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 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:44:50,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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:44:50,166 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 232.0) internal successors, (2088), 9 states have internal predecessors, (2088), 0 states have call successors, (0), 0 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:44:50,166 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 406 flow. Second operand 8 states and 921 transitions. [2023-08-24 11:44:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 158 transitions, 1326 flow [2023-08-24 11:44:50,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 158 transitions, 1282 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-08-24 11:44:50,282 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 530 flow [2023-08-24 11:44:50,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=530, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-24 11:44:50,282 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 25 predicate places. [2023-08-24 11:44:50,282 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 530 flow [2023-08-24 11:44:50,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.66666666666667) internal successors, (634), 6 states have internal predecessors, (634), 0 states have call successors, (0), 0 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:44:50,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:50,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:44:50,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:50,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:50,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1402360993, now seen corresponding path program 1 times [2023-08-24 11:44:50,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:50,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890426687] [2023-08-24 11:44:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:50,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:50,392 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:44:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:50,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890426687] [2023-08-24 11:44:50,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890426687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:50,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:50,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:44:50,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849532763] [2023-08-24 11:44:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:50,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:44:50,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:44:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:44:50,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 232 [2023-08-24 11:44:50,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 530 flow. Second operand has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:44:50,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:50,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 232 [2023-08-24 11:44:50,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:50,790 INFO L124 PetriNetUnfolderBase]: 2567/4129 cut-off events. [2023-08-24 11:44:50,791 INFO L125 PetriNetUnfolderBase]: For 12607/12956 co-relation queries the response was YES. [2023-08-24 11:44:50,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18272 conditions, 4129 events. 2567/4129 cut-off events. For 12607/12956 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 25318 event pairs, 165 based on Foata normal form. 267/4342 useless extension candidates. Maximal degree in co-relation 18242. Up to 1324 conditions per place. [2023-08-24 11:44:50,806 INFO L140 encePairwiseOnDemand]: 225/232 looper letters, 80 selfloop transitions, 26 changer transitions 46/159 dead transitions. [2023-08-24 11:44:50,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 159 transitions, 1382 flow [2023-08-24 11:44:50,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 11:44:50,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 11:44:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1128 transitions. [2023-08-24 11:44:50,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4862068965517241 [2023-08-24 11:44:50,808 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1128 transitions. [2023-08-24 11:44:50,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1128 transitions. [2023-08-24 11:44:50,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:50,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1128 transitions. [2023-08-24 11:44:50,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.8) internal successors, (1128), 10 states have internal predecessors, (1128), 0 states have call successors, (0), 0 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:44:50,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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:44:50,813 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 232.0) internal successors, (2552), 11 states have internal predecessors, (2552), 0 states have call successors, (0), 0 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:44:50,813 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 530 flow. Second operand 10 states and 1128 transitions. [2023-08-24 11:44:50,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 159 transitions, 1382 flow [2023-08-24 11:44:50,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 159 transitions, 1273 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-24 11:44:50,981 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 438 flow [2023-08-24 11:44:50,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=438, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-24 11:44:50,982 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 33 predicate places. [2023-08-24 11:44:50,982 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 438 flow [2023-08-24 11:44:50,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.57142857142857) internal successors, (739), 7 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:44:50,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:50,982 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:44:50,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:44:50,982 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:50,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:50,983 INFO L85 PathProgramCache]: Analyzing trace with hash 505967038, now seen corresponding path program 1 times [2023-08-24 11:44:50,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:50,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760913739] [2023-08-24 11:44:50,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:50,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:51,105 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:44:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760913739] [2023-08-24 11:44:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760913739] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294580333] [2023-08-24 11:44:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:44:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:44:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:44:51,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 232 [2023-08-24 11:44:51,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:44:51,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:51,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 232 [2023-08-24 11:44:51,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:51,391 INFO L124 PetriNetUnfolderBase]: 1854/3032 cut-off events. [2023-08-24 11:44:51,391 INFO L125 PetriNetUnfolderBase]: For 10226/10226 co-relation queries the response was YES. [2023-08-24 11:44:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13783 conditions, 3032 events. 1854/3032 cut-off events. For 10226/10226 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 16678 event pairs, 137 based on Foata normal form. 1/3033 useless extension candidates. Maximal degree in co-relation 13750. Up to 1120 conditions per place. [2023-08-24 11:44:51,400 INFO L140 encePairwiseOnDemand]: 223/232 looper letters, 48 selfloop transitions, 11 changer transitions 93/152 dead transitions. [2023-08-24 11:44:51,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 152 transitions, 1484 flow [2023-08-24 11:44:51,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 11:44:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 11:44:51,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2023-08-24 11:44:51,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885057471264368 [2023-08-24 11:44:51,402 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2023-08-24 11:44:51,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2023-08-24 11:44:51,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:51,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2023-08-24 11:44:51,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:44:51,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:44:51,405 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 232.0) internal successors, (1624), 7 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:44:51,405 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 438 flow. Second operand 6 states and 680 transitions. [2023-08-24 11:44:51,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 152 transitions, 1484 flow [2023-08-24 11:44:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 152 transitions, 1173 flow, removed 64 selfloop flow, removed 13 redundant places. [2023-08-24 11:44:51,436 INFO L231 Difference]: Finished difference. Result has 65 places, 43 transitions, 275 flow [2023-08-24 11:44:51,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2023-08-24 11:44:51,436 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 26 predicate places. [2023-08-24 11:44:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 275 flow [2023-08-24 11:44:51,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 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:44:51,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:51,437 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:44:51,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:44:51,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:51,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -729240840, now seen corresponding path program 2 times [2023-08-24 11:44:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:51,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448227908] [2023-08-24 11:44:51,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:51,525 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:44:51,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:51,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448227908] [2023-08-24 11:44:51,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448227908] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:51,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:51,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:44:51,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338804990] [2023-08-24 11:44:51,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:51,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:44:51,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:51,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:44:51,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:44:51,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 232 [2023-08-24 11:44:51,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:44:51,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:51,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 232 [2023-08-24 11:44:51,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:51,607 INFO L124 PetriNetUnfolderBase]: 506/856 cut-off events. [2023-08-24 11:44:51,607 INFO L125 PetriNetUnfolderBase]: For 2237/2255 co-relation queries the response was YES. [2023-08-24 11:44:51,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3418 conditions, 856 events. 506/856 cut-off events. For 2237/2255 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3719 event pairs, 179 based on Foata normal form. 10/856 useless extension candidates. Maximal degree in co-relation 3397. Up to 449 conditions per place. [2023-08-24 11:44:51,609 INFO L140 encePairwiseOnDemand]: 229/232 looper letters, 42 selfloop transitions, 2 changer transitions 19/65 dead transitions. [2023-08-24 11:44:51,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 65 transitions, 517 flow [2023-08-24 11:44:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:44:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:44:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-24 11:44:51,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201149425287356 [2023-08-24 11:44:51,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-24 11:44:51,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-24 11:44:51,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:51,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-24 11:44:51,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 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:44:51,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:51,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:44:51,614 INFO L175 Difference]: Start difference. First operand has 65 places, 43 transitions, 275 flow. Second operand 3 states and 362 transitions. [2023-08-24 11:44:51,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 65 transitions, 517 flow [2023-08-24 11:44:51,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 65 transitions, 468 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-08-24 11:44:51,620 INFO L231 Difference]: Finished difference. Result has 53 places, 36 transitions, 192 flow [2023-08-24 11:44:51,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=53, PETRI_TRANSITIONS=36} [2023-08-24 11:44:51,620 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 14 predicate places. [2023-08-24 11:44:51,620 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 36 transitions, 192 flow [2023-08-24 11:44:51,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 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:44:51,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:51,621 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:44:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 11:44:51,621 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:51,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2015821044, now seen corresponding path program 3 times [2023-08-24 11:44:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:51,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744549490] [2023-08-24 11:44:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:44:51,926 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:44:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:44:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744549490] [2023-08-24 11:44:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744549490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:44:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:44:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:44:51,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216230010] [2023-08-24 11:44:51,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:44:51,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 11:44:51,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:44:51,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 11:44:51,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 11:44:51,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 232 [2023-08-24 11:44:51,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 36 transitions, 192 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 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:44:51,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:44:51,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 232 [2023-08-24 11:44:51,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:44:52,020 INFO L124 PetriNetUnfolderBase]: 94/183 cut-off events. [2023-08-24 11:44:52,020 INFO L125 PetriNetUnfolderBase]: For 383/386 co-relation queries the response was YES. [2023-08-24 11:44:52,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 183 events. 94/183 cut-off events. For 383/386 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 573 event pairs, 7 based on Foata normal form. 2/184 useless extension candidates. Maximal degree in co-relation 683. Up to 95 conditions per place. [2023-08-24 11:44:52,021 INFO L140 encePairwiseOnDemand]: 226/232 looper letters, 38 selfloop transitions, 4 changer transitions 22/67 dead transitions. [2023-08-24 11:44:52,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 499 flow [2023-08-24 11:44:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 11:44:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 11:44:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2023-08-24 11:44:52,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4698275862068966 [2023-08-24 11:44:52,023 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 763 transitions. [2023-08-24 11:44:52,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 763 transitions. [2023-08-24 11:44:52,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:44:52,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 763 transitions. [2023-08-24 11:44:52,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 0 states have call successors, (0), 0 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:44:52,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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:44:52,027 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 232.0) internal successors, (1856), 8 states have internal predecessors, (1856), 0 states have call successors, (0), 0 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:44:52,027 INFO L175 Difference]: Start difference. First operand has 53 places, 36 transitions, 192 flow. Second operand 7 states and 763 transitions. [2023-08-24 11:44:52,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 499 flow [2023-08-24 11:44:52,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 440 flow, removed 6 selfloop flow, removed 11 redundant places. [2023-08-24 11:44:52,028 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 163 flow [2023-08-24 11:44:52,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-08-24 11:44:52,029 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2023-08-24 11:44:52,029 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 163 flow [2023-08-24 11:44:52,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 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:44:52,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:44:52,029 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:44:52,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 11:44:52,029 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:44:52,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:44:52,030 INFO L85 PathProgramCache]: Analyzing trace with hash 2072698180, now seen corresponding path program 4 times [2023-08-24 11:44:52,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:44:52,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403910658] [2023-08-24 11:44:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:44:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:44:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:44:52,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:44:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:44:52,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:44:52,104 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:44:52,104 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-24 11:44:52,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-24 11:44:52,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-24 11:44:52,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-24 11:44:52,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-24 11:44:52,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-24 11:44:52,107 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-24 11:44:52,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 11:44:52,107 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:44:52,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:44:52,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:44:52,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:44:52 BasicIcfg [2023-08-24 11:44:52,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:44:52,175 INFO L158 Benchmark]: Toolchain (without parser) took 10988.27ms. Allocated memory was 377.5MB in the beginning and 713.0MB in the end (delta: 335.5MB). Free memory was 352.2MB in the beginning and 629.5MB in the end (delta: -277.3MB). Peak memory consumption was 58.9MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 377.5MB. Free memory is still 354.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.59ms. Allocated memory is still 377.5MB. Free memory was 352.2MB in the beginning and 329.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.28ms. Allocated memory is still 377.5MB. Free memory was 329.2MB in the beginning and 326.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: Boogie Preprocessor took 39.83ms. Allocated memory is still 377.5MB. Free memory was 326.6MB in the beginning and 324.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: RCFGBuilder took 554.63ms. Allocated memory is still 377.5MB. Free memory was 324.6MB in the beginning and 347.1MB in the end (delta: -22.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,176 INFO L158 Benchmark]: TraceAbstraction took 9963.93ms. Allocated memory was 377.5MB in the beginning and 713.0MB in the end (delta: 335.5MB). Free memory was 346.6MB in the beginning and 629.5MB in the end (delta: -282.9MB). Peak memory consumption was 54.7MB. Max. memory is 16.0GB. [2023-08-24 11:44:52,177 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.11ms. Allocated memory is still 377.5MB. Free memory is still 354.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 392.59ms. Allocated memory is still 377.5MB. Free memory was 352.2MB in the beginning and 329.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.28ms. Allocated memory is still 377.5MB. Free memory was 329.2MB in the beginning and 326.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.83ms. Allocated memory is still 377.5MB. Free memory was 326.6MB in the beginning and 324.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 554.63ms. Allocated memory is still 377.5MB. Free memory was 324.6MB in the beginning and 347.1MB in the end (delta: -22.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9963.93ms. Allocated memory was 377.5MB in the beginning and 713.0MB in the end (delta: 335.5MB). Free memory was 346.6MB in the beginning and 629.5MB in the end (delta: -282.9MB). Peak memory consumption was 54.7MB. 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: 3.1s, 132 PlacesBefore, 39 PlacesAfterwards, 121 TransitionsBefore, 27 TransitionsAfterwards, 2620 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 107 TotalNumberOfCompositions, 6159 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3198, independent: 3031, independent conditional: 0, independent unconditional: 3031, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1443, independent: 1398, independent conditional: 0, independent unconditional: 1398, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3198, independent: 1633, independent conditional: 0, independent unconditional: 1633, dependent: 122, dependent conditional: 0, dependent unconditional: 122, unknown: 1443, unknown conditional: 0, unknown unconditional: 1443] , Statistics on independence cache: Total cache size (in pairs): 127, Positive cache size: 110, Positive conditional cache size: 0, Positive unconditional cache size: 110, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t1413; [L845] FCALL, FORK 0 pthread_create(&t1413, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1413, ((void *)0), P0, ((void *)0))=-4, t1413={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 0 pthread_t t1414; [L847] FCALL, FORK 0 pthread_create(&t1414, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1414, ((void *)0), P1, ((void *)0))=-3, t1413={5:0}, t1414={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L848] 0 pthread_t t1415; [L849] FCALL, FORK 0 pthread_create(&t1415, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1415, ((void *)0), P2, ((void *)0))=-2, t1413={5:0}, t1414={6:0}, t1415={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L850] 0 pthread_t t1416; [L851] FCALL, FORK 0 pthread_create(&t1416, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1416, ((void *)0), P3, ((void *)0))=-1, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L806] 4 z$w_buff1 = z$w_buff0 [L807] 4 z$w_buff0 = 1 [L808] 4 z$w_buff1_used = z$w_buff0_used [L809] 4 z$w_buff0_used = (_Bool)1 [L810] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L810] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L811] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L812] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L813] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L814] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L815] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L816] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, 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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L790] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EAX = z [L793] 3 z = z$flush_delayed ? z$mem_tmp : z [L794] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L822] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L823] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L824] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L825] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L826] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L799] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 3 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L858] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L859] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L860] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L861] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=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, t1413={5:0}, t1414={6:0}, t1415={7:0}, t1416={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L866] 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_p2_EAX=0, __unbuffered_p3_EAX=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=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - 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: 851]: 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: 845]: 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: 849]: 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: 847]: 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, 158 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: 9.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 17 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=8, InterpolantAutomatonStates: 61, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 880 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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:44:52,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...