/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/rfi000_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:06:23,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:06:23,604 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:06:23,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:06:23,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:06:23,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:06:23,641 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:06:23,641 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:06:23,642 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:06:23,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:06:23,645 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:06:23,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:06:23,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:06:23,647 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:06:23,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:06:23,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:06:23,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:06:23,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:06:23,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:06:23,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:06:23,648 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:06:23,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:06:23,649 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:06:23,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:06:23,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:06:23,650 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:06:23,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:06:23,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:06:23,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:06:23,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:06:23,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:06:23,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:06:23,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:06:23,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:06:23,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:06:23,653 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:06:23,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:06:23,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:06:23,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:06:23,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:06:23,977 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:06:23,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:06:25,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:06:25,454 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:06:25,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:06:25,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4cd47de/12b60e7417994174a2b541dc779d1a2f/FLAGfb4437a74 [2023-08-23 23:06:25,498 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4cd47de/12b60e7417994174a2b541dc779d1a2f [2023-08-23 23:06:25,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:06:25,503 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:06:25,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:06:25,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:06:25,507 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:06:25,509 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:06:25" (1/1) ... [2023-08-23 23:06:25,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46517827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:25, skipping insertion in model container [2023-08-23 23:06:25,510 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:06:25" (1/1) ... [2023-08-23 23:06:25,568 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:06:25,706 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-23 23:06:25,896 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:06:25,909 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:06:25,928 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/rfi000_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-23 23:06:25,940 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:06:25,941 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 23:06:25,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:06:26,000 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:06:26,000 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:06:26,006 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:06:26,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26 WrapperNode [2023-08-23 23:06:26,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:06:26,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:06:26,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:06:26,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:06:26,014 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:06:26" (1/1) ... [2023-08-23 23:06:26,044 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:06:26" (1/1) ... [2023-08-23 23:06:26,080 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 130 [2023-08-23 23:06:26,080 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:06:26,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:06:26,082 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:06:26,082 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:06:26,089 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,106 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,112 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:06:26,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:06:26,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:06:26,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:06:26,145 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (1/1) ... [2023-08-23 23:06:26,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:06:26,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:06:26,181 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:06:26,208 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:06:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:06:26,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:06:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:06:26,225 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:06:26,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:06:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:06:26,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:06:26,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:06:26,228 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:06:26,381 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:06:26,382 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:06:26,679 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:06:26,879 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:06:26,880 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:06:26,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:06:26 BoogieIcfgContainer [2023-08-23 23:06:26,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:06:26,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:06:26,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:06:26,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:06:26,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:06:25" (1/3) ... [2023-08-23 23:06:26,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3950b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:06:26, skipping insertion in model container [2023-08-23 23:06:26,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:06:26" (2/3) ... [2023-08-23 23:06:26,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3950b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:06:26, skipping insertion in model container [2023-08-23 23:06:26,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:06:26" (3/3) ... [2023-08-23 23:06:26,889 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_power.oepc_pso.oepc_rmo.oepc.i [2023-08-23 23:06:26,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:06:26,904 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:06:26,904 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:06:26,952 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:06:26,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 90 transitions, 190 flow [2023-08-23 23:06:27,035 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-08-23 23:06:27,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:06:27,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-23 23:06:27,039 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 90 transitions, 190 flow [2023-08-23 23:06:27,042 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 88 transitions, 182 flow [2023-08-23 23:06:27,045 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:06:27,059 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 93 places, 88 transitions, 182 flow [2023-08-23 23:06:27,063 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 93 places, 88 transitions, 182 flow [2023-08-23 23:06:27,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 88 transitions, 182 flow [2023-08-23 23:06:27,091 INFO L124 PetriNetUnfolderBase]: 2/88 cut-off events. [2023-08-23 23:06:27,091 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:06:27,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 88 events. 2/88 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 53. Up to 2 conditions per place. [2023-08-23 23:06:27,094 INFO L119 LiptonReduction]: Number of co-enabled transitions 1174 [2023-08-23 23:06:30,967 INFO L134 LiptonReduction]: Checked pairs total: 3166 [2023-08-23 23:06:30,967 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-23 23:06:30,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:06:30,983 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;@2ffea8c2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:06:30,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-23 23:06:30,985 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:06:30,985 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-23 23:06:30,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:06:30,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:30,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-23 23:06:30,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:30,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 476963, now seen corresponding path program 1 times [2023-08-23 23:06:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887841570] [2023-08-23 23:06:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:06:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887841570] [2023-08-23 23:06:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887841570] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:06:31,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023437281] [2023-08-23 23:06:31,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:31,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:06:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:31,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:06:31,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:06:31,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 172 [2023-08-23 23:06:31,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:06:31,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:31,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 172 [2023-08-23 23:06:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:31,566 INFO L124 PetriNetUnfolderBase]: 173/315 cut-off events. [2023-08-23 23:06:31,567 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-23 23:06:31,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 315 events. 173/315 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1204 event pairs, 60 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 621. Up to 250 conditions per place. [2023-08-23 23:06:31,571 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 23 selfloop transitions, 2 changer transitions 2/29 dead transitions. [2023-08-23 23:06:31,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-08-23 23:06:31,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:06:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:06:31,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions. [2023-08-23 23:06:31,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2023-08-23 23:06:31,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 256 transitions. [2023-08-23 23:06:31,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions. [2023-08-23 23:06:31,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:31,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions. [2023-08-23 23:06:31,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 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:06:31,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:06:31,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:06:31,602 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 256 transitions. [2023-08-23 23:06:31,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-08-23 23:06:31,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:06:31,605 INFO L231 Difference]: Finished difference. Result has 25 places, 17 transitions, 42 flow [2023-08-23 23:06:31,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=17} [2023-08-23 23:06:31,610 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-23 23:06:31,610 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 17 transitions, 42 flow [2023-08-23 23:06:31,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 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:06:31,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:31,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:31,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:06:31,611 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:31,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:31,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1856191249, now seen corresponding path program 1 times [2023-08-23 23:06:31,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:31,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885419110] [2023-08-23 23:06:31,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:31,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:32,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:06:32,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:32,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885419110] [2023-08-23 23:06:32,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885419110] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:32,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:32,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:06:32,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549262321] [2023-08-23 23:06:32,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:32,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:06:32,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:06:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:06:32,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 172 [2023-08-23 23:06:32,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:06:32,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:32,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 172 [2023-08-23 23:06:32,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:32,494 INFO L124 PetriNetUnfolderBase]: 199/351 cut-off events. [2023-08-23 23:06:32,494 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-23 23:06:32,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 351 events. 199/351 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1185 event pairs, 75 based on Foata normal form. 19/370 useless extension candidates. Maximal degree in co-relation 735. Up to 212 conditions per place. [2023-08-23 23:06:32,497 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 22 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2023-08-23 23:06:32,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 126 flow [2023-08-23 23:06:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:06:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:06:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2023-08-23 23:06:32,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171511627906977 [2023-08-23 23:06:32,499 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 287 transitions. [2023-08-23 23:06:32,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 287 transitions. [2023-08-23 23:06:32,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:32,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 287 transitions. [2023-08-23 23:06:32,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 71.75) internal successors, (287), 4 states have internal predecessors, (287), 0 states have call successors, (0), 0 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:06:32,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:32,502 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:32,502 INFO L175 Difference]: Start difference. First operand has 25 places, 17 transitions, 42 flow. Second operand 4 states and 287 transitions. [2023-08-23 23:06:32,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 126 flow [2023-08-23 23:06:32,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:06:32,503 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 90 flow [2023-08-23 23:06:32,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2023-08-23 23:06:32,504 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-23 23:06:32,504 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 90 flow [2023-08-23 23:06:32,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 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:06:32,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:32,505 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:32,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:06:32,505 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:32,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:32,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1002104403, now seen corresponding path program 1 times [2023-08-23 23:06:32,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:32,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717589562] [2023-08-23 23:06:32,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:32,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:32,738 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:06:32,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:32,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717589562] [2023-08-23 23:06:32,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717589562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:32,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:32,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:06:32,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038759738] [2023-08-23 23:06:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:32,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:06:32,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:06:32,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:06:32,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 172 [2023-08-23 23:06:32,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:06:32,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:32,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 172 [2023-08-23 23:06:32,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:32,826 INFO L124 PetriNetUnfolderBase]: 150/279 cut-off events. [2023-08-23 23:06:32,827 INFO L125 PetriNetUnfolderBase]: For 136/139 co-relation queries the response was YES. [2023-08-23 23:06:32,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 784 conditions, 279 events. 150/279 cut-off events. For 136/139 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 986 event pairs, 20 based on Foata normal form. 8/286 useless extension candidates. Maximal degree in co-relation 771. Up to 159 conditions per place. [2023-08-23 23:06:32,829 INFO L140 encePairwiseOnDemand]: 168/172 looper letters, 28 selfloop transitions, 5 changer transitions 0/36 dead transitions. [2023-08-23 23:06:32,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 206 flow [2023-08-23 23:06:32,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:06:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:06:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 329 transitions. [2023-08-23 23:06:32,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47819767441860467 [2023-08-23 23:06:32,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 329 transitions. [2023-08-23 23:06:32,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 329 transitions. [2023-08-23 23:06:32,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:32,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 329 transitions. [2023-08-23 23:06:32,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 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:06:32,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:32,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:32,834 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 90 flow. Second operand 4 states and 329 transitions. [2023-08-23 23:06:32,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 206 flow [2023-08-23 23:06:32,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:06:32,836 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 116 flow [2023-08-23 23:06:32,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-08-23 23:06:32,837 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-08-23 23:06:32,837 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 116 flow [2023-08-23 23:06:32,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 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:06:32,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:32,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:32,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:06:32,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:32,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1777407638, now seen corresponding path program 1 times [2023-08-23 23:06:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758067487] [2023-08-23 23:06:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:33,409 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:06:33,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:33,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758067487] [2023-08-23 23:06:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758067487] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:33,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:33,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:06:33,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760104418] [2023-08-23 23:06:33,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:33,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:06:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:06:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:06:33,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-08-23 23:06:33,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:06:33,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:33,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-08-23 23:06:33,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:33,525 INFO L124 PetriNetUnfolderBase]: 169/311 cut-off events. [2023-08-23 23:06:33,525 INFO L125 PetriNetUnfolderBase]: For 248/251 co-relation queries the response was YES. [2023-08-23 23:06:33,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 311 events. 169/311 cut-off events. For 248/251 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1091 event pairs, 65 based on Foata normal form. 4/314 useless extension candidates. Maximal degree in co-relation 955. Up to 249 conditions per place. [2023-08-23 23:06:33,528 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 30 selfloop transitions, 10 changer transitions 0/42 dead transitions. [2023-08-23 23:06:33,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 42 transitions, 262 flow [2023-08-23 23:06:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:06:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:06:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 319 transitions. [2023-08-23 23:06:33,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636627906976744 [2023-08-23 23:06:33,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 319 transitions. [2023-08-23 23:06:33,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 319 transitions. [2023-08-23 23:06:33,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:33,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 319 transitions. [2023-08-23 23:06:33,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 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:06:33,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:33,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:33,533 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 116 flow. Second operand 4 states and 319 transitions. [2023-08-23 23:06:33,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 42 transitions, 262 flow [2023-08-23 23:06:33,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:06:33,536 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 182 flow [2023-08-23 23:06:33,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2023-08-23 23:06:33,537 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-08-23 23:06:33,537 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 30 transitions, 182 flow [2023-08-23 23:06:33,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 4 states have internal predecessors, (295), 0 states have call successors, (0), 0 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:06:33,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:33,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:33,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:06:33,538 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:33,538 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:33,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1002757988, now seen corresponding path program 2 times [2023-08-23 23:06:33,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:33,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262229683] [2023-08-23 23:06:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:34,128 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:06:34,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:34,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262229683] [2023-08-23 23:06:34,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262229683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:34,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:34,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:06:34,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80124221] [2023-08-23 23:06:34,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:06:34,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:06:34,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:06:34,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 172 [2023-08-23 23:06:34,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 30 transitions, 182 flow. Second operand has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:06:34,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:34,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 172 [2023-08-23 23:06:34,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:34,303 INFO L124 PetriNetUnfolderBase]: 171/315 cut-off events. [2023-08-23 23:06:34,303 INFO L125 PetriNetUnfolderBase]: For 391/394 co-relation queries the response was YES. [2023-08-23 23:06:34,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1151 conditions, 315 events. 171/315 cut-off events. For 391/394 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1124 event pairs, 71 based on Foata normal form. 6/318 useless extension candidates. Maximal degree in co-relation 1132. Up to 253 conditions per place. [2023-08-23 23:06:34,305 INFO L140 encePairwiseOnDemand]: 164/172 looper letters, 33 selfloop transitions, 21 changer transitions 0/56 dead transitions. [2023-08-23 23:06:34,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 438 flow [2023-08-23 23:06:34,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:06:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:06:34,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 536 transitions. [2023-08-23 23:06:34,308 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44518272425249167 [2023-08-23 23:06:34,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 536 transitions. [2023-08-23 23:06:34,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 536 transitions. [2023-08-23 23:06:34,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:34,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 536 transitions. [2023-08-23 23:06:34,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 76.57142857142857) internal successors, (536), 7 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:06:34,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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:06:34,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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:06:34,312 INFO L175 Difference]: Start difference. First operand has 36 places, 30 transitions, 182 flow. Second operand 7 states and 536 transitions. [2023-08-23 23:06:34,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 438 flow [2023-08-23 23:06:34,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 418 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-23 23:06:34,316 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 340 flow [2023-08-23 23:06:34,316 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-23 23:06:34,317 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-08-23 23:06:34,317 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 340 flow [2023-08-23 23:06:34,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.57142857142857) internal successors, (501), 7 states have internal predecessors, (501), 0 states have call successors, (0), 0 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:06:34,317 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:34,317 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:34,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:06:34,318 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:34,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:34,318 INFO L85 PathProgramCache]: Analyzing trace with hash 125704105, now seen corresponding path program 1 times [2023-08-23 23:06:34,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:34,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098341317] [2023-08-23 23:06:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:34,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:35,296 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:06:35,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:35,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098341317] [2023-08-23 23:06:35,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098341317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:35,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:35,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:06:35,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429754197] [2023-08-23 23:06:35,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:35,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:06:35,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:35,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:06:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:06:35,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-08-23 23:06:35,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 340 flow. Second operand has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:06:35,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:35,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-08-23 23:06:35,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:35,854 INFO L124 PetriNetUnfolderBase]: 310/590 cut-off events. [2023-08-23 23:06:35,854 INFO L125 PetriNetUnfolderBase]: For 1348/1354 co-relation queries the response was YES. [2023-08-23 23:06:35,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2192 conditions, 590 events. 310/590 cut-off events. For 1348/1354 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2795 event pairs, 20 based on Foata normal form. 30/617 useless extension candidates. Maximal degree in co-relation 2169. Up to 271 conditions per place. [2023-08-23 23:06:35,859 INFO L140 encePairwiseOnDemand]: 165/172 looper letters, 58 selfloop transitions, 19 changer transitions 9/88 dead transitions. [2023-08-23 23:06:35,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 737 flow [2023-08-23 23:06:35,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:06:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:06:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 587 transitions. [2023-08-23 23:06:35,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265988372093023 [2023-08-23 23:06:35,862 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 587 transitions. [2023-08-23 23:06:35,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 587 transitions. [2023-08-23 23:06:35,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:35,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 587 transitions. [2023-08-23 23:06:35,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.375) internal successors, (587), 8 states have internal predecessors, (587), 0 states have call successors, (0), 0 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:06:35,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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:06:35,866 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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:06:35,866 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 340 flow. Second operand 8 states and 587 transitions. [2023-08-23 23:06:35,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 737 flow [2023-08-23 23:06:35,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 721 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-23 23:06:35,871 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 437 flow [2023-08-23 23:06:35,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=437, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-23 23:06:35,872 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2023-08-23 23:06:35,872 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 437 flow [2023-08-23 23:06:35,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 67.71428571428571) internal successors, (474), 7 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:06:35,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:35,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:35,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:06:35,873 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:35,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:35,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1020762695, now seen corresponding path program 2 times [2023-08-23 23:06:35,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:35,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303671698] [2023-08-23 23:06:35,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:35,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:36,393 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:06:36,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:36,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303671698] [2023-08-23 23:06:36,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303671698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:36,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:36,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 23:06:36,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080619740] [2023-08-23 23:06:36,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:36,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-23 23:06:36,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:36,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-23 23:06:36,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-23 23:06:36,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 172 [2023-08-23 23:06:36,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 437 flow. Second operand has 8 states, 8 states have (on average 70.5) internal successors, (564), 8 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:06:36,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:36,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 172 [2023-08-23 23:06:36,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:36,658 INFO L124 PetriNetUnfolderBase]: 249/485 cut-off events. [2023-08-23 23:06:36,658 INFO L125 PetriNetUnfolderBase]: For 1961/1970 co-relation queries the response was YES. [2023-08-23 23:06:36,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2077 conditions, 485 events. 249/485 cut-off events. For 1961/1970 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2238 event pairs, 29 based on Foata normal form. 18/500 useless extension candidates. Maximal degree in co-relation 2049. Up to 343 conditions per place. [2023-08-23 23:06:36,662 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 41 selfloop transitions, 37 changer transitions 7/87 dead transitions. [2023-08-23 23:06:36,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 87 transitions, 830 flow [2023-08-23 23:06:36,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 23:06:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 23:06:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 613 transitions. [2023-08-23 23:06:36,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44549418604651164 [2023-08-23 23:06:36,664 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 613 transitions. [2023-08-23 23:06:36,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 613 transitions. [2023-08-23 23:06:36,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:36,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 613 transitions. [2023-08-23 23:06:36,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 76.625) internal successors, (613), 8 states have internal predecessors, (613), 0 states have call successors, (0), 0 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:06:36,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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:06:36,668 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 172.0) internal successors, (1548), 9 states have internal predecessors, (1548), 0 states have call successors, (0), 0 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:06:36,668 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 437 flow. Second operand 8 states and 613 transitions. [2023-08-23 23:06:36,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 87 transitions, 830 flow [2023-08-23 23:06:36,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 802 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-23 23:06:36,675 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 668 flow [2023-08-23 23:06:36,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=668, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2023-08-23 23:06:36,676 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2023-08-23 23:06:36,676 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 668 flow [2023-08-23 23:06:36,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 70.5) internal successors, (564), 8 states have internal predecessors, (564), 0 states have call successors, (0), 0 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:06:36,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:36,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:36,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:06:36,677 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:36,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:36,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1700478568, now seen corresponding path program 1 times [2023-08-23 23:06:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:36,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647438455] [2023-08-23 23:06:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:36,809 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:06:36,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:36,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647438455] [2023-08-23 23:06:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647438455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:36,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:06:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268127753] [2023-08-23 23:06:36,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:36,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:06:36,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:36,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:06:36,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:06:36,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 172 [2023-08-23 23:06:36,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:06:36,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:36,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 172 [2023-08-23 23:06:36,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:36,928 INFO L124 PetriNetUnfolderBase]: 284/547 cut-off events. [2023-08-23 23:06:36,929 INFO L125 PetriNetUnfolderBase]: For 2803/2812 co-relation queries the response was YES. [2023-08-23 23:06:36,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 547 events. 284/547 cut-off events. For 2803/2812 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2574 event pairs, 79 based on Foata normal form. 15/557 useless extension candidates. Maximal degree in co-relation 2599. Up to 308 conditions per place. [2023-08-23 23:06:36,932 INFO L140 encePairwiseOnDemand]: 169/172 looper letters, 40 selfloop transitions, 3 changer transitions 31/77 dead transitions. [2023-08-23 23:06:36,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 77 transitions, 932 flow [2023-08-23 23:06:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:06:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:06:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2023-08-23 23:06:36,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844961240310077 [2023-08-23 23:06:36,934 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 250 transitions. [2023-08-23 23:06:36,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 250 transitions. [2023-08-23 23:06:36,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:36,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 250 transitions. [2023-08-23 23:06:36,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:06:36,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:06:36,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 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:06:36,936 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 668 flow. Second operand 3 states and 250 transitions. [2023-08-23 23:06:36,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 77 transitions, 932 flow [2023-08-23 23:06:36,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 869 flow, removed 20 selfloop flow, removed 3 redundant places. [2023-08-23 23:06:36,945 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 385 flow [2023-08-23 23:06:36,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=385, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-08-23 23:06:36,945 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 36 predicate places. [2023-08-23 23:06:36,945 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 385 flow [2023-08-23 23:06:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 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:06:36,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:36,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:36,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:06:36,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:36,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:36,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1377289425, now seen corresponding path program 1 times [2023-08-23 23:06:36,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:36,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075103009] [2023-08-23 23:06:36,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:36,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 23:06:38,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:38,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075103009] [2023-08-23 23:06:38,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075103009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-23 23:06:38,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073093408] [2023-08-23 23:06:38,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:38,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-23 23:06:38,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:38,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-23 23:06:38,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-23 23:06:38,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 172 [2023-08-23 23:06:38,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 40 transitions, 385 flow. Second operand has 9 states, 9 states have (on average 67.44444444444444) internal successors, (607), 9 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:06:38,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:38,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 172 [2023-08-23 23:06:38,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:38,561 INFO L124 PetriNetUnfolderBase]: 145/375 cut-off events. [2023-08-23 23:06:38,561 INFO L125 PetriNetUnfolderBase]: For 1578/1582 co-relation queries the response was YES. [2023-08-23 23:06:38,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1710 conditions, 375 events. 145/375 cut-off events. For 1578/1582 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1976 event pairs, 19 based on Foata normal form. 8/379 useless extension candidates. Maximal degree in co-relation 1679. Up to 183 conditions per place. [2023-08-23 23:06:38,564 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 34 selfloop transitions, 17 changer transitions 19/72 dead transitions. [2023-08-23 23:06:38,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 72 transitions, 735 flow [2023-08-23 23:06:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-23 23:06:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-23 23:06:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 652 transitions. [2023-08-23 23:06:38,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42118863049095606 [2023-08-23 23:06:38,566 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 652 transitions. [2023-08-23 23:06:38,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 652 transitions. [2023-08-23 23:06:38,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:38,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 652 transitions. [2023-08-23 23:06:38,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:06:38,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:06:38,571 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 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:06:38,571 INFO L175 Difference]: Start difference. First operand has 62 places, 40 transitions, 385 flow. Second operand 9 states and 652 transitions. [2023-08-23 23:06:38,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 72 transitions, 735 flow [2023-08-23 23:06:38,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 72 transitions, 703 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-23 23:06:38,609 INFO L231 Difference]: Finished difference. Result has 69 places, 39 transitions, 416 flow [2023-08-23 23:06:38,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=416, PETRI_PLACES=69, PETRI_TRANSITIONS=39} [2023-08-23 23:06:38,609 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 43 predicate places. [2023-08-23 23:06:38,610 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 39 transitions, 416 flow [2023-08-23 23:06:38,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.44444444444444) internal successors, (607), 9 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:06:38,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:38,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:38,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:06:38,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:38,611 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1577778879, now seen corresponding path program 2 times [2023-08-23 23:06:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869143849] [2023-08-23 23:06:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:39,800 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:06:39,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:39,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869143849] [2023-08-23 23:06:39,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869143849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:39,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:39,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:06:39,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121865305] [2023-08-23 23:06:39,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:39,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:06:39,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:39,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:06:39,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:06:39,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 172 [2023-08-23 23:06:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 39 transitions, 416 flow. Second operand has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:06:39,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:39,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 172 [2023-08-23 23:06:39,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:40,048 INFO L124 PetriNetUnfolderBase]: 119/303 cut-off events. [2023-08-23 23:06:40,048 INFO L125 PetriNetUnfolderBase]: For 1689/1693 co-relation queries the response was YES. [2023-08-23 23:06:40,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 303 events. 119/303 cut-off events. For 1689/1693 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1467 event pairs, 40 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 1527. Up to 221 conditions per place. [2023-08-23 23:06:40,050 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 27 selfloop transitions, 9 changer transitions 17/54 dead transitions. [2023-08-23 23:06:40,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 54 transitions, 587 flow [2023-08-23 23:06:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:06:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:06:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 511 transitions. [2023-08-23 23:06:40,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42441860465116277 [2023-08-23 23:06:40,053 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 511 transitions. [2023-08-23 23:06:40,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 511 transitions. [2023-08-23 23:06:40,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:40,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 511 transitions. [2023-08-23 23:06:40,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.0) internal successors, (511), 7 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:06:40,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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:06:40,056 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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:06:40,056 INFO L175 Difference]: Start difference. First operand has 69 places, 39 transitions, 416 flow. Second operand 7 states and 511 transitions. [2023-08-23 23:06:40,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 54 transitions, 587 flow [2023-08-23 23:06:40,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 54 transitions, 552 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-23 23:06:40,063 INFO L231 Difference]: Finished difference. Result has 72 places, 31 transitions, 334 flow [2023-08-23 23:06:40,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=334, PETRI_PLACES=72, PETRI_TRANSITIONS=31} [2023-08-23 23:06:40,064 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2023-08-23 23:06:40,064 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 31 transitions, 334 flow [2023-08-23 23:06:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.85714285714286) internal successors, (482), 7 states have internal predecessors, (482), 0 states have call successors, (0), 0 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:06:40,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:40,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:40,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:06:40,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:40,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:40,065 INFO L85 PathProgramCache]: Analyzing trace with hash 572043100, now seen corresponding path program 2 times [2023-08-23 23:06:40,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:40,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806517094] [2023-08-23 23:06:40,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:40,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:40,228 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:06:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806517094] [2023-08-23 23:06:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806517094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:40,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:40,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:06:40,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255356866] [2023-08-23 23:06:40,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:40,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:06:40,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:40,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:06:40,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:06:40,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-08-23 23:06:40,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 31 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:06:40,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:40,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-08-23 23:06:40,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:40,293 INFO L124 PetriNetUnfolderBase]: 29/84 cut-off events. [2023-08-23 23:06:40,294 INFO L125 PetriNetUnfolderBase]: For 660/661 co-relation queries the response was YES. [2023-08-23 23:06:40,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 84 events. 29/84 cut-off events. For 660/661 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 10 based on Foata normal form. 16/100 useless extension candidates. Maximal degree in co-relation 399. Up to 35 conditions per place. [2023-08-23 23:06:40,294 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 23 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2023-08-23 23:06:40,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 30 transitions, 312 flow [2023-08-23 23:06:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:06:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:06:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 310 transitions. [2023-08-23 23:06:40,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45058139534883723 [2023-08-23 23:06:40,296 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 310 transitions. [2023-08-23 23:06:40,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 310 transitions. [2023-08-23 23:06:40,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:40,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 310 transitions. [2023-08-23 23:06:40,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 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:06:40,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:40,299 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:06:40,299 INFO L175 Difference]: Start difference. First operand has 72 places, 31 transitions, 334 flow. Second operand 4 states and 310 transitions. [2023-08-23 23:06:40,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 30 transitions, 312 flow [2023-08-23 23:06:40,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 213 flow, removed 24 selfloop flow, removed 27 redundant places. [2023-08-23 23:06:40,301 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 143 flow [2023-08-23 23:06:40,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-08-23 23:06:40,302 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2023-08-23 23:06:40,302 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 143 flow [2023-08-23 23:06:40,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 4 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:06:40,302 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:40,302 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:40,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 23:06:40,303 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:40,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1083642294, now seen corresponding path program 1 times [2023-08-23 23:06:40,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:40,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713670592] [2023-08-23 23:06:40,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:40,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:06:40,673 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:06:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:06:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713670592] [2023-08-23 23:06:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713670592] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:06:40,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:06:40,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:06:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663592399] [2023-08-23 23:06:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:06:40,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:06:40,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:06:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:06:40,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:06:40,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 172 [2023-08-23 23:06:40,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:06:40,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:06:40,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 172 [2023-08-23 23:06:40,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:06:40,727 INFO L124 PetriNetUnfolderBase]: 9/41 cut-off events. [2023-08-23 23:06:40,727 INFO L125 PetriNetUnfolderBase]: For 130/131 co-relation queries the response was YES. [2023-08-23 23:06:40,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 41 events. 9/41 cut-off events. For 130/131 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 2 based on Foata normal form. 6/47 useless extension candidates. Maximal degree in co-relation 161. Up to 17 conditions per place. [2023-08-23 23:06:40,728 INFO L140 encePairwiseOnDemand]: 167/172 looper letters, 15 selfloop transitions, 6 changer transitions 1/24 dead transitions. [2023-08-23 23:06:40,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 24 transitions, 194 flow [2023-08-23 23:06:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:06:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:06:40,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2023-08-23 23:06:40,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4383720930232558 [2023-08-23 23:06:40,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 377 transitions. [2023-08-23 23:06:40,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 377 transitions. [2023-08-23 23:06:40,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:06:40,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 377 transitions. [2023-08-23 23:06:40,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 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:06:40,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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:06:40,732 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 172.0) internal successors, (1032), 6 states have internal predecessors, (1032), 0 states have call successors, (0), 0 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:06:40,732 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 143 flow. Second operand 5 states and 377 transitions. [2023-08-23 23:06:40,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 24 transitions, 194 flow [2023-08-23 23:06:40,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 24 transitions, 158 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-23 23:06:40,734 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 123 flow [2023-08-23 23:06:40,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-08-23 23:06:40,735 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 14 predicate places. [2023-08-23 23:06:40,735 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 123 flow [2023-08-23 23:06:40,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 5 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:06:40,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:06:40,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:06:40,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-23 23:06:40,736 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-23 23:06:40,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:06:40,736 INFO L85 PathProgramCache]: Analyzing trace with hash 399621527, now seen corresponding path program 1 times [2023-08-23 23:06:40,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:06:40,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600554460] [2023-08-23 23:06:40,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:06:40,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:06:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:06:40,812 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:06:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:06:40,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:06:40,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:06:40,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-23 23:06:40,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-23 23:06:40,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-23 23:06:40,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-23 23:06:40,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-23 23:06:40,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-23 23:06:40,867 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-08-23 23:06:40,871 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:06:40,871 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:06:40,919 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:06:40 BasicIcfg [2023-08-23 23:06:40,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:06:40,919 INFO L158 Benchmark]: Toolchain (without parser) took 15416.75ms. Allocated memory was 360.7MB in the beginning and 675.3MB in the end (delta: 314.6MB). Free memory was 336.3MB in the beginning and 625.8MB in the end (delta: -289.5MB). Peak memory consumption was 28.3MB. Max. memory is 16.0GB. [2023-08-23 23:06:40,920 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 360.7MB. Free memory is still 337.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:06:40,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.37ms. Allocated memory is still 360.7MB. Free memory was 335.8MB in the beginning and 310.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 23:06:40,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.50ms. Allocated memory is still 360.7MB. Free memory was 310.7MB in the beginning and 308.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:06:40,920 INFO L158 Benchmark]: Boogie Preprocessor took 62.65ms. Allocated memory is still 360.7MB. Free memory was 308.1MB in the beginning and 305.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:06:40,921 INFO L158 Benchmark]: RCFGBuilder took 737.27ms. Allocated memory is still 360.7MB. Free memory was 305.8MB in the beginning and 308.1MB in the end (delta: -2.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-23 23:06:40,921 INFO L158 Benchmark]: TraceAbstraction took 14034.57ms. Allocated memory was 360.7MB in the beginning and 675.3MB in the end (delta: 314.6MB). Free memory was 308.1MB in the beginning and 625.8MB in the end (delta: -317.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:06:40,922 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.10ms. Allocated memory is still 360.7MB. Free memory is still 337.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 502.37ms. Allocated memory is still 360.7MB. Free memory was 335.8MB in the beginning and 310.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.50ms. Allocated memory is still 360.7MB. Free memory was 310.7MB in the beginning and 308.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 62.65ms. Allocated memory is still 360.7MB. Free memory was 308.1MB in the beginning and 305.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 737.27ms. Allocated memory is still 360.7MB. Free memory was 305.8MB in the beginning and 308.1MB in the end (delta: -2.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 14034.57ms. Allocated memory was 360.7MB in the beginning and 675.3MB in the end (delta: 314.6MB). Free memory was 308.1MB in the beginning and 625.8MB in the end (delta: -317.7MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 93 PlacesBefore, 26 PlacesAfterwards, 88 TransitionsBefore, 19 TransitionsAfterwards, 1174 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 82 TotalNumberOfCompositions, 3166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1375, independent: 1234, independent conditional: 0, independent unconditional: 1234, dependent: 141, dependent conditional: 0, dependent unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 679, independent: 641, independent conditional: 0, independent unconditional: 641, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1375, independent: 593, independent conditional: 0, independent unconditional: 593, dependent: 103, dependent conditional: 0, dependent unconditional: 103, unknown: 679, unknown conditional: 0, unknown unconditional: 679] , Statistics on independence cache: Total cache size (in pairs): 43, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L826] 0 pthread_t t1585; [L827] FCALL, FORK 0 pthread_create(&t1585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1585, ((void *)0), P0, ((void *)0))=-1, t1585={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L828] 0 pthread_t t1586; [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 2 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L829] FCALL, FORK 0 pthread_create(&t1586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1586, ((void *)0), P1, ((void *)0))=0, t1585={5:0}, t1586={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L788] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 2 y$flush_delayed = weak$$choice2 [L791] 2 y$mem_tmp = y [L792] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L793] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L794] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L795] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L796] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L797] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L798] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L799] 2 __unbuffered_p1_EBX = y [L800] 2 y = y$flush_delayed ? y$mem_tmp : y [L801] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L804] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L805] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L806] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L807] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L836] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1585={5:0}, t1586={3:0}, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L842] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L843] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L844] 0 y$flush_delayed = weak$$choice2 [L845] 0 y$mem_tmp = y [L846] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L847] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L848] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L849] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L850] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L852] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) [L854] 0 y = y$flush_delayed ? y$mem_tmp : y [L855] 0 y$flush_delayed = (_Bool)0 [L857] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 827]: 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: 829]: 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 5 procedures, 110 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 223 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 777 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 12 mSDtfsCounter, 777 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=668occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 2105 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:06:40,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...