/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 13:14:14,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 13:14:14,805 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 13:14:14,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 13:14:14,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 13:14:14,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 13:14:14,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 13:14:14,832 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 13:14:14,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 13:14:14,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 13:14:14,833 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 13:14:14,833 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 13:14:14,833 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 13:14:14,834 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 13:14:14,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 13:14:14,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 13:14:14,835 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 13:14:14,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 13:14:14,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 13:14:14,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 13:14:14,836 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 13:14:14,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 13:14:14,840 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 13:14:14,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 13:14:14,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 13:14:14,841 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 13:14:14,842 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 13:14:14,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:14:14,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 13:14:14,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 13:14:14,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 13:14:14,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 13:14:14,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 13:14:14,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 13:14:14,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 13:14:14,844 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 13:14:15,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 13:14:15,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 13:14:15,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 13:14:15,198 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 13:14:15,198 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 13:14:15,199 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 13:14:16,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 13:14:16,686 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 13:14:16,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-08-24 13:14:16,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576d933c/85fdb5d828f2442bbe0cc42319fdf52b/FLAG5ee340e9c [2023-08-24 13:14:16,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1576d933c/85fdb5d828f2442bbe0cc42319fdf52b [2023-08-24 13:14:16,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 13:14:16,730 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 13:14:16,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 13:14:16,733 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 13:14:16,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 13:14:16,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:14:16" (1/1) ... [2023-08-24 13:14:16,738 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19862925 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:16, skipping insertion in model container [2023-08-24 13:14:16,738 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:14:16" (1/1) ... [2023-08-24 13:14:16,780 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 13:14:16,944 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 13:14:17,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:14:17,108 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 13:14:17,122 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 13:14:17,143 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [232] [2023-08-24 13:14:17,145 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [233] [2023-08-24 13:14:17,168 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:14:17,203 INFO L206 MainTranslator]: Completed translation [2023-08-24 13:14:17,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17 WrapperNode [2023-08-24 13:14:17,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 13:14:17,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 13:14:17,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 13:14:17,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 13:14:17,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,266 INFO L138 Inliner]: procedures = 165, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2023-08-24 13:14:17,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 13:14:17,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 13:14:17,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 13:14:17,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 13:14:17,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,278 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,287 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 13:14:17,291 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 13:14:17,291 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 13:14:17,291 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 13:14:17,292 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (1/1) ... [2023-08-24 13:14:17,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:14:17,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:14:17,317 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 13:14:17,320 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 13:14:17,346 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-08-24 13:14:17,347 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-08-24 13:14:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 13:14:17,347 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-08-24 13:14:17,348 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-24 13:14:17,348 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 13:14:17,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 13:14:17,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 13:14:17,350 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 13:14:17,493 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 13:14:17,495 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 13:14:17,812 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 13:14:17,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 13:14:17,823 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 13:14:17,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:14:17 BoogieIcfgContainer [2023-08-24 13:14:17,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 13:14:17,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 13:14:17,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 13:14:17,831 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 13:14:17,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:14:16" (1/3) ... [2023-08-24 13:14:17,832 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b22921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:14:17, skipping insertion in model container [2023-08-24 13:14:17,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:14:17" (2/3) ... [2023-08-24 13:14:17,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64b22921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:14:17, skipping insertion in model container [2023-08-24 13:14:17,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:14:17" (3/3) ... [2023-08-24 13:14:17,834 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-08-24 13:14:17,850 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 13:14:17,850 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-24 13:14:17,851 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 13:14:17,941 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 13:14:17,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 339 flow [2023-08-24 13:14:18,072 INFO L124 PetriNetUnfolderBase]: 5/159 cut-off events. [2023-08-24 13:14:18,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 13:14:18,079 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 13:14:18,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 339 flow [2023-08-24 13:14:18,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 164 places, 159 transitions, 327 flow [2023-08-24 13:14:18,091 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 13:14:18,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 159 transitions, 327 flow [2023-08-24 13:14:18,107 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 164 places, 159 transitions, 327 flow [2023-08-24 13:14:18,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 159 transitions, 327 flow [2023-08-24 13:14:18,174 INFO L124 PetriNetUnfolderBase]: 5/159 cut-off events. [2023-08-24 13:14:18,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 13:14:18,179 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 13:14:18,183 INFO L119 LiptonReduction]: Number of co-enabled transitions 9270 [2023-08-24 13:14:22,916 INFO L134 LiptonReduction]: Checked pairs total: 20940 [2023-08-24 13:14:22,917 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-24 13:14:22,928 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 13:14:22,934 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;@13020236, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 13:14:22,934 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-24 13:14:22,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 13:14:22,939 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-24 13:14:22,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 13:14:22,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:22,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:22,940 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 13:14:22,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -227316659, now seen corresponding path program 1 times [2023-08-24 13:14:22,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598418702] [2023-08-24 13:14:22,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:23,384 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 13:14:23,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:23,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598418702] [2023-08-24 13:14:23,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598418702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:23,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:23,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:14:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544016028] [2023-08-24 13:14:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:23,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:14:23,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:23,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:14:23,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:14:23,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 313 [2023-08-24 13:14:23,421 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 13:14:23,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:23,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 313 [2023-08-24 13:14:23,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:24,544 INFO L124 PetriNetUnfolderBase]: 7003/10637 cut-off events. [2023-08-24 13:14:24,544 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-24 13:14:24,560 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 13:14:24,616 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 137 selfloop transitions, 10 changer transitions 0/154 dead transitions. [2023-08-24 13:14:24,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 154 transitions, 632 flow [2023-08-24 13:14:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 13:14:24,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 13:14:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1253 transitions. [2023-08-24 13:14:24,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003993610223643 [2023-08-24 13:14:24,634 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1253 transitions. [2023-08-24 13:14:24,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1253 transitions. [2023-08-24 13:14:24,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:24,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1253 transitions. [2023-08-24 13:14:24,644 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 13:14:24,652 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 13:14:24,654 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 13:14:24,656 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 87 flow. Second operand 8 states and 1253 transitions. [2023-08-24 13:14:24,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 154 transitions, 632 flow [2023-08-24 13:14:24,660 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 13:14:24,663 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 151 flow [2023-08-24 13:14:24,665 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 13:14:24,668 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2023-08-24 13:14:24,669 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 151 flow [2023-08-24 13:14:24,669 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 13:14:24,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:24,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:24,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 13:14:24,670 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 13:14:24,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:24,671 INFO L85 PathProgramCache]: Analyzing trace with hash 195691478, now seen corresponding path program 1 times [2023-08-24 13:14:24,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:24,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187176648] [2023-08-24 13:14:24,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:24,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:24,878 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 13:14:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187176648] [2023-08-24 13:14:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187176648] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:14:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878213130] [2023-08-24 13:14:24,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:24,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:14:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:14:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:14:24,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 313 [2023-08-24 13:14:24,884 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 13:14:24,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:24,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 313 [2023-08-24 13:14:24,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:26,028 INFO L124 PetriNetUnfolderBase]: 7396/11581 cut-off events. [2023-08-24 13:14:26,029 INFO L125 PetriNetUnfolderBase]: For 6076/6076 co-relation queries the response was YES. [2023-08-24 13:14:26,057 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 13:14:26,105 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 122 selfloop transitions, 20 changer transitions 0/149 dead transitions. [2023-08-24 13:14:26,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 149 transitions, 781 flow [2023-08-24 13:14:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 13:14:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 13:14:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1206 transitions. [2023-08-24 13:14:26,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.481629392971246 [2023-08-24 13:14:26,110 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1206 transitions. [2023-08-24 13:14:26,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1206 transitions. [2023-08-24 13:14:26,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:26,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1206 transitions. [2023-08-24 13:14:26,113 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 13:14:26,117 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 13:14:26,119 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 13:14:26,119 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 151 flow. Second operand 8 states and 1206 transitions. [2023-08-24 13:14:26,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 149 transitions, 781 flow [2023-08-24 13:14:26,179 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 13:14:26,181 INFO L231 Difference]: Finished difference. Result has 69 places, 61 transitions, 326 flow [2023-08-24 13:14:26,182 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 13:14:26,182 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 22 predicate places. [2023-08-24 13:14:26,183 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 61 transitions, 326 flow [2023-08-24 13:14:26,183 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 13:14:26,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:26,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:26,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 13:14:26,184 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 13:14:26,184 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 442248688, now seen corresponding path program 1 times [2023-08-24 13:14:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:26,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498017970] [2023-08-24 13:14:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:26,246 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 13:14:26,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:26,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498017970] [2023-08-24 13:14:26,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498017970] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:26,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:26,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:14:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047578426] [2023-08-24 13:14:26,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:26,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:14:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:14:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 13:14:26,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 313 [2023-08-24 13:14:26,249 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 13:14:26,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:26,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 313 [2023-08-24 13:14:26,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:26,770 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 13:14:26,771 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,771 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,771 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,771 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,771 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 13:14:26,772 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,810 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 13:14:26,810 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,810 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,811 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,811 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,811 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,811 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 13:14:26,811 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,811 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,812 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,812 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,812 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-24 13:14:26,815 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 13:14:26,815 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,815 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,815 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,815 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,816 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 13:14:26,816 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,816 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,816 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,816 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,850 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 13:14:26,850 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,850 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,850 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 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 13:14:26,851 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,851 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-24 13:14:26,855 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 13:14:26,855 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,855 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,855 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,855 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,856 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 13:14:26,856 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,856 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,856 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,856 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,891 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 13:14:26,891 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,891 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,892 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 13:14:26,892 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,892 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,893 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,893 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,893 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-24 13:14:26,949 INFO L124 PetriNetUnfolderBase]: 3637/6796 cut-off events. [2023-08-24 13:14:26,949 INFO L125 PetriNetUnfolderBase]: For 6478/6790 co-relation queries the response was YES. [2023-08-24 13:14:26,970 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 13:14:26,996 INFO L140 encePairwiseOnDemand]: 298/313 looper letters, 52 selfloop transitions, 16 changer transitions 0/88 dead transitions. [2023-08-24 13:14:26,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 569 flow [2023-08-24 13:14:26,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:14:26,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:14:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-24 13:14:26,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739084132055378 [2023-08-24 13:14:26,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-24 13:14:26,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-24 13:14:26,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:26,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-24 13:14:27,000 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 13:14:27,001 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 13:14:27,002 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 13:14:27,002 INFO L175 Difference]: Start difference. First operand has 69 places, 61 transitions, 326 flow. Second operand 3 states and 445 transitions. [2023-08-24 13:14:27,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 569 flow [2023-08-24 13:14:27,049 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 13:14:27,051 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 408 flow [2023-08-24 13:14:27,051 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 13:14:27,052 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2023-08-24 13:14:27,052 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 408 flow [2023-08-24 13:14:27,052 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 13:14:27,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:27,052 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:27,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 13:14:27,053 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 13:14:27,053 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash 799830391, now seen corresponding path program 1 times [2023-08-24 13:14:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:27,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306362966] [2023-08-24 13:14:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:27,165 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 13:14:27,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306362966] [2023-08-24 13:14:27,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306362966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:27,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:27,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:14:27,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365679987] [2023-08-24 13:14:27,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:27,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:14:27,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:27,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:14:27,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:14:27,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 313 [2023-08-24 13:14:27,182 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 13:14:27,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:27,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 313 [2023-08-24 13:14:27,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:28,271 INFO L124 PetriNetUnfolderBase]: 5146/8797 cut-off events. [2023-08-24 13:14:28,272 INFO L125 PetriNetUnfolderBase]: For 10117/10170 co-relation queries the response was YES. [2023-08-24 13:14:28,297 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 13:14:28,327 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 118 selfloop transitions, 31 changer transitions 5/166 dead transitions. [2023-08-24 13:14:28,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 1254 flow [2023-08-24 13:14:28,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 13:14:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 13:14:28,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1202 transitions. [2023-08-24 13:14:28,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48003194888178913 [2023-08-24 13:14:28,330 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1202 transitions. [2023-08-24 13:14:28,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1202 transitions. [2023-08-24 13:14:28,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:28,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1202 transitions. [2023-08-24 13:14:28,334 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 13:14:28,338 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 13:14:28,339 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 13:14:28,339 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 408 flow. Second operand 8 states and 1202 transitions. [2023-08-24 13:14:28,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 1254 flow [2023-08-24 13:14:28,395 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 13:14:28,398 INFO L231 Difference]: Finished difference. Result has 84 places, 89 transitions, 697 flow [2023-08-24 13:14:28,398 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 13:14:28,399 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2023-08-24 13:14:28,399 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 89 transitions, 697 flow [2023-08-24 13:14:28,400 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 13:14:28,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:28,400 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:28,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 13:14:28,400 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 13:14:28,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:28,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1492423791, now seen corresponding path program 1 times [2023-08-24 13:14:28,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:28,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5087088] [2023-08-24 13:14:28,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:28,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:28,522 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 13:14:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5087088] [2023-08-24 13:14:28,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5087088] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:28,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 13:14:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024197005] [2023-08-24 13:14:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:28,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:14:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:14:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:14:28,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 13:14:28,525 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 13:14:28,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:28,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 13:14:28,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:29,538 INFO L124 PetriNetUnfolderBase]: 5750/9982 cut-off events. [2023-08-24 13:14:29,538 INFO L125 PetriNetUnfolderBase]: For 20264/20387 co-relation queries the response was YES. [2023-08-24 13:14:29,575 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 13:14:29,609 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 156 selfloop transitions, 35 changer transitions 1/204 dead transitions. [2023-08-24 13:14:29,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 204 transitions, 1661 flow [2023-08-24 13:14:29,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 13:14:29,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 13:14:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1062 transitions. [2023-08-24 13:14:29,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847101780009128 [2023-08-24 13:14:29,612 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1062 transitions. [2023-08-24 13:14:29,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1062 transitions. [2023-08-24 13:14:29,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:29,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1062 transitions. [2023-08-24 13:14:29,615 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 13:14:29,618 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 13:14:29,619 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 13:14:29,619 INFO L175 Difference]: Start difference. First operand has 84 places, 89 transitions, 697 flow. Second operand 7 states and 1062 transitions. [2023-08-24 13:14:29,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 204 transitions, 1661 flow [2023-08-24 13:14:29,737 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 13:14:29,739 INFO L231 Difference]: Finished difference. Result has 94 places, 93 transitions, 808 flow [2023-08-24 13:14:29,740 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 13:14:29,740 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 47 predicate places. [2023-08-24 13:14:29,740 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 93 transitions, 808 flow [2023-08-24 13:14:29,741 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 13:14:29,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:29,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:29,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 13:14:29,741 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 13:14:29,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash -546670984, now seen corresponding path program 1 times [2023-08-24 13:14:29,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:29,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124694494] [2023-08-24 13:14:29,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:29,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:29,872 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 13:14:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:29,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124694494] [2023-08-24 13:14:29,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124694494] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:29,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:29,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:14:29,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269054344] [2023-08-24 13:14:29,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:29,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:14:29,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:14:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:14:29,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 313 [2023-08-24 13:14:29,875 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 13:14:29,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:29,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 313 [2023-08-24 13:14:29,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:30,160 INFO L124 PetriNetUnfolderBase]: 1305/2906 cut-off events. [2023-08-24 13:14:30,161 INFO L125 PetriNetUnfolderBase]: For 8670/8988 co-relation queries the response was YES. [2023-08-24 13:14:30,172 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 13:14:30,181 INFO L140 encePairwiseOnDemand]: 303/313 looper letters, 55 selfloop transitions, 17 changer transitions 4/104 dead transitions. [2023-08-24 13:14:30,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 104 transitions, 978 flow [2023-08-24 13:14:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:14:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:14:30,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2023-08-24 13:14:30,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42971246006389774 [2023-08-24 13:14:30,183 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2023-08-24 13:14:30,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2023-08-24 13:14:30,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:30,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2023-08-24 13:14:30,185 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 13:14:30,187 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 13:14:30,187 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 13:14:30,187 INFO L175 Difference]: Start difference. First operand has 94 places, 93 transitions, 808 flow. Second operand 4 states and 538 transitions. [2023-08-24 13:14:30,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 104 transitions, 978 flow [2023-08-24 13:14:30,253 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 13:14:30,255 INFO L231 Difference]: Finished difference. Result has 92 places, 85 transitions, 678 flow [2023-08-24 13:14:30,255 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 13:14:30,256 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 45 predicate places. [2023-08-24 13:14:30,256 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 85 transitions, 678 flow [2023-08-24 13:14:30,256 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 13:14:30,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:30,257 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 13:14:30,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 13:14:30,257 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 13:14:30,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash 396316053, now seen corresponding path program 1 times [2023-08-24 13:14:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:30,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738141094] [2023-08-24 13:14:30,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:30,338 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 13:14:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738141094] [2023-08-24 13:14:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738141094] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 13:14:30,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767405691] [2023-08-24 13:14:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:30,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:14:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:14:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:14:30,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 13:14:30,341 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 13:14:30,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:30,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 13:14:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:30,903 INFO L124 PetriNetUnfolderBase]: 1764/3686 cut-off events. [2023-08-24 13:14:30,903 INFO L125 PetriNetUnfolderBase]: For 9416/9521 co-relation queries the response was YES. [2023-08-24 13:14:30,918 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 13:14:30,932 INFO L140 encePairwiseOnDemand]: 305/313 looper letters, 163 selfloop transitions, 39 changer transitions 12/226 dead transitions. [2023-08-24 13:14:30,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 226 transitions, 1854 flow [2023-08-24 13:14:30,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 13:14:30,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 13:14:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1904 transitions. [2023-08-24 13:14:30,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.467928237896289 [2023-08-24 13:14:30,946 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1904 transitions. [2023-08-24 13:14:30,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1904 transitions. [2023-08-24 13:14:30,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:30,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1904 transitions. [2023-08-24 13:14:30,950 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 13:14:30,956 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 13:14:30,958 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 13:14:30,958 INFO L175 Difference]: Start difference. First operand has 92 places, 85 transitions, 678 flow. Second operand 13 states and 1904 transitions. [2023-08-24 13:14:30,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 226 transitions, 1854 flow [2023-08-24 13:14:31,002 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 13:14:31,005 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 844 flow [2023-08-24 13:14:31,006 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 13:14:31,006 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 59 predicate places. [2023-08-24 13:14:31,007 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 844 flow [2023-08-24 13:14:31,008 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 13:14:31,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:31,008 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 13:14:31,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 13:14:31,008 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 13:14:31,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1974240727, now seen corresponding path program 1 times [2023-08-24 13:14:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:31,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433322889] [2023-08-24 13:14:31,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:31,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 13:14:31,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:31,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433322889] [2023-08-24 13:14:31,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433322889] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:31,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:31,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 13:14:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032624389] [2023-08-24 13:14:31,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:31,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 13:14:31,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 13:14:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-24 13:14:31,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 313 [2023-08-24 13:14:31,119 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 13:14:31,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:31,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 313 [2023-08-24 13:14:31,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:31,285 INFO L124 PetriNetUnfolderBase]: 297/1077 cut-off events. [2023-08-24 13:14:31,286 INFO L125 PetriNetUnfolderBase]: For 2194/2308 co-relation queries the response was YES. [2023-08-24 13:14:31,290 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 13:14:31,292 INFO L140 encePairwiseOnDemand]: 302/313 looper letters, 37 selfloop transitions, 14 changer transitions 2/73 dead transitions. [2023-08-24 13:14:31,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 73 transitions, 661 flow [2023-08-24 13:14:31,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:14:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:14:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-24 13:14:31,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.426517571884984 [2023-08-24 13:14:31,294 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-24 13:14:31,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-24 13:14:31,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:31,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-24 13:14:31,296 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 13:14:31,297 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 13:14:31,298 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 13:14:31,298 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 844 flow. Second operand 4 states and 534 transitions. [2023-08-24 13:14:31,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 73 transitions, 661 flow [2023-08-24 13:14:31,307 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 13:14:31,308 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 414 flow [2023-08-24 13:14:31,309 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 13:14:31,309 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 36 predicate places. [2023-08-24 13:14:31,309 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 414 flow [2023-08-24 13:14:31,310 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 13:14:31,310 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:31,310 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 13:14:31,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 13:14:31,310 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 13:14:31,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:31,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1373040322, now seen corresponding path program 1 times [2023-08-24 13:14:31,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:31,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684532588] [2023-08-24 13:14:31,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:31,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:31,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:31,457 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 13:14:31,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684532588] [2023-08-24 13:14:31,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684532588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:31,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:31,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 13:14:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753840222] [2023-08-24 13:14:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:31,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:14:31,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:14:31,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:14:31,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 313 [2023-08-24 13:14:31,460 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 13:14:31,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:31,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 313 [2023-08-24 13:14:31,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:31,846 INFO L124 PetriNetUnfolderBase]: 514/1413 cut-off events. [2023-08-24 13:14:31,846 INFO L125 PetriNetUnfolderBase]: For 1390/1394 co-relation queries the response was YES. [2023-08-24 13:14:31,850 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 13:14:31,852 INFO L140 encePairwiseOnDemand]: 306/313 looper letters, 83 selfloop transitions, 15 changer transitions 33/139 dead transitions. [2023-08-24 13:14:31,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 139 transitions, 1067 flow [2023-08-24 13:14:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 13:14:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 13:14:31,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1691 transitions. [2023-08-24 13:14:31,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4502129925452609 [2023-08-24 13:14:31,858 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1691 transitions. [2023-08-24 13:14:31,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1691 transitions. [2023-08-24 13:14:31,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:31,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1691 transitions. [2023-08-24 13:14:31,863 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 13:14:31,869 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 13:14:31,870 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 13:14:31,870 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 414 flow. Second operand 12 states and 1691 transitions. [2023-08-24 13:14:31,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 139 transitions, 1067 flow [2023-08-24 13:14:31,875 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 13:14:31,877 INFO L231 Difference]: Finished difference. Result has 90 places, 54 transitions, 335 flow [2023-08-24 13:14:31,877 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 13:14:31,877 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 43 predicate places. [2023-08-24 13:14:31,878 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 54 transitions, 335 flow [2023-08-24 13:14:31,878 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 13:14:31,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:14:31,878 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 13:14:31,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 13:14:31,879 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 13:14:31,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:14:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 2055360479, now seen corresponding path program 1 times [2023-08-24 13:14:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:14:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286246838] [2023-08-24 13:14:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:14:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:14:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:14:32,014 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 13:14:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:14:32,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286246838] [2023-08-24 13:14:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286246838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:14:32,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:14:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 13:14:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950188404] [2023-08-24 13:14:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:14:32,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 13:14:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:14:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 13:14:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-24 13:14:32,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 313 [2023-08-24 13:14:32,018 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 13:14:32,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:14:32,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 313 [2023-08-24 13:14:32,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:14:32,258 INFO L124 PetriNetUnfolderBase]: 305/844 cut-off events. [2023-08-24 13:14:32,258 INFO L125 PetriNetUnfolderBase]: For 934/938 co-relation queries the response was YES. [2023-08-24 13:14:32,260 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 13:14:32,261 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 79/79 dead transitions. [2023-08-24 13:14:32,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 79 transitions, 573 flow [2023-08-24 13:14:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 13:14:32,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 13:14:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 999 transitions. [2023-08-24 13:14:32,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4559561843906892 [2023-08-24 13:14:32,264 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 999 transitions. [2023-08-24 13:14:32,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 999 transitions. [2023-08-24 13:14:32,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:14:32,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 999 transitions. [2023-08-24 13:14:32,267 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 13:14:32,270 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 13:14:32,270 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 13:14:32,270 INFO L175 Difference]: Start difference. First operand has 90 places, 54 transitions, 335 flow. Second operand 7 states and 999 transitions. [2023-08-24 13:14:32,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 79 transitions, 573 flow [2023-08-24 13:14:32,274 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 13:14:32,275 INFO L231 Difference]: Finished difference. Result has 79 places, 0 transitions, 0 flow [2023-08-24 13:14:32,275 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 13:14:32,275 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 32 predicate places. [2023-08-24 13:14:32,275 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 0 transitions, 0 flow [2023-08-24 13:14:32,276 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 13:14:32,285 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-24 13:14:32,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-24 13:14:32,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-24 13:14:32,289 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-08-24 13:14:32,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-08-24 13:14:32,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-08-24 13:14:32,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-24 13:14:32,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-24 13:14:32,290 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-24 13:14:32,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 13:14:32,291 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 13:14:32,295 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 13:14:32,295 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 13:14:32,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 01:14:32 BasicIcfg [2023-08-24 13:14:32,298 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 13:14:32,298 INFO L158 Benchmark]: Toolchain (without parser) took 15568.23ms. Allocated memory was 337.6MB in the beginning and 1.2GB in the end (delta: 870.3MB). Free memory was 312.2MB in the beginning and 929.8MB in the end (delta: -617.6MB). Peak memory consumption was 254.6MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,299 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 337.6MB. Free memory was 315.6MB in the beginning and 315.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:14:32,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 471.04ms. Allocated memory is still 337.6MB. Free memory was 312.2MB in the beginning and 292.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.27ms. Allocated memory is still 337.6MB. Free memory was 292.5MB in the beginning and 290.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,299 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 337.6MB. Free memory was 290.0MB in the beginning and 288.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,300 INFO L158 Benchmark]: RCFGBuilder took 535.15ms. Allocated memory is still 337.6MB. Free memory was 288.3MB in the beginning and 269.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,300 INFO L158 Benchmark]: TraceAbstraction took 14469.78ms. Allocated memory was 337.6MB in the beginning and 1.2GB in the end (delta: 870.3MB). Free memory was 269.5MB in the beginning and 929.8MB in the end (delta: -660.3MB). Peak memory consumption was 212.7MB. Max. memory is 16.0GB. [2023-08-24 13:14:32,301 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.16ms. Allocated memory is still 337.6MB. Free memory was 315.6MB in the beginning and 315.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 471.04ms. Allocated memory is still 337.6MB. Free memory was 312.2MB in the beginning and 292.5MB in the end (delta: 19.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 62.27ms. Allocated memory is still 337.6MB. Free memory was 292.5MB in the beginning and 290.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 337.6MB. Free memory was 290.0MB in the beginning and 288.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 535.15ms. Allocated memory is still 337.6MB. Free memory was 288.3MB in the beginning and 269.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 14469.78ms. Allocated memory was 337.6MB in the beginning and 1.2GB in the end (delta: 870.3MB). Free memory was 269.5MB in the beginning and 929.8MB in the end (delta: -660.3MB). Peak memory consumption was 212.7MB. 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.8s, 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.3s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, 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.2s 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 13:14:32,323 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...