/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:37:09,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:37:09,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:37:09,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:37:09,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:37:09,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:37:09,958 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:37:09,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:37:09,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:37:09,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:37:09,962 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:37:09,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:37:09,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:37:09,964 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:37:09,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:37:09,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:37:09,965 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:37:09,965 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:37:09,965 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:37:09,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:37:09,966 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:37:09,966 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:37:09,966 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:37:09,967 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:37:09,967 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:37:09,967 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:37:09,967 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:37:09,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:37:09,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:37:09,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:37:09,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:37:09,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:37:09,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:37:09,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:37:09,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:37:09,970 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:37:10,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:37:10,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:37:10,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:37:10,330 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:37:10,331 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:37:10,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:37:11,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:37:11,730 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:37:11,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:37:11,749 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52270ed8a/645be78b122f4e40b3b770417b5bca25/FLAG431b0a09a [2023-08-24 05:37:11,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52270ed8a/645be78b122f4e40b3b770417b5bca25 [2023-08-24 05:37:11,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:37:11,765 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:37:11,768 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:37:11,768 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:37:11,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:37:11,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:37:11" (1/1) ... [2023-08-24 05:37:11,772 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36681ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:11, skipping insertion in model container [2023-08-24 05:37:11,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:37:11" (1/1) ... [2023-08-24 05:37:11,824 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:37:11,933 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-24 05:37:12,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:37:12,125 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:37:12,137 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2023-08-24 05:37:12,153 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:37:12,154 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:37:12,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:37:12,216 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:37:12,216 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:37:12,222 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:37:12,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12 WrapperNode [2023-08-24 05:37:12,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:37:12,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:37:12,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:37:12,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:37:12,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,293 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-24 05:37:12,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:37:12,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:37:12,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:37:12,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:37:12,302 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:37:12,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:37:12,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:37:12,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:37:12,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (1/1) ... [2023-08-24 05:37:12,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:37:12,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:37:12,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:37:12,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:37:12,401 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:37:12,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:37:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:37:12,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:37:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:37:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:37:12,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:37:12,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:37:12,405 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:37:12,508 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:37:12,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:37:12,724 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:37:12,866 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:37:12,867 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:37:12,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:37:12 BoogieIcfgContainer [2023-08-24 05:37:12,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:37:12,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:37:12,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:37:12,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:37:12,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:37:11" (1/3) ... [2023-08-24 05:37:12,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202fc3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:37:12, skipping insertion in model container [2023-08-24 05:37:12,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:37:12" (2/3) ... [2023-08-24 05:37:12,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202fc3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:37:12, skipping insertion in model container [2023-08-24 05:37:12,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:37:12" (3/3) ... [2023-08-24 05:37:12,876 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2023-08-24 05:37:12,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:37:12,892 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:37:12,892 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:37:12,941 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:37:12,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 86 transitions, 182 flow [2023-08-24 05:37:13,031 INFO L124 PetriNetUnfolderBase]: 2/84 cut-off events. [2023-08-24 05:37:13,031 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:37:13,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:37:13,036 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 86 transitions, 182 flow [2023-08-24 05:37:13,040 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 84 transitions, 174 flow [2023-08-24 05:37:13,043 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:37:13,064 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 174 flow [2023-08-24 05:37:13,066 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 174 flow [2023-08-24 05:37:13,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 174 flow [2023-08-24 05:37:13,084 INFO L124 PetriNetUnfolderBase]: 2/84 cut-off events. [2023-08-24 05:37:13,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:37:13,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 84 events. 2/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:37:13,089 INFO L119 LiptonReduction]: Number of co-enabled transitions 1034 [2023-08-24 05:37:15,816 INFO L134 LiptonReduction]: Checked pairs total: 2756 [2023-08-24 05:37:15,817 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-24 05:37:15,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:37:15,831 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;@2cbbbc1a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:37:15,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:37:15,833 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:37:15,834 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-24 05:37:15,834 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:37:15,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:15,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:37:15,835 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-24 05:37:15,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:15,838 INFO L85 PathProgramCache]: Analyzing trace with hash 393810, now seen corresponding path program 1 times [2023-08-24 05:37:15,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:15,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031822588] [2023-08-24 05:37:15,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:16,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:16,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031822588] [2023-08-24 05:37:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031822588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:16,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:37:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075082473] [2023-08-24 05:37:16,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:16,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:37:16,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:16,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:37:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:37:16,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 162 [2023-08-24 05:37:16,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:16,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:16,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 162 [2023-08-24 05:37:16,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:16,289 INFO L124 PetriNetUnfolderBase]: 159/311 cut-off events. [2023-08-24 05:37:16,290 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 05:37:16,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 311 events. 159/311 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1410 event pairs, 18 based on Foata normal form. 16/293 useless extension candidates. Maximal degree in co-relation 595. Up to 232 conditions per place. [2023-08-24 05:37:16,294 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 21 selfloop transitions, 2 changer transitions 4/29 dead transitions. [2023-08-24 05:37:16,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 121 flow [2023-08-24 05:37:16,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:37:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:37:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2023-08-24 05:37:16,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2023-08-24 05:37:16,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 252 transitions. [2023-08-24 05:37:16,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 252 transitions. [2023-08-24 05:37:16,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:16,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 252 transitions. [2023-08-24 05:37:16,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:16,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:16,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:16,324 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 252 transitions. [2023-08-24 05:37:16,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 121 flow [2023-08-24 05:37:16,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:16,327 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-24 05:37:16,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, 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=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-24 05:37:16,333 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-24 05:37:16,334 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-24 05:37:16,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:16,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:16,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:16,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:37:16,335 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-24 05:37:16,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:16,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1209529008, now seen corresponding path program 1 times [2023-08-24 05:37:16,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:16,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701474203] [2023-08-24 05:37:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701474203] [2023-08-24 05:37:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701474203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:17,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:17,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:17,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396095683] [2023-08-24 05:37:17,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:17,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:37:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:17,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:37:17,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:37:17,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-08-24 05:37:17,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:17,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-08-24 05:37:17,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:17,374 INFO L124 PetriNetUnfolderBase]: 229/411 cut-off events. [2023-08-24 05:37:17,374 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-24 05:37:17,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 411 events. 229/411 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1624 event pairs, 64 based on Foata normal form. 29/440 useless extension candidates. Maximal degree in co-relation 858. Up to 297 conditions per place. [2023-08-24 05:37:17,377 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 25 selfloop transitions, 8 changer transitions 18/51 dead transitions. [2023-08-24 05:37:17,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 51 transitions, 222 flow [2023-08-24 05:37:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:37:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:37:17,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 488 transitions. [2023-08-24 05:37:17,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43033509700176364 [2023-08-24 05:37:17,380 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 488 transitions. [2023-08-24 05:37:17,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 488 transitions. [2023-08-24 05:37:17,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:17,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 488 transitions. [2023-08-24 05:37:17,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 69.71428571428571) internal successors, (488), 7 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,387 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,387 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 7 states and 488 transitions. [2023-08-24 05:37:17,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 51 transitions, 222 flow [2023-08-24 05:37:17,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:17,389 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 95 flow [2023-08-24 05:37:17,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=95, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-24 05:37:17,390 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2023-08-24 05:37:17,390 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 95 flow [2023-08-24 05:37:17,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.6) internal successors, (318), 5 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:17,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:17,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:37:17,391 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-24 05:37:17,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:17,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1159300945, now seen corresponding path program 1 times [2023-08-24 05:37:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323500072] [2023-08-24 05:37:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:17,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323500072] [2023-08-24 05:37:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323500072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:17,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:17,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750767531] [2023-08-24 05:37:17,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:17,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:37:17,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:17,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:37:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:37:17,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-24 05:37:17,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 95 flow. Second operand has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:17,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-24 05:37:17,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:17,922 INFO L124 PetriNetUnfolderBase]: 190/352 cut-off events. [2023-08-24 05:37:17,922 INFO L125 PetriNetUnfolderBase]: For 362/373 co-relation queries the response was YES. [2023-08-24 05:37:17,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1083 conditions, 352 events. 190/352 cut-off events. For 362/373 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1387 event pairs, 62 based on Foata normal form. 29/381 useless extension candidates. Maximal degree in co-relation 1068. Up to 295 conditions per place. [2023-08-24 05:37:17,926 INFO L140 encePairwiseOnDemand]: 157/162 looper letters, 24 selfloop transitions, 3 changer transitions 11/40 dead transitions. [2023-08-24 05:37:17,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 232 flow [2023-08-24 05:37:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:37:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:37:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 368 transitions. [2023-08-24 05:37:17,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454320987654321 [2023-08-24 05:37:17,928 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 368 transitions. [2023-08-24 05:37:17,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 368 transitions. [2023-08-24 05:37:17,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:17,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 368 transitions. [2023-08-24 05:37:17,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-24 05:37:17,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,932 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 162.0) internal successors, (972), 6 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,932 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 95 flow. Second operand 5 states and 368 transitions. [2023-08-24 05:37:17,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 232 flow [2023-08-24 05:37:17,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 228 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:17,936 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 118 flow [2023-08-24 05:37:17,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2023-08-24 05:37:17,937 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2023-08-24 05:37:17,940 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 118 flow [2023-08-24 05:37:17,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 68.8) internal successors, (344), 5 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:17,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:17,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:17,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:37:17,941 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-24 05:37:17,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1583242462, now seen corresponding path program 1 times [2023-08-24 05:37:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:17,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906274175] [2023-08-24 05:37:17,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:17,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906274175] [2023-08-24 05:37:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906274175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:18,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:18,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:37:18,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914618761] [2023-08-24 05:37:18,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:18,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:37:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:37:18,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:37:18,488 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 162 [2023-08-24 05:37:18,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:18,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:18,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 162 [2023-08-24 05:37:18,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:18,637 INFO L124 PetriNetUnfolderBase]: 264/488 cut-off events. [2023-08-24 05:37:18,637 INFO L125 PetriNetUnfolderBase]: For 673/673 co-relation queries the response was YES. [2023-08-24 05:37:18,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1667 conditions, 488 events. 264/488 cut-off events. For 673/673 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2142 event pairs, 47 based on Foata normal form. 27/515 useless extension candidates. Maximal degree in co-relation 1649. Up to 236 conditions per place. [2023-08-24 05:37:18,640 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 32 selfloop transitions, 8 changer transitions 12/52 dead transitions. [2023-08-24 05:37:18,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 52 transitions, 342 flow [2023-08-24 05:37:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:37:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:37:18,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 419 transitions. [2023-08-24 05:37:18,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43106995884773663 [2023-08-24 05:37:18,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 419 transitions. [2023-08-24 05:37:18,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 419 transitions. [2023-08-24 05:37:18,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:18,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 419 transitions. [2023-08-24 05:37:18,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:18,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:18,646 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:18,646 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 118 flow. Second operand 6 states and 419 transitions. [2023-08-24 05:37:18,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 52 transitions, 342 flow [2023-08-24 05:37:18,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 52 transitions, 334 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 05:37:18,651 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 162 flow [2023-08-24 05:37:18,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 05:37:18,652 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-08-24 05:37:18,652 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 162 flow [2023-08-24 05:37:18,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.0) internal successors, (320), 5 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:18,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:18,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:18,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:37:18,653 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-24 05:37:18,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1582259359, now seen corresponding path program 1 times [2023-08-24 05:37:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:18,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409990078] [2023-08-24 05:37:18,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:18,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:19,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:19,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:19,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409990078] [2023-08-24 05:37:19,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409990078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:37:19,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71582715] [2023-08-24 05:37:19,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:19,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:37:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:19,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:37:19,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:37:19,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-24 05:37:19,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:19,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-24 05:37:19,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:19,261 INFO L124 PetriNetUnfolderBase]: 218/424 cut-off events. [2023-08-24 05:37:19,261 INFO L125 PetriNetUnfolderBase]: For 936/947 co-relation queries the response was YES. [2023-08-24 05:37:19,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 424 events. 218/424 cut-off events. For 936/947 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1865 event pairs, 80 based on Foata normal form. 37/461 useless extension candidates. Maximal degree in co-relation 1516. Up to 333 conditions per place. [2023-08-24 05:37:19,263 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 31 selfloop transitions, 7 changer transitions 12/52 dead transitions. [2023-08-24 05:37:19,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 385 flow [2023-08-24 05:37:19,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:37:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:37:19,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 441 transitions. [2023-08-24 05:37:19,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4537037037037037 [2023-08-24 05:37:19,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 441 transitions. [2023-08-24 05:37:19,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 441 transitions. [2023-08-24 05:37:19,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:19,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 441 transitions. [2023-08-24 05:37:19,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,268 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,268 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 162 flow. Second operand 6 states and 441 transitions. [2023-08-24 05:37:19,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 385 flow [2023-08-24 05:37:19,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 370 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 05:37:19,271 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 202 flow [2023-08-24 05:37:19,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=202, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-24 05:37:19,272 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 16 predicate places. [2023-08-24 05:37:19,272 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 202 flow [2023-08-24 05:37:19,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:19,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:19,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:37:19,273 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-24 05:37:19,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1395423914, now seen corresponding path program 1 times [2023-08-24 05:37:19,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:19,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686913827] [2023-08-24 05:37:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:19,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:19,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686913827] [2023-08-24 05:37:19,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686913827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:19,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:19,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:19,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650602998] [2023-08-24 05:37:19,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:37:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:19,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:37:19,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:37:19,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 162 [2023-08-24 05:37:19,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:19,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 162 [2023-08-24 05:37:19,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:19,577 INFO L124 PetriNetUnfolderBase]: 213/409 cut-off events. [2023-08-24 05:37:19,578 INFO L125 PetriNetUnfolderBase]: For 1173/1182 co-relation queries the response was YES. [2023-08-24 05:37:19,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 409 events. 213/409 cut-off events. For 1173/1182 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1742 event pairs, 101 based on Foata normal form. 23/432 useless extension candidates. Maximal degree in co-relation 1642. Up to 334 conditions per place. [2023-08-24 05:37:19,580 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 33 selfloop transitions, 8 changer transitions 10/53 dead transitions. [2023-08-24 05:37:19,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 435 flow [2023-08-24 05:37:19,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:37:19,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:37:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 453 transitions. [2023-08-24 05:37:19,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2023-08-24 05:37:19,582 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 453 transitions. [2023-08-24 05:37:19,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 453 transitions. [2023-08-24 05:37:19,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:19,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 453 transitions. [2023-08-24 05:37:19,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,587 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,587 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 202 flow. Second operand 6 states and 453 transitions. [2023-08-24 05:37:19,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 435 flow [2023-08-24 05:37:19,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 416 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-24 05:37:19,591 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 233 flow [2023-08-24 05:37:19,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2023-08-24 05:37:19,594 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 19 predicate places. [2023-08-24 05:37:19,594 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 233 flow [2023-08-24 05:37:19,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.0) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:19,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:19,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:37:19,594 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-24 05:37:19,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1394068904, now seen corresponding path program 2 times [2023-08-24 05:37:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449847108] [2023-08-24 05:37:19,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:19,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:19,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:19,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:19,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449847108] [2023-08-24 05:37:19,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449847108] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:19,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:19,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:37:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885860776] [2023-08-24 05:37:19,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:19,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:37:19,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:19,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:37:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:37:19,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 162 [2023-08-24 05:37:19,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 233 flow. Second operand has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:19,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:19,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 162 [2023-08-24 05:37:19,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:20,042 INFO L124 PetriNetUnfolderBase]: 209/403 cut-off events. [2023-08-24 05:37:20,043 INFO L125 PetriNetUnfolderBase]: For 1509/1518 co-relation queries the response was YES. [2023-08-24 05:37:20,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1745 conditions, 403 events. 209/403 cut-off events. For 1509/1518 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1711 event pairs, 101 based on Foata normal form. 23/426 useless extension candidates. Maximal degree in co-relation 1719. Up to 332 conditions per place. [2023-08-24 05:37:20,045 INFO L140 encePairwiseOnDemand]: 156/162 looper letters, 33 selfloop transitions, 9 changer transitions 11/55 dead transitions. [2023-08-24 05:37:20,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 484 flow [2023-08-24 05:37:20,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:37:20,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:37:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 516 transitions. [2023-08-24 05:37:20,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2023-08-24 05:37:20,048 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 516 transitions. [2023-08-24 05:37:20,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 516 transitions. [2023-08-24 05:37:20,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:20,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 516 transitions. [2023-08-24 05:37:20,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.71428571428571) internal successors, (516), 7 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,051 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 233 flow. Second operand 7 states and 516 transitions. [2023-08-24 05:37:20,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 484 flow [2023-08-24 05:37:20,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 456 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 05:37:20,056 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 262 flow [2023-08-24 05:37:20,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-08-24 05:37:20,058 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2023-08-24 05:37:20,058 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 262 flow [2023-08-24 05:37:20,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.66666666666667) internal successors, (418), 6 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:20,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:20,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:37:20,064 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-24 05:37:20,064 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1805419388, now seen corresponding path program 1 times [2023-08-24 05:37:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973889675] [2023-08-24 05:37:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:20,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:20,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973889675] [2023-08-24 05:37:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973889675] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:20,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:20,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:20,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971870768] [2023-08-24 05:37:20,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:20,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:20,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:20,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 162 [2023-08-24 05:37:20,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 66.57142857142857) internal successors, (466), 7 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:20,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 162 [2023-08-24 05:37:20,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:20,809 INFO L124 PetriNetUnfolderBase]: 238/460 cut-off events. [2023-08-24 05:37:20,809 INFO L125 PetriNetUnfolderBase]: For 2510/2520 co-relation queries the response was YES. [2023-08-24 05:37:20,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2140 conditions, 460 events. 238/460 cut-off events. For 2510/2520 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2052 event pairs, 83 based on Foata normal form. 32/492 useless extension candidates. Maximal degree in co-relation 2111. Up to 327 conditions per place. [2023-08-24 05:37:20,812 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 37 selfloop transitions, 10 changer transitions 14/63 dead transitions. [2023-08-24 05:37:20,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 595 flow [2023-08-24 05:37:20,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:37:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:37:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 496 transitions. [2023-08-24 05:37:20,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43738977072310403 [2023-08-24 05:37:20,814 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 496 transitions. [2023-08-24 05:37:20,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 496 transitions. [2023-08-24 05:37:20,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:20,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 496 transitions. [2023-08-24 05:37:20,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,818 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,818 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 262 flow. Second operand 7 states and 496 transitions. [2023-08-24 05:37:20,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 595 flow [2023-08-24 05:37:20,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 555 flow, removed 17 selfloop flow, removed 4 redundant places. [2023-08-24 05:37:20,823 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 306 flow [2023-08-24 05:37:20,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2023-08-24 05:37:20,824 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 26 predicate places. [2023-08-24 05:37:20,824 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 306 flow [2023-08-24 05:37:20,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 66.57142857142857) internal successors, (466), 7 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:20,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:20,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:20,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:37:20,825 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-24 05:37:20,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:20,825 INFO L85 PathProgramCache]: Analyzing trace with hash 266369552, now seen corresponding path program 2 times [2023-08-24 05:37:20,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:20,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206595088] [2023-08-24 05:37:20,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:20,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206595088] [2023-08-24 05:37:21,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206595088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:21,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:21,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665687712] [2023-08-24 05:37:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:21,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:21,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:21,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:21,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-24 05:37:21,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:21,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-24 05:37:21,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:21,344 INFO L124 PetriNetUnfolderBase]: 221/437 cut-off events. [2023-08-24 05:37:21,344 INFO L125 PetriNetUnfolderBase]: For 2603/2612 co-relation queries the response was YES. [2023-08-24 05:37:21,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2147 conditions, 437 events. 221/437 cut-off events. For 2603/2612 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1963 event pairs, 65 based on Foata normal form. 24/461 useless extension candidates. Maximal degree in co-relation 2117. Up to 298 conditions per place. [2023-08-24 05:37:21,347 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 32 selfloop transitions, 12 changer transitions 22/68 dead transitions. [2023-08-24 05:37:21,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 679 flow [2023-08-24 05:37:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:37:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:37:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 586 transitions. [2023-08-24 05:37:21,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4521604938271605 [2023-08-24 05:37:21,349 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 586 transitions. [2023-08-24 05:37:21,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 586 transitions. [2023-08-24 05:37:21,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:21,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 586 transitions. [2023-08-24 05:37:21,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 73.25) internal successors, (586), 8 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,353 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 162.0) internal successors, (1458), 9 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,353 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 306 flow. Second operand 8 states and 586 transitions. [2023-08-24 05:37:21,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 679 flow [2023-08-24 05:37:21,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 659 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-24 05:37:21,360 INFO L231 Difference]: Finished difference. Result has 59 places, 35 transitions, 346 flow [2023-08-24 05:37:21,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=346, PETRI_PLACES=59, PETRI_TRANSITIONS=35} [2023-08-24 05:37:21,361 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 33 predicate places. [2023-08-24 05:37:21,361 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 35 transitions, 346 flow [2023-08-24 05:37:21,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 68.57142857142857) internal successors, (480), 7 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:21,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:21,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:37:21,362 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-24 05:37:21,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:21,362 INFO L85 PathProgramCache]: Analyzing trace with hash 417742582, now seen corresponding path program 1 times [2023-08-24 05:37:21,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:21,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035520779] [2023-08-24 05:37:21,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035520779] [2023-08-24 05:37:21,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035520779] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:21,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:21,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:37:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214259538] [2023-08-24 05:37:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:21,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:37:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:37:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:37:21,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-08-24 05:37:21,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 35 transitions, 346 flow. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:21,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-08-24 05:37:21,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:21,508 INFO L124 PetriNetUnfolderBase]: 54/145 cut-off events. [2023-08-24 05:37:21,508 INFO L125 PetriNetUnfolderBase]: For 1301/1312 co-relation queries the response was YES. [2023-08-24 05:37:21,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 145 events. 54/145 cut-off events. For 1301/1312 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 528 event pairs, 19 based on Foata normal form. 23/167 useless extension candidates. Maximal degree in co-relation 804. Up to 102 conditions per place. [2023-08-24 05:37:21,509 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 31 selfloop transitions, 3 changer transitions 2/41 dead transitions. [2023-08-24 05:37:21,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 41 transitions, 476 flow [2023-08-24 05:37:21,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:37:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:37:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2023-08-24 05:37:21,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835390946502058 [2023-08-24 05:37:21,510 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 235 transitions. [2023-08-24 05:37:21,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 235 transitions. [2023-08-24 05:37:21,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:21,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 235 transitions. [2023-08-24 05:37:21,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-24 05:37:21,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,513 INFO L175 Difference]: Start difference. First operand has 59 places, 35 transitions, 346 flow. Second operand 3 states and 235 transitions. [2023-08-24 05:37:21,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 41 transitions, 476 flow [2023-08-24 05:37:21,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 398 flow, removed 23 selfloop flow, removed 13 redundant places. [2023-08-24 05:37:21,516 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 266 flow [2023-08-24 05:37:21,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-24 05:37:21,517 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2023-08-24 05:37:21,517 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 266 flow [2023-08-24 05:37:21,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:21,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:21,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:37:21,517 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-24 05:37:21,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:21,518 INFO L85 PathProgramCache]: Analyzing trace with hash 197603184, now seen corresponding path program 1 times [2023-08-24 05:37:21,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:21,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101022967] [2023-08-24 05:37:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:21,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:21,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:21,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101022967] [2023-08-24 05:37:21,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101022967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:21,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:37:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450244163] [2023-08-24 05:37:21,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:21,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:37:21,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:21,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:37:21,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:37:21,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 162 [2023-08-24 05:37:21,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 266 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-24 05:37:21,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:21,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 162 [2023-08-24 05:37:21,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:21,709 INFO L124 PetriNetUnfolderBase]: 20/70 cut-off events. [2023-08-24 05:37:21,709 INFO L125 PetriNetUnfolderBase]: For 305/308 co-relation queries the response was YES. [2023-08-24 05:37:21,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 70 events. 20/70 cut-off events. For 305/308 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 197 event pairs, 4 based on Foata normal form. 13/82 useless extension candidates. Maximal degree in co-relation 333. Up to 31 conditions per place. [2023-08-24 05:37:21,710 INFO L140 encePairwiseOnDemand]: 158/162 looper letters, 23 selfloop transitions, 5 changer transitions 9/40 dead transitions. [2023-08-24 05:37:21,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 406 flow [2023-08-24 05:37:21,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:37:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:37:21,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 306 transitions. [2023-08-24 05:37:21,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-08-24 05:37:21,712 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 306 transitions. [2023-08-24 05:37:21,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 306 transitions. [2023-08-24 05:37:21,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:21,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 306 transitions. [2023-08-24 05:37:21,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,714 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 162.0) internal successors, (810), 5 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:21,714 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 266 flow. Second operand 4 states and 306 transitions. [2023-08-24 05:37:21,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 406 flow [2023-08-24 05:37:21,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 343 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-08-24 05:37:21,716 INFO L231 Difference]: Finished difference. Result has 46 places, 25 transitions, 175 flow [2023-08-24 05:37:21,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=46, PETRI_TRANSITIONS=25} [2023-08-24 05:37:21,717 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 20 predicate places. [2023-08-24 05:37:21,717 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 25 transitions, 175 flow [2023-08-24 05:37:21,717 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-24 05:37:21,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:21,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:21,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:37:21,718 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-24 05:37:21,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:21,718 INFO L85 PathProgramCache]: Analyzing trace with hash -440561854, now seen corresponding path program 1 times [2023-08-24 05:37:21,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:21,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460672169] [2023-08-24 05:37:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:21,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:37:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:37:22,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:37:22,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460672169] [2023-08-24 05:37:22,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460672169] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:37:22,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:37:22,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:37:22,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096815583] [2023-08-24 05:37:22,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:37:22,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:37:22,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:37:22,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:37:22,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:37:22,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 162 [2023-08-24 05:37:22,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 25 transitions, 175 flow. Second operand has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:22,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:37:22,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 162 [2023-08-24 05:37:22,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:37:22,274 INFO L124 PetriNetUnfolderBase]: 15/56 cut-off events. [2023-08-24 05:37:22,274 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-24 05:37:22,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 56 events. 15/56 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 104 event pairs, 2 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 236. Up to 34 conditions per place. [2023-08-24 05:37:22,275 INFO L140 encePairwiseOnDemand]: 155/162 looper letters, 16 selfloop transitions, 6 changer transitions 12/35 dead transitions. [2023-08-24 05:37:22,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 35 transitions, 296 flow [2023-08-24 05:37:22,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:37:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:37:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 496 transitions. [2023-08-24 05:37:22,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43738977072310403 [2023-08-24 05:37:22,278 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 496 transitions. [2023-08-24 05:37:22,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 496 transitions. [2023-08-24 05:37:22,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:37:22,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 496 transitions. [2023-08-24 05:37:22,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 70.85714285714286) internal successors, (496), 7 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:22,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:22,281 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 162.0) internal successors, (1296), 8 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:22,281 INFO L175 Difference]: Start difference. First operand has 46 places, 25 transitions, 175 flow. Second operand 7 states and 496 transitions. [2023-08-24 05:37:22,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 35 transitions, 296 flow [2023-08-24 05:37:22,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 240 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-08-24 05:37:22,283 INFO L231 Difference]: Finished difference. Result has 43 places, 20 transitions, 114 flow [2023-08-24 05:37:22,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=162, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=114, PETRI_PLACES=43, PETRI_TRANSITIONS=20} [2023-08-24 05:37:22,283 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-08-24 05:37:22,283 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 20 transitions, 114 flow [2023-08-24 05:37:22,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 69.14285714285714) internal successors, (484), 7 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:37:22,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:37:22,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:22,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:37:22,284 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-24 05:37:22,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:37:22,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1757007780, now seen corresponding path program 2 times [2023-08-24 05:37:22,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:37:22,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094925888] [2023-08-24 05:37:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:37:22,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:37:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:22,318 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:37:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:37:22,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:37:22,361 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:37:22,362 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 05:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:37:22,363 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 05:37:22,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 05:37:22,364 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:37:22,368 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:37:22,368 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:37:22,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:37:22 BasicIcfg [2023-08-24 05:37:22,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:37:22,402 INFO L158 Benchmark]: Toolchain (without parser) took 10637.14ms. Allocated memory was 362.8MB in the beginning and 587.2MB in the end (delta: 224.4MB). Free memory was 335.8MB in the beginning and 310.8MB in the end (delta: 25.0MB). Peak memory consumption was 251.3MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,402 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 338.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:37:22,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.58ms. Allocated memory is still 362.8MB. Free memory was 335.8MB in the beginning and 313.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.95ms. Allocated memory is still 362.8MB. Free memory was 313.2MB in the beginning and 310.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,403 INFO L158 Benchmark]: Boogie Preprocessor took 46.83ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 309.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,403 INFO L158 Benchmark]: RCFGBuilder took 526.83ms. Allocated memory was 362.8MB in the beginning and 488.6MB in the end (delta: 125.8MB). Free memory was 308.6MB in the beginning and 446.2MB in the end (delta: -137.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,404 INFO L158 Benchmark]: TraceAbstraction took 9531.16ms. Allocated memory was 488.6MB in the beginning and 587.2MB in the end (delta: 98.6MB). Free memory was 445.3MB in the beginning and 310.8MB in the end (delta: 134.5MB). Peak memory consumption was 232.9MB. Max. memory is 16.0GB. [2023-08-24 05:37:22,405 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 362.8MB. Free memory is still 338.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 455.58ms. Allocated memory is still 362.8MB. Free memory was 335.8MB in the beginning and 313.2MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 69.95ms. Allocated memory is still 362.8MB. Free memory was 313.2MB in the beginning and 310.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 46.83ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 309.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 526.83ms. Allocated memory was 362.8MB in the beginning and 488.6MB in the end (delta: 125.8MB). Free memory was 308.6MB in the beginning and 446.2MB in the end (delta: -137.6MB). Peak memory consumption was 20.5MB. Max. memory is 16.0GB. * TraceAbstraction took 9531.16ms. Allocated memory was 488.6MB in the beginning and 587.2MB in the end (delta: 98.6MB). Free memory was 445.3MB in the beginning and 310.8MB in the end (delta: 134.5MB). Peak memory consumption was 232.9MB. 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: 2.8s, 89 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 20 TransitionsAfterwards, 1034 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2756 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1130, independent: 1006, independent conditional: 0, independent unconditional: 1006, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 555, independent: 533, independent conditional: 0, independent unconditional: 533, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1130, independent: 473, independent conditional: 0, independent unconditional: 473, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 555, unknown conditional: 0, unknown unconditional: 555] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 30, Positive conditional cache size: 0, Positive unconditional cache size: 30, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, 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; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2473, ((void *)0), P0, ((void *)0))=-2, t2473={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] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2474, ((void *)0), P1, ((void *)0))=-1, t2473={5:0}, t2474={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=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] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=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] [L748] 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) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 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 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L768] 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) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 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 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 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) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473={5:0}, t2474={3: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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L821] 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, 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: 793]: 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: 791]: 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, 104 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: 9.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 184 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 22 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=9, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 111 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:37:22,424 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...