/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:01:19,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:01:19,960 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-23 23:01:19,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:01:19,965 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:01:20,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:01:20,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:01:20,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:01:20,006 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:01:20,006 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:01:20,007 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:01:20,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:01:20,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:01:20,008 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:01:20,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:01:20,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:01:20,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:01:20,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:01:20,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:01:20,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:01:20,010 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:01:20,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:01:20,016 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:01:20,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:01:20,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:01:20,020 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:01:20,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:01:20,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:01:20,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:01:20,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:01:20,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:01:20,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:01:20,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:01:20,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:01:20,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:01:20,023 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 [2023-08-23 23:01:20,355 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:01:20,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:01:20,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:01:20,380 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:01:20,380 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:01:20,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-08-23 23:01:21,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:01:21,895 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:01:21,895 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026.oepc.i [2023-08-23 23:01:21,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85f7687c/ee75548d70b644ef9318274404004d6e/FLAG0f631ab63 [2023-08-23 23:01:21,931 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b85f7687c/ee75548d70b644ef9318274404004d6e [2023-08-23 23:01:21,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:01:21,937 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:01:21,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:01:21,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:01:21,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:01:21,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:01:21" (1/1) ... [2023-08-23 23:01:21,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd4ed85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:21, skipping insertion in model container [2023-08-23 23:01:21,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:01:21" (1/1) ... [2023-08-23 23:01:22,015 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:01:22,185 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/mix026.oepc.i[945,958] [2023-08-23 23:01:22,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:01:22,396 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:01:22,411 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/mix026.oepc.i[945,958] [2023-08-23 23:01:22,431 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:01:22,433 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:01:22,492 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:01:22,529 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:01:22,530 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:01:22,536 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:01:22,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22 WrapperNode [2023-08-23 23:01:22,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:01:22,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:01:22,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:01:22,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:01:22,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,637 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-23 23:01:22,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:01:22,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:01:22,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:01:22,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:01:22,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:01:22,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:01:22,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:01:22,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:01:22,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (1/1) ... [2023-08-23 23:01:22,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:01:22,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:01:22,730 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-23 23:01:22,753 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-23 23:01:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:01:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:01:22,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:01:22,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:01:22,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:01:22,769 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:01:22,769 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 23:01:22,770 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 23:01:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:01:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:01:22,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:01:22,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:01:22,772 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:01:22,931 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:01:22,933 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:01:23,279 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:01:23,420 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:01:23,420 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:01:23,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:01:23 BoogieIcfgContainer [2023-08-23 23:01:23,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:01:23,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:01:23,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:01:23,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:01:23,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:01:21" (1/3) ... [2023-08-23 23:01:23,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c98c2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:01:23, skipping insertion in model container [2023-08-23 23:01:23,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:01:22" (2/3) ... [2023-08-23 23:01:23,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c98c2a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:01:23, skipping insertion in model container [2023-08-23 23:01:23,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:01:23" (3/3) ... [2023-08-23 23:01:23,429 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026.oepc.i [2023-08-23 23:01:23,444 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:01:23,444 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:01:23,444 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:01:23,495 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:01:23,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 131 transitions, 282 flow [2023-08-23 23:01:23,572 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-08-23 23:01:23,573 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:23,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-23 23:01:23,578 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 131 transitions, 282 flow [2023-08-23 23:01:23,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 127 transitions, 266 flow [2023-08-23 23:01:23,585 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:01:23,594 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-23 23:01:23,596 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 266 flow [2023-08-23 23:01:23,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 266 flow [2023-08-23 23:01:23,654 INFO L124 PetriNetUnfolderBase]: 2/127 cut-off events. [2023-08-23 23:01:23,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:23,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 88. Up to 2 conditions per place. [2023-08-23 23:01:23,659 INFO L119 LiptonReduction]: Number of co-enabled transitions 3164 [2023-08-23 23:01:27,664 INFO L134 LiptonReduction]: Checked pairs total: 9238 [2023-08-23 23:01:27,664 INFO L136 LiptonReduction]: Total number of compositions: 110 [2023-08-23 23:01:27,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:01:27,680 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;@5e76b782, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:01:27,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 23:01:27,683 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:01:27,683 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-23 23:01:27,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:01:27,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:27,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 23:01:27,685 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:27,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 549528, now seen corresponding path program 1 times [2023-08-23 23:01:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:27,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412940068] [2023-08-23 23:01:27,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:27,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:28,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:28,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412940068] [2023-08-23 23:01:28,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412940068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:28,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:28,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:01:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916409437] [2023-08-23 23:01:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:28,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:01:28,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:01:28,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:01:28,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 241 [2023-08-23 23:01:28,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-23 23:01:28,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:28,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 241 [2023-08-23 23:01:28,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:29,106 INFO L124 PetriNetUnfolderBase]: 4903/7131 cut-off events. [2023-08-23 23:01:29,107 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-23 23:01:29,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13979 conditions, 7131 events. 4903/7131 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 41983 event pairs, 895 based on Foata normal form. 0/6791 useless extension candidates. Maximal degree in co-relation 13967. Up to 5335 conditions per place. [2023-08-23 23:01:29,155 INFO L140 encePairwiseOnDemand]: 237/241 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-23 23:01:29,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 209 flow [2023-08-23 23:01:29,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:01:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:01:29,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-08-23 23:01:29,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5435684647302904 [2023-08-23 23:01:29,173 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-08-23 23:01:29,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-08-23 23:01:29,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:29,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-08-23 23:01:29,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:29,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:29,191 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:29,192 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 393 transitions. [2023-08-23 23:01:29,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 209 flow [2023-08-23 23:01:29,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 49 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 23:01:29,200 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 68 flow [2023-08-23 23:01:29,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2023-08-23 23:01:29,204 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-23 23:01:29,204 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 68 flow [2023-08-23 23:01:29,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 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-23 23:01:29,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:29,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:29,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:01:29,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:29,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1011822437, now seen corresponding path program 1 times [2023-08-23 23:01:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113778713] [2023-08-23 23:01:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:29,560 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-23 23:01:29,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:29,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113778713] [2023-08-23 23:01:29,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113778713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:29,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:29,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:01:29,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166604629] [2023-08-23 23:01:29,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:29,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:01:29,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:29,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:01:29,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:01:29,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-23 23:01:29,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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-23 23:01:29,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:29,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-23 23:01:29,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:31,532 INFO L124 PetriNetUnfolderBase]: 14367/19536 cut-off events. [2023-08-23 23:01:31,532 INFO L125 PetriNetUnfolderBase]: For 1005/1005 co-relation queries the response was YES. [2023-08-23 23:01:31,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40520 conditions, 19536 events. 14367/19536 cut-off events. For 1005/1005 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 100276 event pairs, 5297 based on Foata normal form. 458/19994 useless extension candidates. Maximal degree in co-relation 40510. Up to 13505 conditions per place. [2023-08-23 23:01:31,656 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2023-08-23 23:01:31,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 232 flow [2023-08-23 23:01:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:01:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:01:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2023-08-23 23:01:31,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103734439834025 [2023-08-23 23:01:31,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2023-08-23 23:01:31,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2023-08-23 23:01:31,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:31,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2023-08-23 23:01:31,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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-23 23:01:31,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:31,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 241.0) internal successors, (964), 4 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:31,663 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 369 transitions. [2023-08-23 23:01:31,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 232 flow [2023-08-23 23:01:31,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:31,665 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 118 flow [2023-08-23 23:01:31,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=64, 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-08-23 23:01:31,668 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-23 23:01:31,670 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 118 flow [2023-08-23 23:01:31,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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-23 23:01:31,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:31,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:31,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:01:31,674 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:31,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:31,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1301726651, now seen corresponding path program 1 times [2023-08-23 23:01:31,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:31,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112783477] [2023-08-23 23:01:31,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:31,885 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-23 23:01:31,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:31,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112783477] [2023-08-23 23:01:31,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112783477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:01:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628073940] [2023-08-23 23:01:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:31,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:31,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:31,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:31,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-23 23:01:31,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-23 23:01:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:31,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-23 23:01:31,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:33,614 INFO L124 PetriNetUnfolderBase]: 13285/18086 cut-off events. [2023-08-23 23:01:33,615 INFO L125 PetriNetUnfolderBase]: For 5515/5515 co-relation queries the response was YES. [2023-08-23 23:01:33,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43686 conditions, 18086 events. 13285/18086 cut-off events. For 5515/5515 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 89930 event pairs, 3757 based on Foata normal form. 230/18316 useless extension candidates. Maximal degree in co-relation 43674. Up to 8781 conditions per place. [2023-08-23 23:01:33,722 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 55 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-08-23 23:01:33,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 62 transitions, 314 flow [2023-08-23 23:01:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:33,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-23 23:01:33,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.495850622406639 [2023-08-23 23:01:33,724 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-23 23:01:33,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-23 23:01:33,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:33,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-23 23:01:33,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-23 23:01:33,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:33,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:33,728 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 118 flow. Second operand 4 states and 478 transitions. [2023-08-23 23:01:33,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 62 transitions, 314 flow [2023-08-23 23:01:33,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:33,789 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 152 flow [2023-08-23 23:01:33,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-23 23:01:33,790 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-23 23:01:33,793 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 152 flow [2023-08-23 23:01:33,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.0) internal successors, (432), 4 states have internal predecessors, (432), 0 states have call successors, (0), 0 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-23 23:01:33,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:33,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:33,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:01:33,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:33,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1701274142, now seen corresponding path program 1 times [2023-08-23 23:01:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980940902] [2023-08-23 23:01:33,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:33,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:34,076 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-23 23:01:34,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:34,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980940902] [2023-08-23 23:01:34,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980940902] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:34,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:34,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:01:34,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050215825] [2023-08-23 23:01:34,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:34,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:01:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:01:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:01:34,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-23 23:01:34,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-23 23:01:34,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:34,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-23 23:01:34,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:35,628 INFO L124 PetriNetUnfolderBase]: 8165/12127 cut-off events. [2023-08-23 23:01:35,629 INFO L125 PetriNetUnfolderBase]: For 2974/3344 co-relation queries the response was YES. [2023-08-23 23:01:35,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27858 conditions, 12127 events. 8165/12127 cut-off events. For 2974/3344 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 75281 event pairs, 1479 based on Foata normal form. 892/12754 useless extension candidates. Maximal degree in co-relation 27843. Up to 5207 conditions per place. [2023-08-23 23:01:35,717 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 57 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2023-08-23 23:01:35,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 74 transitions, 382 flow [2023-08-23 23:01:35,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:01:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:01:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 491 transitions. [2023-08-23 23:01:35,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093360995850622 [2023-08-23 23:01:35,720 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 491 transitions. [2023-08-23 23:01:35,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 491 transitions. [2023-08-23 23:01:35,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:35,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 491 transitions. [2023-08-23 23:01:35,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 0 states have call successors, (0), 0 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-23 23:01:35,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:35,724 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 241.0) internal successors, (1205), 5 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:35,724 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 152 flow. Second operand 4 states and 491 transitions. [2023-08-23 23:01:35,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 74 transitions, 382 flow [2023-08-23 23:01:35,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:35,739 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 195 flow [2023-08-23 23:01:35,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-23 23:01:35,741 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2023-08-23 23:01:35,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 195 flow [2023-08-23 23:01:35,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 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-23 23:01:35,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:35,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:35,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:01:35,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:35,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1819110839, now seen corresponding path program 1 times [2023-08-23 23:01:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:35,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30824345] [2023-08-23 23:01:35,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:35,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:01:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:36,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30824345] [2023-08-23 23:01:36,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30824345] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918479303] [2023-08-23 23:01:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:36,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:36,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-23 23:01:36,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-23 23:01:36,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:36,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-23 23:01:36,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:37,011 INFO L124 PetriNetUnfolderBase]: 6526/10004 cut-off events. [2023-08-23 23:01:37,012 INFO L125 PetriNetUnfolderBase]: For 5211/5417 co-relation queries the response was YES. [2023-08-23 23:01:37,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28214 conditions, 10004 events. 6526/10004 cut-off events. For 5211/5417 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 63271 event pairs, 1399 based on Foata normal form. 590/10374 useless extension candidates. Maximal degree in co-relation 28196. Up to 3733 conditions per place. [2023-08-23 23:01:37,073 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 73 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-23 23:01:37,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 94 transitions, 530 flow [2023-08-23 23:01:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:37,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-23 23:01:37,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5120331950207468 [2023-08-23 23:01:37,076 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-23 23:01:37,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-23 23:01:37,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:37,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-23 23:01:37,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 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-23 23:01:37,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:37,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:37,081 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 195 flow. Second operand 5 states and 617 transitions. [2023-08-23 23:01:37,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 94 transitions, 530 flow [2023-08-23 23:01:37,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 94 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:01:37,090 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 260 flow [2023-08-23 23:01:37,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-23 23:01:37,091 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2023-08-23 23:01:37,091 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 260 flow [2023-08-23 23:01:37,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 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-23 23:01:37,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:37,092 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-23 23:01:37,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:01:37,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:37,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -493523634, now seen corresponding path program 1 times [2023-08-23 23:01:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:37,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871313641] [2023-08-23 23:01:37,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:37,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:37,609 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-23 23:01:37,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:37,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871313641] [2023-08-23 23:01:37,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871313641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:37,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:37,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:37,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255290375] [2023-08-23 23:01:37,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:37,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:01:37,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:01:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:01:37,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-23 23:01:37,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-23 23:01:37,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:37,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-23 23:01:37,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:39,125 INFO L124 PetriNetUnfolderBase]: 10829/16885 cut-off events. [2023-08-23 23:01:39,125 INFO L125 PetriNetUnfolderBase]: For 28282/28605 co-relation queries the response was YES. [2023-08-23 23:01:39,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56308 conditions, 16885 events. 10829/16885 cut-off events. For 28282/28605 co-relation queries the response was YES. Maximal size of possible extension queue 840. Compared 118761 event pairs, 2527 based on Foata normal form. 90/16793 useless extension candidates. Maximal degree in co-relation 56287. Up to 8069 conditions per place. [2023-08-23 23:01:39,204 INFO L140 encePairwiseOnDemand]: 233/241 looper letters, 90 selfloop transitions, 10 changer transitions 40/151 dead transitions. [2023-08-23 23:01:39,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 151 transitions, 1123 flow [2023-08-23 23:01:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 844 transitions. [2023-08-23 23:01:39,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5002963841138115 [2023-08-23 23:01:39,207 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 844 transitions. [2023-08-23 23:01:39,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 844 transitions. [2023-08-23 23:01:39,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:39,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 844 transitions. [2023-08-23 23:01:39,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.57142857142857) internal successors, (844), 7 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:39,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:39,213 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:39,213 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 260 flow. Second operand 7 states and 844 transitions. [2023-08-23 23:01:39,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 151 transitions, 1123 flow [2023-08-23 23:01:39,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 151 transitions, 1059 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:39,241 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 326 flow [2023-08-23 23:01:39,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=326, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2023-08-23 23:01:39,242 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2023-08-23 23:01:39,242 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 326 flow [2023-08-23 23:01:39,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-23 23:01:39,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:39,243 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-23 23:01:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:01:39,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:39,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash 660020462, now seen corresponding path program 2 times [2023-08-23 23:01:39,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:39,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136581628] [2023-08-23 23:01:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:39,448 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-23 23:01:39,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:39,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136581628] [2023-08-23 23:01:39,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136581628] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:39,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:39,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:01:39,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052224271] [2023-08-23 23:01:39,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:39,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 23:01:39,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:39,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 23:01:39,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 23:01:39,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-23 23:01:39,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 326 flow. Second operand has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-23 23:01:39,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:39,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-23 23:01:39,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:40,677 INFO L124 PetriNetUnfolderBase]: 8806/13824 cut-off events. [2023-08-23 23:01:40,677 INFO L125 PetriNetUnfolderBase]: For 22891/23379 co-relation queries the response was YES. [2023-08-23 23:01:40,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49118 conditions, 13824 events. 8806/13824 cut-off events. For 22891/23379 co-relation queries the response was YES. Maximal size of possible extension queue 794. Compared 96171 event pairs, 1510 based on Foata normal form. 325/13880 useless extension candidates. Maximal degree in co-relation 49093. Up to 5552 conditions per place. [2023-08-23 23:01:40,773 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 110 selfloop transitions, 14 changer transitions 5/140 dead transitions. [2023-08-23 23:01:40,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 140 transitions, 978 flow [2023-08-23 23:01:40,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 741 transitions. [2023-08-23 23:01:40,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124481327800829 [2023-08-23 23:01:40,776 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 741 transitions. [2023-08-23 23:01:40,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 741 transitions. [2023-08-23 23:01:40,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:40,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 741 transitions. [2023-08-23 23:01:40,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,781 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:40,781 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 326 flow. Second operand 6 states and 741 transitions. [2023-08-23 23:01:40,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 140 transitions, 978 flow [2023-08-23 23:01:40,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 140 transitions, 973 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-23 23:01:40,814 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 406 flow [2023-08-23 23:01:40,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2023-08-23 23:01:40,815 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2023-08-23 23:01:40,815 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 406 flow [2023-08-23 23:01:40,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.0) internal successors, (666), 6 states have internal predecessors, (666), 0 states have call successors, (0), 0 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-23 23:01:40,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:40,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:01:40,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:40,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1244740006, now seen corresponding path program 1 times [2023-08-23 23:01:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:40,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187183987] [2023-08-23 23:01:40,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:41,007 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-23 23:01:41,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187183987] [2023-08-23 23:01:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187183987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:41,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113366871] [2023-08-23 23:01:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:41,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:41,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 241 [2023-08-23 23:01:41,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 406 flow. Second operand has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-23 23:01:41,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:41,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 241 [2023-08-23 23:01:41,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:43,261 INFO L124 PetriNetUnfolderBase]: 16555/24258 cut-off events. [2023-08-23 23:01:43,262 INFO L125 PetriNetUnfolderBase]: For 70857/70857 co-relation queries the response was YES. [2023-08-23 23:01:43,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97522 conditions, 24258 events. 16555/24258 cut-off events. For 70857/70857 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 154433 event pairs, 2060 based on Foata normal form. 16/24274 useless extension candidates. Maximal degree in co-relation 97506. Up to 9952 conditions per place. [2023-08-23 23:01:43,396 INFO L140 encePairwiseOnDemand]: 232/241 looper letters, 132 selfloop transitions, 18 changer transitions 63/213 dead transitions. [2023-08-23 23:01:43,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 213 transitions, 1903 flow [2023-08-23 23:01:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2023-08-23 23:01:43,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5055325034578146 [2023-08-23 23:01:43,399 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2023-08-23 23:01:43,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2023-08-23 23:01:43,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:43,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2023-08-23 23:01:43,401 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 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-23 23:01:43,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:43,404 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:43,404 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 406 flow. Second operand 6 states and 731 transitions. [2023-08-23 23:01:43,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 213 transitions, 1903 flow [2023-08-23 23:01:44,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 213 transitions, 1770 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-08-23 23:01:44,030 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 448 flow [2023-08-23 23:01:44,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=448, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2023-08-23 23:01:44,031 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 26 predicate places. [2023-08-23 23:01:44,031 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 448 flow [2023-08-23 23:01:44,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 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-23 23:01:44,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:44,032 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-23 23:01:44,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:01:44,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:44,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:44,033 INFO L85 PathProgramCache]: Analyzing trace with hash 431853775, now seen corresponding path program 1 times [2023-08-23 23:01:44,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:44,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438474620] [2023-08-23 23:01:44,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:44,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:44,400 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-23 23:01:44,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:44,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438474620] [2023-08-23 23:01:44,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438474620] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:44,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:44,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:44,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878179056] [2023-08-23 23:01:44,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:44,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:01:44,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:44,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:01:44,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:01:44,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 241 [2023-08-23 23:01:44,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-23 23:01:44,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:44,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 241 [2023-08-23 23:01:44,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:45,056 INFO L124 PetriNetUnfolderBase]: 3828/6184 cut-off events. [2023-08-23 23:01:45,056 INFO L125 PetriNetUnfolderBase]: For 13863/14044 co-relation queries the response was YES. [2023-08-23 23:01:45,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23505 conditions, 6184 events. 3828/6184 cut-off events. For 13863/14044 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 39505 event pairs, 722 based on Foata normal form. 72/6125 useless extension candidates. Maximal degree in co-relation 23487. Up to 2521 conditions per place. [2023-08-23 23:01:45,079 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 89 selfloop transitions, 18 changer transitions 7/128 dead transitions. [2023-08-23 23:01:45,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 128 transitions, 985 flow [2023-08-23 23:01:45,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:01:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:01:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-23 23:01:45,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943687018375815 [2023-08-23 23:01:45,082 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-23 23:01:45,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-23 23:01:45,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:45,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-23 23:01:45,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-23 23:01:45,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:45,087 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 241.0) internal successors, (1928), 8 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:45,088 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 448 flow. Second operand 7 states and 834 transitions. [2023-08-23 23:01:45,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 128 transitions, 985 flow [2023-08-23 23:01:45,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 128 transitions, 937 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-23 23:01:45,372 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 427 flow [2023-08-23 23:01:45,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=427, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-08-23 23:01:45,373 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 28 predicate places. [2023-08-23 23:01:45,373 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 427 flow [2023-08-23 23:01:45,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.0) internal successors, (777), 7 states have internal predecessors, (777), 0 states have call successors, (0), 0 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-23 23:01:45,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:45,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:45,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:01:45,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:45,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:45,374 INFO L85 PathProgramCache]: Analyzing trace with hash -906292583, now seen corresponding path program 1 times [2023-08-23 23:01:45,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:45,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351923758] [2023-08-23 23:01:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:45,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:45,636 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-23 23:01:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:45,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351923758] [2023-08-23 23:01:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351923758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:45,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:45,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:01:45,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833747976] [2023-08-23 23:01:45,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:45,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:01:45,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:45,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:01:45,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:01:45,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-23 23:01:45,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 427 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-23 23:01:45,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:45,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-23 23:01:45,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:46,395 INFO L124 PetriNetUnfolderBase]: 5517/8500 cut-off events. [2023-08-23 23:01:46,395 INFO L125 PetriNetUnfolderBase]: For 20579/20579 co-relation queries the response was YES. [2023-08-23 23:01:46,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33174 conditions, 8500 events. 5517/8500 cut-off events. For 20579/20579 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 49540 event pairs, 1218 based on Foata normal form. 2/8502 useless extension candidates. Maximal degree in co-relation 33157. Up to 4114 conditions per place. [2023-08-23 23:01:46,430 INFO L140 encePairwiseOnDemand]: 234/241 looper letters, 75 selfloop transitions, 8 changer transitions 61/144 dead transitions. [2023-08-23 23:01:46,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 144 transitions, 1260 flow [2023-08-23 23:01:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:01:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:01:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-23 23:01:46,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4995850622406639 [2023-08-23 23:01:46,433 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-23 23:01:46,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-23 23:01:46,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:46,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-23 23:01:46,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 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-23 23:01:46,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:46,437 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 427 flow. Second operand 5 states and 602 transitions. [2023-08-23 23:01:46,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 144 transitions, 1260 flow [2023-08-23 23:01:46,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 144 transitions, 1121 flow, removed 37 selfloop flow, removed 5 redundant places. [2023-08-23 23:01:46,582 INFO L231 Difference]: Finished difference. Result has 72 places, 53 transitions, 332 flow [2023-08-23 23:01:46,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=72, PETRI_TRANSITIONS=53} [2023-08-23 23:01:46,583 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 29 predicate places. [2023-08-23 23:01:46,583 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 53 transitions, 332 flow [2023-08-23 23:01:46,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 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-23 23:01:46,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:46,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:46,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:01:46,584 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:46,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2107230685, now seen corresponding path program 2 times [2023-08-23 23:01:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:46,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773701283] [2023-08-23 23:01:46,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:46,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:47,143 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-23 23:01:47,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:47,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773701283] [2023-08-23 23:01:47,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773701283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:47,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:47,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:47,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814043880] [2023-08-23 23:01:47,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:47,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:01:47,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:47,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:01:47,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:01:47,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 241 [2023-08-23 23:01:47,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 53 transitions, 332 flow. Second operand has 8 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:47,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:47,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 241 [2023-08-23 23:01:47,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:47,969 INFO L124 PetriNetUnfolderBase]: 2907/4419 cut-off events. [2023-08-23 23:01:47,969 INFO L125 PetriNetUnfolderBase]: For 7849/7849 co-relation queries the response was YES. [2023-08-23 23:01:47,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16545 conditions, 4419 events. 2907/4419 cut-off events. For 7849/7849 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 22320 event pairs, 116 based on Foata normal form. 1/4420 useless extension candidates. Maximal degree in co-relation 16526. Up to 1544 conditions per place. [2023-08-23 23:01:47,983 INFO L140 encePairwiseOnDemand]: 228/241 looper letters, 88 selfloop transitions, 18 changer transitions 156/262 dead transitions. [2023-08-23 23:01:47,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 262 transitions, 2040 flow [2023-08-23 23:01:47,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-23 23:01:47,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-23 23:01:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1874 transitions. [2023-08-23 23:01:47,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4574078594093239 [2023-08-23 23:01:47,988 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1874 transitions. [2023-08-23 23:01:47,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1874 transitions. [2023-08-23 23:01:47,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:47,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1874 transitions. [2023-08-23 23:01:47,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 110.23529411764706) internal successors, (1874), 17 states have internal predecessors, (1874), 0 states have call successors, (0), 0 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-23 23:01:47,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 241.0) internal successors, (4338), 18 states have internal predecessors, (4338), 0 states have call successors, (0), 0 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-23 23:01:47,999 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 241.0) internal successors, (4338), 18 states have internal predecessors, (4338), 0 states have call successors, (0), 0 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-23 23:01:47,999 INFO L175 Difference]: Start difference. First operand has 72 places, 53 transitions, 332 flow. Second operand 17 states and 1874 transitions. [2023-08-23 23:01:47,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 262 transitions, 2040 flow [2023-08-23 23:01:48,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 262 transitions, 1717 flow, removed 45 selfloop flow, removed 12 redundant places. [2023-08-23 23:01:48,046 INFO L231 Difference]: Finished difference. Result has 81 places, 57 transitions, 342 flow [2023-08-23 23:01:48,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=342, PETRI_PLACES=81, PETRI_TRANSITIONS=57} [2023-08-23 23:01:48,046 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 38 predicate places. [2023-08-23 23:01:48,046 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 57 transitions, 342 flow [2023-08-23 23:01:48,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 102.5) internal successors, (820), 8 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:48,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:48,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:48,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:01:48,047 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:48,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1432188251, now seen corresponding path program 3 times [2023-08-23 23:01:48,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:48,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800977914] [2023-08-23 23:01:48,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:48,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:01:49,141 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-23 23:01:49,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:01:49,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800977914] [2023-08-23 23:01:49,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800977914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:01:49,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:01:49,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:01:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385127993] [2023-08-23 23:01:49,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:01:49,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:01:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:01:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:01:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:01:49,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 241 [2023-08-23 23:01:49,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 57 transitions, 342 flow. Second operand has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:01:49,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 241 [2023-08-23 23:01:49,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:01:49,408 INFO L124 PetriNetUnfolderBase]: 667/1135 cut-off events. [2023-08-23 23:01:49,408 INFO L125 PetriNetUnfolderBase]: For 2386/2415 co-relation queries the response was YES. [2023-08-23 23:01:49,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4023 conditions, 1135 events. 667/1135 cut-off events. For 2386/2415 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4894 event pairs, 111 based on Foata normal form. 17/1141 useless extension candidates. Maximal degree in co-relation 4005. Up to 670 conditions per place. [2023-08-23 23:01:49,411 INFO L140 encePairwiseOnDemand]: 236/241 looper letters, 63 selfloop transitions, 4 changer transitions 34/106 dead transitions. [2023-08-23 23:01:49,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 106 transitions, 746 flow [2023-08-23 23:01:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:01:49,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:01:49,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-08-23 23:01:49,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47441217150760717 [2023-08-23 23:01:49,414 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-08-23 23:01:49,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-08-23 23:01:49,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:01:49,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-08-23 23:01:49,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 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-23 23:01:49,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,418 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 241.0) internal successors, (1687), 7 states have internal predecessors, (1687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,418 INFO L175 Difference]: Start difference. First operand has 81 places, 57 transitions, 342 flow. Second operand 6 states and 686 transitions. [2023-08-23 23:01:49,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 106 transitions, 746 flow [2023-08-23 23:01:49,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 106 transitions, 665 flow, removed 20 selfloop flow, removed 15 redundant places. [2023-08-23 23:01:49,424 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 271 flow [2023-08-23 23:01:49,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=241, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-08-23 23:01:49,425 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 22 predicate places. [2023-08-23 23:01:49,425 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 271 flow [2023-08-23 23:01:49,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.0) internal successors, (864), 8 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:01:49,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:01:49,426 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:49,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:01:49,426 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 23:01:49,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:01:49,426 INFO L85 PathProgramCache]: Analyzing trace with hash 108908635, now seen corresponding path program 4 times [2023-08-23 23:01:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:01:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753178553] [2023-08-23 23:01:49,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:01:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:01:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:49,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:01:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:01:49,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:01:49,550 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:01:49,551 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 23:01:49,552 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 23:01:49,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 23:01:49,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 23:01:49,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 23:01:49,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 23:01:49,556 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 23:01:49,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:01:49,557 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:01:49,561 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:01:49,561 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:01:49,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:01:49 BasicIcfg [2023-08-23 23:01:49,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:01:49,637 INFO L158 Benchmark]: Toolchain (without parser) took 27699.77ms. Allocated memory was 339.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 296.9MB in the beginning and 2.5GB in the end (delta: -2.2GB). Peak memory consumption was 459.7MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,637 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 339.7MB. Free memory was 316.8MB in the beginning and 316.7MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:01:49,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.39ms. Allocated memory is still 339.7MB. Free memory was 296.9MB in the beginning and 272.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.19ms. Allocated memory is still 339.7MB. Free memory was 272.7MB in the beginning and 316.5MB in the end (delta: -43.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,638 INFO L158 Benchmark]: Boogie Preprocessor took 49.60ms. Allocated memory is still 339.7MB. Free memory was 316.5MB in the beginning and 314.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,638 INFO L158 Benchmark]: RCFGBuilder took 733.65ms. Allocated memory is still 339.7MB. Free memory was 314.7MB in the beginning and 275.5MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,639 INFO L158 Benchmark]: TraceAbstraction took 26212.74ms. Allocated memory was 339.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 274.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 435.5MB. Max. memory is 16.0GB. [2023-08-23 23:01:49,640 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 339.7MB. Free memory was 316.8MB in the beginning and 316.7MB in the end (delta: 74.9kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 598.39ms. Allocated memory is still 339.7MB. Free memory was 296.9MB in the beginning and 272.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 98.19ms. Allocated memory is still 339.7MB. Free memory was 272.7MB in the beginning and 316.5MB in the end (delta: -43.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.0GB. * Boogie Preprocessor took 49.60ms. Allocated memory is still 339.7MB. Free memory was 316.5MB in the beginning and 314.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 733.65ms. Allocated memory is still 339.7MB. Free memory was 314.7MB in the beginning and 275.5MB in the end (delta: 39.2MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 26212.74ms. Allocated memory was 339.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 274.9MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 435.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 138 PlacesBefore, 43 PlacesAfterwards, 127 TransitionsBefore, 31 TransitionsAfterwards, 3164 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 110 TotalNumberOfCompositions, 9238 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3488, independent: 3243, independent conditional: 0, independent unconditional: 3243, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1676, independent: 1630, independent conditional: 0, independent unconditional: 1630, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3488, independent: 1613, independent conditional: 0, independent unconditional: 1613, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 1676, unknown conditional: 0, unknown unconditional: 1676] , Statistics on independence cache: Total cache size (in pairs): 165, Positive cache size: 143, Positive conditional cache size: 0, Positive unconditional cache size: 143, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L866] 0 pthread_t t681; [L867] FCALL, FORK 0 pthread_create(&t681, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t681, ((void *)0), P0, ((void *)0))=-3, t681={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t682; [L869] FCALL, FORK 0 pthread_create(&t682, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t682, ((void *)0), P1, ((void *)0))=-2, t681={5:0}, t682={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t683; [L871] FCALL, FORK 0 pthread_create(&t683, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t683, ((void *)0), P2, ((void *)0))=-1, t681={5:0}, t682={6:0}, t683={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] 0 pthread_t t684; [L873] FCALL, FORK 0 pthread_create(&t684, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t684, ((void *)0), P3, ((void *)0))=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 a$flush_delayed = weak$$choice2 [L831] 4 a$mem_tmp = a [L832] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L833] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L834] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L835] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L836] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L838] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EBX = a [L840] 4 a = a$flush_delayed ? a$mem_tmp : a [L841] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L844] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L845] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L846] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L847] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L848] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L809] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L810] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L811] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L812] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L880] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L881] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L882] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L883] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t681={5:0}, t682={6:0}, t683={7:0}, t684={3:0}, weak$$choice2=1, x=1, y=1, z=2] [L886] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 871]: 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: 873]: 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: 869]: 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, 168 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: 26.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 789 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 789 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1646 IncrementalHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 35 mSDtfsCounter, 1646 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=448occurred in iteration=8, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1844 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-23 23:01:49,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...