/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 00:20:32,091 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 00:20:32,173 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 00:20:32,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 00:20:32,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 00:20:32,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 00:20:32,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 00:20:32,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 00:20:32,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 00:20:32,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 00:20:32,221 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 00:20:32,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 00:20:32,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 00:20:32,222 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 00:20:32,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 00:20:32,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 00:20:32,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 00:20:32,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 00:20:32,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 00:20:32,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 00:20:32,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 00:20:32,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 00:20:32,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 00:20:32,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 00:20:32,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 00:20:32,226 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 00:20:32,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 00:20:32,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:20:32,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 00:20:32,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 00:20:32,228 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 00:20:32,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 00:20:32,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 00:20:32,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 00:20:32,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 00:20:32,229 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-24 00:20:32,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 00:20:32,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 00:20:32,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 00:20:32,563 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 00:20:32,564 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 00:20:32,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-24 00:20:33,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 00:20:34,010 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 00:20:34,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-24 00:20:34,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60ab5f1f/b6ddeb0a855048e993d12e4a4d3b436d/FLAG3f284ce99 [2023-08-24 00:20:34,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60ab5f1f/b6ddeb0a855048e993d12e4a4d3b436d [2023-08-24 00:20:34,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 00:20:34,052 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 00:20:34,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 00:20:34,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 00:20:34,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 00:20:34,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c9f86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34, skipping insertion in model container [2023-08-24 00:20:34,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,109 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 00:20:34,270 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-08-24 00:20:34,430 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:20:34,445 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 00:20:34,457 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i[1092,1105] [2023-08-24 00:20:34,474 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-24 00:20:34,477 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-08-24 00:20:34,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:20:34,533 INFO L206 MainTranslator]: Completed translation [2023-08-24 00:20:34,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34 WrapperNode [2023-08-24 00:20:34,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 00:20:34,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 00:20:34,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 00:20:34,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 00:20:34,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,589 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2023-08-24 00:20:34,589 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 00:20:34,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 00:20:34,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 00:20:34,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 00:20:34,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,619 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 00:20:34,627 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 00:20:34,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 00:20:34,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 00:20:34,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (1/1) ... [2023-08-24 00:20:34,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:20:34,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:20:34,673 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 00:20:34,688 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 00:20:34,710 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-24 00:20:34,710 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-08-24 00:20:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-08-24 00:20:34,711 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 00:20:34,711 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 00:20:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 00:20:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 00:20:34,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 00:20:34,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 00:20:34,713 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 00:20:34,839 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 00:20:34,841 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 00:20:35,027 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 00:20:35,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 00:20:35,037 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 00:20:35,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:20:35 BoogieIcfgContainer [2023-08-24 00:20:35,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 00:20:35,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 00:20:35,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 00:20:35,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 00:20:35,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:20:34" (1/3) ... [2023-08-24 00:20:35,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:20:35, skipping insertion in model container [2023-08-24 00:20:35,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:20:34" (2/3) ... [2023-08-24 00:20:35,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@546c252b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:20:35, skipping insertion in model container [2023-08-24 00:20:35,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:20:35" (3/3) ... [2023-08-24 00:20:35,046 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-08-24 00:20:35,064 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 00:20:35,064 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-24 00:20:35,065 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 00:20:35,181 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 00:20:35,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 339 flow [2023-08-24 00:20:35,377 INFO L124 PetriNetUnfolderBase]: 5/159 cut-off events. [2023-08-24 00:20:35,377 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 00:20:35,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 5/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 261 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-08-24 00:20:35,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 339 flow [2023-08-24 00:20:35,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 159 transitions, 327 flow [2023-08-24 00:20:35,395 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 00:20:35,407 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 159 transitions, 327 flow [2023-08-24 00:20:35,410 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 159 transitions, 327 flow [2023-08-24 00:20:35,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 159 transitions, 327 flow [2023-08-24 00:20:35,472 INFO L124 PetriNetUnfolderBase]: 5/159 cut-off events. [2023-08-24 00:20:35,472 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 00:20:35,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 159 events. 5/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 261 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 123. Up to 2 conditions per place. [2023-08-24 00:20:35,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 9270 [2023-08-24 00:20:40,311 INFO L134 LiptonReduction]: Checked pairs total: 20940 [2023-08-24 00:20:40,311 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-24 00:20:40,323 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 00:20:40,329 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;@4604c13e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 00:20:40,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-24 00:20:40,334 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 00:20:40,334 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-24 00:20:40,334 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 00:20:40,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:40,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:40,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:40,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -227316659, now seen corresponding path program 1 times [2023-08-24 00:20:40,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:40,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279022334] [2023-08-24 00:20:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:40,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:40,817 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 00:20:40,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:40,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279022334] [2023-08-24 00:20:40,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279022334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:40,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:40,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:20:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698278957] [2023-08-24 00:20:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:40,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:20:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:40,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:20:40,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:20:40,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 313 [2023-08-24 00:20:40,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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 00:20:40,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:40,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 313 [2023-08-24 00:20:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:42,001 INFO L124 PetriNetUnfolderBase]: 7003/10637 cut-off events. [2023-08-24 00:20:42,001 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-24 00:20:42,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20691 conditions, 10637 events. 7003/10637 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 68687 event pairs, 1327 based on Foata normal form. 315/8875 useless extension candidates. Maximal degree in co-relation 20680. Up to 4467 conditions per place. [2023-08-24 00:20:42,079 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 137 selfloop transitions, 10 changer transitions 0/154 dead transitions. [2023-08-24 00:20:42,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 154 transitions, 632 flow [2023-08-24 00:20:42,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 00:20:42,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 00:20:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2023-08-24 00:20:42,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003993610223643 [2023-08-24 00:20:42,099 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2023-08-24 00:20:42,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2023-08-24 00:20:42,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:42,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2023-08-24 00:20:42,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 156.625) internal successors, (1253), 8 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states 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 00:20:42,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:42,122 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:42,123 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 8 states and 1253 transitions. [2023-08-24 00:20:42,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 154 transitions, 632 flow [2023-08-24 00:20:42,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 154 transitions, 622 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 00:20:42,131 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 151 flow [2023-08-24 00:20:42,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-24 00:20:42,136 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2023-08-24 00:20:42,137 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 151 flow [2023-08-24 00:20:42,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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 00:20:42,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:42,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:42,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 00:20:42,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:42,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 195691478, now seen corresponding path program 1 times [2023-08-24 00:20:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012894692] [2023-08-24 00:20:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:42,347 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 00:20:42,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:42,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012894692] [2023-08-24 00:20:42,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012894692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:42,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:42,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:20:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551672643] [2023-08-24 00:20:42,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:42,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:20:42,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:42,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:20:42,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:20:42,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 313 [2023-08-24 00:20:42,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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 00:20:42,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:42,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 313 [2023-08-24 00:20:42,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:43,463 INFO L124 PetriNetUnfolderBase]: 7396/11581 cut-off events. [2023-08-24 00:20:43,463 INFO L125 PetriNetUnfolderBase]: For 6076/6076 co-relation queries the response was YES. [2023-08-24 00:20:43,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27633 conditions, 11581 events. 7396/11581 cut-off events. For 6076/6076 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 77108 event pairs, 1674 based on Foata normal form. 0/10089 useless extension candidates. Maximal degree in co-relation 27617. Up to 4462 conditions per place. [2023-08-24 00:20:43,560 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 122 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2023-08-24 00:20:43,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 149 transitions, 781 flow [2023-08-24 00:20:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 00:20:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 00:20:43,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1206 transitions. [2023-08-24 00:20:43,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481629392971246 [2023-08-24 00:20:43,565 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1206 transitions. [2023-08-24 00:20:43,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1206 transitions. [2023-08-24 00:20:43,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:43,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1206 transitions. [2023-08-24 00:20:43,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.75) internal successors, (1206), 8 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 00:20:43,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:43,573 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:43,573 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 151 flow. Second operand 8 states and 1206 transitions. [2023-08-24 00:20:43,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 149 transitions, 781 flow [2023-08-24 00:20:43,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 149 transitions, 781 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 00:20:43,652 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 326 flow [2023-08-24 00:20:43,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=326, PETRI_PLACES=69, PETRI_TRANSITIONS=61} [2023-08-24 00:20:43,654 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2023-08-24 00:20:43,654 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 326 flow [2023-08-24 00:20:43,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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 00:20:43,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:43,656 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:43,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 00:20:43,659 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:43,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:43,666 INFO L85 PathProgramCache]: Analyzing trace with hash 442248688, now seen corresponding path program 1 times [2023-08-24 00:20:43,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:43,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941251881] [2023-08-24 00:20:43,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:43,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:43,756 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 00:20:43,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:43,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941251881] [2023-08-24 00:20:43,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941251881] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:43,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:43,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:20:43,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591677262] [2023-08-24 00:20:43,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:43,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 00:20:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:43,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 00:20:43,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 00:20:43,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 313 [2023-08-24 00:20:43,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 61 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:20:43,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:43,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 313 [2023-08-24 00:20:43,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:44,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,220 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,221 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,221 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,262 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), Black: 188#true, 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,262 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), 50#L736true, Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,263 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,263 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,264 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,264 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 00:20:44,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,267 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,267 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,267 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,267 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,268 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,268 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,268 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,268 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,302 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,303 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,303 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,303 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,303 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,303 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,303 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, 34#L737true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,303 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,304 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,304 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,304 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,304 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 00:20:44,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,307 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,307 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,307 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,307 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,308 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,308 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,308 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,308 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,342 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [161#t2_funEXITtrue, t2_funThread1of1ForFork2InUse, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 57#t3_funEXITtrue, 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0))]) [2023-08-24 00:20:44,342 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,342 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,342 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([410] L693-->L694: Formula: (= |v_#pthreadsMutex_25| (store |v_#pthreadsMutex_26| |v_~#A~0.base_14| (store (select |v_#pthreadsMutex_26| |v_~#A~0.base_14|) |v_~#A~0.offset_14| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_26|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_25|, ~#A~0.offset=|v_~#A~0.offset_14|, ~#A~0.base=|v_~#A~0.base_14|} AuxVars[] AssignedVars[#pthreadsMutex][64], [t2_funThread1of1ForFork2InUse, 161#t2_funEXITtrue, 2#ULTIMATE.startEXITtrue, t_funThread1of1ForFork1InUse, Black: 190#(and (<= ~g~0 ~h~0) (<= ~h~0 ~g~0)), t3_funThread1of1ForFork0InUse, 192#(and (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 191#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|)), Black: 198#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 196#(and (<= |ULTIMATE.start_main_~x~3#1| ~h~0) (<= ~g~0 ~h~0) (<= ~h~0 ~g~0) (<= ~h~0 |ULTIMATE.start_main_~x~3#1|) (< |ULTIMATE.start_main_~y~2#1| (+ |ULTIMATE.start_main_~x~3#1| 1)) (<= |ULTIMATE.start_main_~x~3#1| |ULTIMATE.start_main_~y~2#1|)), Black: 188#true, 174#(<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|), 17#L694true, Black: 170#true, Black: 172#(<= ~h~0 ~g~0), Black: 180#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|)), Black: 173#(<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|), 206#true, Black: 178#(and (<= |t2_funThread1of1ForFork2_~y~0#1| |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 |t2_funThread1of1ForFork2_~x~1#1|) (<= ~h~0 ~g~0)), 68#t3_funErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue]) [2023-08-24 00:20:44,343 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,343 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,344 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 00:20:44,398 INFO L124 PetriNetUnfolderBase]: 3637/6796 cut-off events. [2023-08-24 00:20:44,399 INFO L125 PetriNetUnfolderBase]: For 6478/6790 co-relation queries the response was YES. [2023-08-24 00:20:44,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17685 conditions, 6796 events. 3637/6796 cut-off events. For 6478/6790 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 51709 event pairs, 1607 based on Foata normal form. 792/7002 useless extension candidates. Maximal degree in co-relation 17661. Up to 3854 conditions per place. [2023-08-24 00:20:44,450 INFO L140 encePairwiseOnDemand]: 298/313 looper letters, 52 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2023-08-24 00:20:44,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 569 flow [2023-08-24 00:20:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 00:20:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 00:20:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-24 00:20:44,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739084132055378 [2023-08-24 00:20:44,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-24 00:20:44,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-24 00:20:44,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:44,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-24 00:20:44,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states 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 00:20:44,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 00:20:44,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states 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 00:20:44,456 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 326 flow. Second operand 3 states and 445 transitions. [2023-08-24 00:20:44,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 569 flow [2023-08-24 00:20:44,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 88 transitions, 565 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 00:20:44,502 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 408 flow [2023-08-24 00:20:44,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2023-08-24 00:20:44,503 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2023-08-24 00:20:44,503 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 408 flow [2023-08-24 00:20:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:20:44,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:44,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 00:20:44,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:44,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:44,504 INFO L85 PathProgramCache]: Analyzing trace with hash 799830391, now seen corresponding path program 1 times [2023-08-24 00:20:44,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:44,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100036838] [2023-08-24 00:20:44,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:44,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:44,632 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 00:20:44,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:44,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100036838] [2023-08-24 00:20:44,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100036838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:44,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:44,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:20:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775375761] [2023-08-24 00:20:44,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:44,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:20:44,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:20:44,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:20:44,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 313 [2023-08-24 00:20:44,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 00:20:44,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:44,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 313 [2023-08-24 00:20:44,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:45,486 INFO L124 PetriNetUnfolderBase]: 5146/8797 cut-off events. [2023-08-24 00:20:45,486 INFO L125 PetriNetUnfolderBase]: For 10117/10170 co-relation queries the response was YES. [2023-08-24 00:20:45,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28681 conditions, 8797 events. 5146/8797 cut-off events. For 10117/10170 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 59191 event pairs, 1961 based on Foata normal form. 47/8288 useless extension candidates. Maximal degree in co-relation 28655. Up to 3597 conditions per place. [2023-08-24 00:20:45,555 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 118 selfloop transitions, 31 changer transitions 5/166 dead transitions. [2023-08-24 00:20:45,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 1254 flow [2023-08-24 00:20:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 00:20:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 00:20:45,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1202 transitions. [2023-08-24 00:20:45,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48003194888178913 [2023-08-24 00:20:45,559 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1202 transitions. [2023-08-24 00:20:45,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1202 transitions. [2023-08-24 00:20:45,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:45,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1202 transitions. [2023-08-24 00:20:45,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 150.25) internal successors, (1202), 8 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states 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 00:20:45,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:45,567 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 313.0) internal successors, (2817), 9 states have internal predecessors, (2817), 0 states have call successors, (0), 0 states 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 00:20:45,567 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 408 flow. Second operand 8 states and 1202 transitions. [2023-08-24 00:20:45,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 1254 flow [2023-08-24 00:20:45,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 166 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 00:20:45,622 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 697 flow [2023-08-24 00:20:45,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=697, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2023-08-24 00:20:45,623 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2023-08-24 00:20:45,623 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 697 flow [2023-08-24 00:20:45,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 00:20:45,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:45,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:45,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 00:20:45,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:45,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1492423791, now seen corresponding path program 1 times [2023-08-24 00:20:45,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:45,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668799473] [2023-08-24 00:20:45,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:45,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:45,700 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 00:20:45,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:45,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668799473] [2023-08-24 00:20:45,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668799473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:45,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:45,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 00:20:45,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967622523] [2023-08-24 00:20:45,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:45,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:20:45,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:45,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:20:45,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:20:45,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 00:20:45,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 89 transitions, 697 flow. Second operand has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 00:20:45,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:45,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 00:20:45,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:46,854 INFO L124 PetriNetUnfolderBase]: 5750/9982 cut-off events. [2023-08-24 00:20:46,854 INFO L125 PetriNetUnfolderBase]: For 20264/20387 co-relation queries the response was YES. [2023-08-24 00:20:46,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33350 conditions, 9982 events. 5750/9982 cut-off events. For 20264/20387 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 70857 event pairs, 2097 based on Foata normal form. 285/10005 useless extension candidates. Maximal degree in co-relation 33317. Up to 4218 conditions per place. [2023-08-24 00:20:46,915 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 156 selfloop transitions, 35 changer transitions 1/204 dead transitions. [2023-08-24 00:20:46,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 1661 flow [2023-08-24 00:20:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 00:20:46,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 00:20:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1062 transitions. [2023-08-24 00:20:46,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847101780009128 [2023-08-24 00:20:46,918 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1062 transitions. [2023-08-24 00:20:46,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1062 transitions. [2023-08-24 00:20:46,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:46,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1062 transitions. [2023-08-24 00:20:46,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.71428571428572) internal successors, (1062), 7 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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 00:20:46,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states 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 00:20:46,924 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states 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 00:20:46,924 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 697 flow. Second operand 7 states and 1062 transitions. [2023-08-24 00:20:46,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 1661 flow [2023-08-24 00:20:47,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 204 transitions, 1655 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-24 00:20:47,134 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 808 flow [2023-08-24 00:20:47,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=94, PETRI_TRANSITIONS=93} [2023-08-24 00:20:47,136 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2023-08-24 00:20:47,136 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 808 flow [2023-08-24 00:20:47,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.83333333333334) internal successors, (815), 6 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 00:20:47,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:47,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:47,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 00:20:47,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:47,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash -546670984, now seen corresponding path program 1 times [2023-08-24 00:20:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510594281] [2023-08-24 00:20:47,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:47,304 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 00:20:47,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:47,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510594281] [2023-08-24 00:20:47,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510594281] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:47,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:47,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:20:47,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699677404] [2023-08-24 00:20:47,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:47,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:20:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:47,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:20:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:20:47,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 313 [2023-08-24 00:20:47,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 93 transitions, 808 flow. Second operand has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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 00:20:47,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:47,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 313 [2023-08-24 00:20:47,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:47,601 INFO L124 PetriNetUnfolderBase]: 1305/2906 cut-off events. [2023-08-24 00:20:47,601 INFO L125 PetriNetUnfolderBase]: For 8670/8988 co-relation queries the response was YES. [2023-08-24 00:20:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10591 conditions, 2906 events. 1305/2906 cut-off events. For 8670/8988 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 21509 event pairs, 229 based on Foata normal form. 538/3330 useless extension candidates. Maximal degree in co-relation 10553. Up to 1804 conditions per place. [2023-08-24 00:20:47,619 INFO L140 encePairwiseOnDemand]: 303/313 looper letters, 55 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2023-08-24 00:20:47,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 978 flow [2023-08-24 00:20:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 00:20:47,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 00:20:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-24 00:20:47,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42971246006389774 [2023-08-24 00:20:47,622 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-24 00:20:47,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-24 00:20:47,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:47,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-24 00:20:47,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states 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 00:20:47,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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 00:20:47,626 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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 00:20:47,626 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 808 flow. Second operand 4 states and 538 transitions. [2023-08-24 00:20:47,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 978 flow [2023-08-24 00:20:47,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 104 transitions, 913 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-24 00:20:47,705 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 678 flow [2023-08-24 00:20:47,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=675, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=678, PETRI_PLACES=92, PETRI_TRANSITIONS=85} [2023-08-24 00:20:47,705 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-08-24 00:20:47,705 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 678 flow [2023-08-24 00:20:47,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states 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 00:20:47,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:47,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:47,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 00:20:47,706 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:47,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:47,707 INFO L85 PathProgramCache]: Analyzing trace with hash 396316053, now seen corresponding path program 1 times [2023-08-24 00:20:47,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:47,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824749222] [2023-08-24 00:20:47,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:47,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:47,803 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 00:20:47,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:47,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824749222] [2023-08-24 00:20:47,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824749222] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:47,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:47,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 00:20:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551892270] [2023-08-24 00:20:47,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:47,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:20:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:47,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:20:47,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:20:47,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 00:20:47,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 85 transitions, 678 flow. Second operand has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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 00:20:47,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:47,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 00:20:47,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:48,356 INFO L124 PetriNetUnfolderBase]: 1764/3686 cut-off events. [2023-08-24 00:20:48,356 INFO L125 PetriNetUnfolderBase]: For 9416/9521 co-relation queries the response was YES. [2023-08-24 00:20:48,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13500 conditions, 3686 events. 1764/3686 cut-off events. For 9416/9521 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 26834 event pairs, 342 based on Foata normal form. 193/3824 useless extension candidates. Maximal degree in co-relation 13463. Up to 1301 conditions per place. [2023-08-24 00:20:48,382 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 163 selfloop transitions, 39 changer transitions 12/226 dead transitions. [2023-08-24 00:20:48,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 226 transitions, 1854 flow [2023-08-24 00:20:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 00:20:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 00:20:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1904 transitions. [2023-08-24 00:20:48,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467928237896289 [2023-08-24 00:20:48,388 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1904 transitions. [2023-08-24 00:20:48,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1904 transitions. [2023-08-24 00:20:48,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:48,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1904 transitions. [2023-08-24 00:20:48,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 146.46153846153845) internal successors, (1904), 13 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states 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 00:20:48,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 313.0) internal successors, (4382), 14 states have internal predecessors, (4382), 0 states have call successors, (0), 0 states 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 00:20:48,440 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 313.0) internal successors, (4382), 14 states have internal predecessors, (4382), 0 states have call successors, (0), 0 states 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 00:20:48,440 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 678 flow. Second operand 13 states and 1904 transitions. [2023-08-24 00:20:48,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 226 transitions, 1854 flow [2023-08-24 00:20:48,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 226 transitions, 1781 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 00:20:48,482 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 844 flow [2023-08-24 00:20:48,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=844, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2023-08-24 00:20:48,482 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-08-24 00:20:48,483 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 844 flow [2023-08-24 00:20:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 states 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 00:20:48,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:48,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:48,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 00:20:48,484 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:48,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1974240727, now seen corresponding path program 1 times [2023-08-24 00:20:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:48,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182953145] [2023-08-24 00:20:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:48,656 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 00:20:48,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:48,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182953145] [2023-08-24 00:20:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182953145] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:48,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 00:20:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951391919] [2023-08-24 00:20:48,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:48,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 00:20:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 00:20:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 00:20:48,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 313 [2023-08-24 00:20:48,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 844 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states 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 00:20:48,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:48,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 313 [2023-08-24 00:20:48,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:48,846 INFO L124 PetriNetUnfolderBase]: 297/1077 cut-off events. [2023-08-24 00:20:48,846 INFO L125 PetriNetUnfolderBase]: For 2194/2308 co-relation queries the response was YES. [2023-08-24 00:20:48,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1077 events. 297/1077 cut-off events. For 2194/2308 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 7726 event pairs, 119 based on Foata normal form. 57/1119 useless extension candidates. Maximal degree in co-relation 3734. Up to 480 conditions per place. [2023-08-24 00:20:48,851 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 37 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2023-08-24 00:20:48,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 73 transitions, 661 flow [2023-08-24 00:20:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 00:20:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 00:20:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-24 00:20:48,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.426517571884984 [2023-08-24 00:20:48,854 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-24 00:20:48,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-24 00:20:48,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:48,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-24 00:20:48,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states 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 00:20:48,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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 00:20:48,858 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states 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 00:20:48,859 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 844 flow. Second operand 4 states and 534 transitions. [2023-08-24 00:20:48,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 73 transitions, 661 flow [2023-08-24 00:20:48,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 73 transitions, 534 flow, removed 18 selfloop flow, removed 21 redundant places. [2023-08-24 00:20:48,870 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 414 flow [2023-08-24 00:20:48,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-08-24 00:20:48,871 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2023-08-24 00:20:48,871 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 414 flow [2023-08-24 00:20:48,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states 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 00:20:48,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:48,871 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:48,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 00:20:48,872 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:48,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1373040322, now seen corresponding path program 1 times [2023-08-24 00:20:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440632829] [2023-08-24 00:20:48,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:48,996 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 00:20:48,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:48,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440632829] [2023-08-24 00:20:48,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440632829] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:48,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:48,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 00:20:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605851685] [2023-08-24 00:20:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:20:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:48,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:20:48,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:20:48,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 313 [2023-08-24 00:20:48,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 414 flow. Second operand has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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 00:20:49,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:49,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 313 [2023-08-24 00:20:49,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:49,421 INFO L124 PetriNetUnfolderBase]: 514/1413 cut-off events. [2023-08-24 00:20:49,421 INFO L125 PetriNetUnfolderBase]: For 1390/1394 co-relation queries the response was YES. [2023-08-24 00:20:49,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 1413 events. 514/1413 cut-off events. For 1390/1394 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9132 event pairs, 223 based on Foata normal form. 24/1427 useless extension candidates. Maximal degree in co-relation 4713. Up to 359 conditions per place. [2023-08-24 00:20:49,427 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 83 selfloop transitions, 15 changer transitions 33/139 dead transitions. [2023-08-24 00:20:49,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1067 flow [2023-08-24 00:20:49,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 00:20:49,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 00:20:49,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1691 transitions. [2023-08-24 00:20:49,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502129925452609 [2023-08-24 00:20:49,434 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1691 transitions. [2023-08-24 00:20:49,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1691 transitions. [2023-08-24 00:20:49,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:49,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1691 transitions. [2023-08-24 00:20:49,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 140.91666666666666) internal successors, (1691), 12 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states 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 00:20:49,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 313.0) internal successors, (4069), 13 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states 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 00:20:49,448 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 313.0) internal successors, (4069), 13 states have internal predecessors, (4069), 0 states have call successors, (0), 0 states 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 00:20:49,448 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 414 flow. Second operand 12 states and 1691 transitions. [2023-08-24 00:20:49,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1067 flow [2023-08-24 00:20:49,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 139 transitions, 1022 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-24 00:20:49,456 INFO L231 Difference]: Finished difference. Result has 90 places, 54 transitions, 335 flow [2023-08-24 00:20:49,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=335, PETRI_PLACES=90, PETRI_TRANSITIONS=54} [2023-08-24 00:20:49,457 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-08-24 00:20:49,457 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 54 transitions, 335 flow [2023-08-24 00:20:49,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.5) internal successors, (807), 6 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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 00:20:49,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:20:49,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:49,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 00:20:49,459 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-24 00:20:49,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:20:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2055360479, now seen corresponding path program 1 times [2023-08-24 00:20:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:20:49,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911527883] [2023-08-24 00:20:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:20:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:20:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:20:49,626 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 00:20:49,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:20:49,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911527883] [2023-08-24 00:20:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911527883] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:20:49,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:20:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 00:20:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815043206] [2023-08-24 00:20:49,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:20:49,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:20:49,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:20:49,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:20:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:20:49,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 00:20:49,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 54 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:20:49,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:20:49,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 00:20:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:20:49,865 INFO L124 PetriNetUnfolderBase]: 305/844 cut-off events. [2023-08-24 00:20:49,865 INFO L125 PetriNetUnfolderBase]: For 934/938 co-relation queries the response was YES. [2023-08-24 00:20:49,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 844 events. 305/844 cut-off events. For 934/938 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4659 event pairs, 169 based on Foata normal form. 47/884 useless extension candidates. Maximal degree in co-relation 2646. Up to 403 conditions per place. [2023-08-24 00:20:49,867 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2023-08-24 00:20:49,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 573 flow [2023-08-24 00:20:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 00:20:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 00:20:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 999 transitions. [2023-08-24 00:20:49,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559561843906892 [2023-08-24 00:20:49,869 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 999 transitions. [2023-08-24 00:20:49,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 999 transitions. [2023-08-24 00:20:49,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:20:49,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 999 transitions. [2023-08-24 00:20:49,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.71428571428572) internal successors, (999), 7 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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 00:20:49,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states 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 00:20:49,875 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 313.0) internal successors, (2504), 8 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states 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 00:20:49,876 INFO L175 Difference]: Start difference. First operand has 90 places, 54 transitions, 335 flow. Second operand 7 states and 999 transitions. [2023-08-24 00:20:49,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 573 flow [2023-08-24 00:20:49,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 520 flow, removed 7 selfloop flow, removed 11 redundant places. [2023-08-24 00:20:49,878 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-08-24 00:20:49,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=79, PETRI_TRANSITIONS=0} [2023-08-24 00:20:49,879 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2023-08-24 00:20:49,879 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-08-24 00:20:49,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-08-24 00:20:49,882 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-24 00:20:49,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-24 00:20:49,883 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-24 00:20:49,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 00:20:49,883 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:20:49,887 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 00:20:49,887 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 00:20:49,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 12:20:49 BasicIcfg [2023-08-24 00:20:49,890 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 00:20:49,890 INFO L158 Benchmark]: Toolchain (without parser) took 15838.66ms. Allocated memory was 350.2MB in the beginning and 1.3GB in the end (delta: 935.3MB). Free memory was 325.4MB in the beginning and 1.2GB in the end (delta: -840.8MB). Peak memory consumption was 461.0MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,890 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 00:20:49,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.00ms. Allocated memory is still 350.2MB. Free memory was 325.4MB in the beginning and 305.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.54ms. Allocated memory is still 350.2MB. Free memory was 305.0MB in the beginning and 302.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,891 INFO L158 Benchmark]: Boogie Preprocessor took 36.59ms. Allocated memory is still 350.2MB. Free memory was 302.9MB in the beginning and 301.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,891 INFO L158 Benchmark]: RCFGBuilder took 412.46ms. Allocated memory is still 350.2MB. Free memory was 301.2MB in the beginning and 283.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,891 INFO L158 Benchmark]: TraceAbstraction took 14848.20ms. Allocated memory was 350.2MB in the beginning and 1.3GB in the end (delta: 935.3MB). Free memory was 283.0MB in the beginning and 1.2GB in the end (delta: -883.3MB). Peak memory consumption was 419.0MB. Max. memory is 16.0GB. [2023-08-24 00:20:49,892 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.15ms. Allocated memory is still 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 481.00ms. Allocated memory is still 350.2MB. Free memory was 325.4MB in the beginning and 305.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.54ms. Allocated memory is still 350.2MB. Free memory was 305.0MB in the beginning and 302.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.59ms. Allocated memory is still 350.2MB. Free memory was 302.9MB in the beginning and 301.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 412.46ms. Allocated memory is still 350.2MB. Free memory was 301.2MB in the beginning and 283.5MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 14848.20ms. Allocated memory was 350.2MB in the beginning and 1.3GB in the end (delta: 935.3MB). Free memory was 283.0MB in the beginning and 1.2GB in the end (delta: -883.3MB). Peak memory consumption was 419.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 232]: Unsoundness Warning unspecified type, defaulting to int C: short [232] - GenericResultAtLocation [Line: 233]: Unsoundness Warning unspecified type, defaulting to int C: short [233] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 164 PlacesBefore, 47 PlacesAfterwards, 159 TransitionsBefore, 39 TransitionsAfterwards, 9270 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 19 ConcurrentYvCompositions, 3 ChoiceCompositions, 151 TotalNumberOfCompositions, 20940 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10029, independent: 9648, independent conditional: 0, independent unconditional: 9648, dependent: 381, dependent conditional: 0, dependent unconditional: 381, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5199, independent: 5132, independent conditional: 0, independent unconditional: 5132, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10029, independent: 4516, independent conditional: 0, independent unconditional: 4516, dependent: 314, dependent conditional: 0, dependent unconditional: 314, unknown: 5199, unknown conditional: 0, unknown unconditional: 5199] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 233 locations, 9 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: 14.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 791 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 791 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1893 IncrementalHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 21 mSDtfsCounter, 1893 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=844occurred in iteration=7, InterpolantAutomatonStates: 74, 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.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 675 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-08-24 00:20:49,912 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...