/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 07:51:28,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 07:51:28,298 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-26 07:51:28,304 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 07:51:28,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 07:51:28,332 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 07:51:28,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 07:51:28,333 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 07:51:28,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 07:51:28,336 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 07:51:28,336 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 07:51:28,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 07:51:28,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 07:51:28,337 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 07:51:28,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 07:51:28,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 07:51:28,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 07:51:28,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 07:51:28,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 07:51:28,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 07:51:28,340 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 07:51:28,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 07:51:28,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:51:28,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 07:51:28,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 07:51:28,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 07:51:28,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 07:51:28,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 07:51:28,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 07:51:28,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 07:51:28,342 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 07:51:28,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 07:51:28,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 07:51:28,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 07:51:28,616 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 07:51:28,616 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 07:51:28,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-26 07:51:29,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 07:51:29,864 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 07:51:29,865 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-26 07:51:29,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd1f293b/6b383383f0e54b3cb7d819072c111ce0/FLAGfd2a6280e [2023-08-26 07:51:29,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd1f293b/6b383383f0e54b3cb7d819072c111ce0 [2023-08-26 07:51:29,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 07:51:29,901 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 07:51:29,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 07:51:29,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 07:51:29,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 07:51:29,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:51:29" (1/1) ... [2023-08-26 07:51:29,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee3ded2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:29, skipping insertion in model container [2023-08-26 07:51:29,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 07:51:29" (1/1) ... [2023-08-26 07:51:29,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 07:51:30,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:51:30,352 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 07:51:30,372 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:51:30,373 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 07:51:30,378 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 07:51:30,396 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 07:51:30,432 INFO L206 MainTranslator]: Completed translation [2023-08-26 07:51:30,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30 WrapperNode [2023-08-26 07:51:30,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 07:51:30,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 07:51:30,433 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 07:51:30,433 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 07:51:30,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,474 INFO L138 Inliner]: procedures = 271, calls = 32, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 267 [2023-08-26 07:51:30,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 07:51:30,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 07:51:30,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 07:51:30,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 07:51:30,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 07:51:30,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 07:51:30,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 07:51:30,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 07:51:30,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (1/1) ... [2023-08-26 07:51:30,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 07:51:30,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:30,575 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-26 07:51:30,629 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-26 07:51:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 07:51:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 07:51:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 07:51:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 07:51:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 07:51:30,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 07:51:30,645 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 07:51:30,739 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 07:51:30,741 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 07:51:31,013 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 07:51:31,020 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 07:51:31,020 INFO L302 CfgBuilder]: Removed 25 assume(true) statements. [2023-08-26 07:51:31,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:51:31 BoogieIcfgContainer [2023-08-26 07:51:31,022 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 07:51:31,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 07:51:31,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 07:51:31,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 07:51:31,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 07:51:29" (1/3) ... [2023-08-26 07:51:31,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2137cc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:51:31, skipping insertion in model container [2023-08-26 07:51:31,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 07:51:30" (2/3) ... [2023-08-26 07:51:31,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2137cc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 07:51:31, skipping insertion in model container [2023-08-26 07:51:31,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 07:51:31" (3/3) ... [2023-08-26 07:51:31,027 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-08-26 07:51:31,037 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 07:51:31,038 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-08-26 07:51:31,038 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 07:51:31,110 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 07:51:31,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,289 INFO L124 PetriNetUnfolderBase]: 52/404 cut-off events. [2023-08-26 07:51:31,290 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:51:31,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 404 events. 52/404 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1739 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-26 07:51:31,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,314 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,318 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 07:51:31,329 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,332 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 277 transitions, 562 flow [2023-08-26 07:51:31,398 INFO L124 PetriNetUnfolderBase]: 52/404 cut-off events. [2023-08-26 07:51:31,398 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 07:51:31,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 404 events. 52/404 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1739 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-26 07:51:31,416 INFO L119 LiptonReduction]: Number of co-enabled transitions 28462 [2023-08-26 07:51:33,897 INFO L134 LiptonReduction]: Checked pairs total: 107895 [2023-08-26 07:51:33,898 INFO L136 LiptonReduction]: Total number of compositions: 181 [2023-08-26 07:51:33,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 07:51:33,911 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;@77d1211c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 07:51:33,911 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-08-26 07:51:33,916 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 07:51:33,916 INFO L124 PetriNetUnfolderBase]: 15/68 cut-off events. [2023-08-26 07:51:33,916 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 07:51:33,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:33,917 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:33,917 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:33,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1208916897, now seen corresponding path program 1 times [2023-08-26 07:51:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728790095] [2023-08-26 07:51:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:33,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:33,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:34,066 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-26 07:51:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728790095] [2023-08-26 07:51:34,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728790095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:51:34,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:51:34,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 07:51:34,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257913559] [2023-08-26 07:51:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:51:34,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:51:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:34,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:51:34,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 07:51:34,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:34,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 139 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:34,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:34,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:34,299 INFO L124 PetriNetUnfolderBase]: 528/1847 cut-off events. [2023-08-26 07:51:34,299 INFO L125 PetriNetUnfolderBase]: For 3/8 co-relation queries the response was YES. [2023-08-26 07:51:34,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2845 conditions, 1847 events. 528/1847 cut-off events. For 3/8 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 13142 event pairs, 437 based on Foata normal form. 221/1840 useless extension candidates. Maximal degree in co-relation 2739. Up to 990 conditions per place. [2023-08-26 07:51:34,307 INFO L140 encePairwiseOnDemand]: 433/458 looper letters, 49 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-08-26 07:51:34,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 118 transitions, 346 flow [2023-08-26 07:51:34,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:51:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:51:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2023-08-26 07:51:34,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5691411935953421 [2023-08-26 07:51:34,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 782 transitions. [2023-08-26 07:51:34,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 782 transitions. [2023-08-26 07:51:34,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:34,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 782 transitions. [2023-08-26 07:51:34,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.6666666666667) internal successors, (782), 3 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,331 INFO L175 Difference]: Start difference. First operand has 114 places, 139 transitions, 286 flow. Second operand 3 states and 782 transitions. [2023-08-26 07:51:34,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 118 transitions, 346 flow [2023-08-26 07:51:34,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 346 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:51:34,336 INFO L231 Difference]: Finished difference. Result has 117 places, 118 transitions, 254 flow [2023-08-26 07:51:34,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=117, PETRI_TRANSITIONS=118} [2023-08-26 07:51:34,339 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 3 predicate places. [2023-08-26 07:51:34,340 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 118 transitions, 254 flow [2023-08-26 07:51:34,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:34,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:34,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 07:51:34,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:34,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:34,341 INFO L85 PathProgramCache]: Analyzing trace with hash 837890226, now seen corresponding path program 1 times [2023-08-26 07:51:34,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:34,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40368195] [2023-08-26 07:51:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:34,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:34,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40368195] [2023-08-26 07:51:34,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40368195] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:34,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660786197] [2023-08-26 07:51:34,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:34,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:34,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 07:51:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:34,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:51:34,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:34,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 07:51:34,505 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:51:34,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660786197] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:51:34,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:51:34,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:51:34,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062178276] [2023-08-26 07:51:34,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:51:34,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:51:34,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:34,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:51:34,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:51:34,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:34,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 118 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:34,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:34,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:34,734 INFO L124 PetriNetUnfolderBase]: 525/1822 cut-off events. [2023-08-26 07:51:34,734 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 07:51:34,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 1822 events. 525/1822 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 13028 event pairs, 308 based on Foata normal form. 0/1588 useless extension candidates. Maximal degree in co-relation 2801. Up to 948 conditions per place. [2023-08-26 07:51:34,740 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 70 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2023-08-26 07:51:34,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 440 flow [2023-08-26 07:51:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:51:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:51:34,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-08-26 07:51:34,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5676855895196506 [2023-08-26 07:51:34,742 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-08-26 07:51:34,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-08-26 07:51:34,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:34,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-08-26 07:51:34,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,746 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,746 INFO L175 Difference]: Start difference. First operand has 117 places, 118 transitions, 254 flow. Second operand 3 states and 780 transitions. [2023-08-26 07:51:34,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 440 flow [2023-08-26 07:51:34,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 139 transitions, 436 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 07:51:34,749 INFO L231 Difference]: Finished difference. Result has 119 places, 118 transitions, 258 flow [2023-08-26 07:51:34,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=119, PETRI_TRANSITIONS=118} [2023-08-26 07:51:34,749 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 5 predicate places. [2023-08-26 07:51:34,750 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 118 transitions, 258 flow [2023-08-26 07:51:34,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:34,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:34,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:34,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 07:51:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:34,955 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:34,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1843753709, now seen corresponding path program 1 times [2023-08-26 07:51:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871873347] [2023-08-26 07:51:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 07:51:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871873347] [2023-08-26 07:51:35,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871873347] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:35,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940986817] [2023-08-26 07:51:35,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:35,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:35,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:35,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 07:51:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:35,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 07:51:35,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 07:51:35,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:51:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940986817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:51:35,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:51:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 07:51:35,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322903857] [2023-08-26 07:51:35,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:51:35,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 07:51:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:35,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 07:51:35,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 07:51:35,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:35,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 118 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:35,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:35,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:35,424 INFO L124 PetriNetUnfolderBase]: 903/3152 cut-off events. [2023-08-26 07:51:35,425 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-08-26 07:51:35,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4917 conditions, 3152 events. 903/3152 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 25694 event pairs, 437 based on Foata normal form. 0/2762 useless extension candidates. Maximal degree in co-relation 4899. Up to 971 conditions per place. [2023-08-26 07:51:35,440 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 87 selfloop transitions, 2 changer transitions 0/156 dead transitions. [2023-08-26 07:51:35,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 156 transitions, 512 flow [2023-08-26 07:51:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 07:51:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 07:51:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2023-08-26 07:51:35,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5800582241630277 [2023-08-26 07:51:35,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 797 transitions. [2023-08-26 07:51:35,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 797 transitions. [2023-08-26 07:51:35,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:35,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 797 transitions. [2023-08-26 07:51:35,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,446 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 458.0) internal successors, (1832), 4 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,446 INFO L175 Difference]: Start difference. First operand has 119 places, 118 transitions, 258 flow. Second operand 3 states and 797 transitions. [2023-08-26 07:51:35,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 156 transitions, 512 flow [2023-08-26 07:51:35,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 156 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 07:51:35,449 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 266 flow [2023-08-26 07:51:35,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2023-08-26 07:51:35,450 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 6 predicate places. [2023-08-26 07:51:35,450 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 266 flow [2023-08-26 07:51:35,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:35,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:35,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 07:51:35,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-26 07:51:35,656 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:35,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:35,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2036796599, now seen corresponding path program 1 times [2023-08-26 07:51:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:35,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515715159] [2023-08-26 07:51:35,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:35,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515715159] [2023-08-26 07:51:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515715159] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754668334] [2023-08-26 07:51:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:35,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:35,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:35,706 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:35,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 07:51:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:35,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:51:35,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:35,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:51:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:35,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754668334] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:51:35,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:51:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 07:51:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710122003] [2023-08-26 07:51:35,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:51:35,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:51:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:51:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:51:35,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:35,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:35,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:35,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:35,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:36,203 INFO L124 PetriNetUnfolderBase]: 922/3189 cut-off events. [2023-08-26 07:51:36,203 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-26 07:51:36,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5040 conditions, 3189 events. 922/3189 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 25999 event pairs, 779 based on Foata normal form. 3/2847 useless extension candidates. Maximal degree in co-relation 5013. Up to 1690 conditions per place. [2023-08-26 07:51:36,218 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 50 selfloop transitions, 5 changer transitions 0/122 dead transitions. [2023-08-26 07:51:36,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 122 transitions, 388 flow [2023-08-26 07:51:36,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:51:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:51:36,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1473 transitions. [2023-08-26 07:51:36,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5360262008733624 [2023-08-26 07:51:36,221 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1473 transitions. [2023-08-26 07:51:36,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1473 transitions. [2023-08-26 07:51:36,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:36,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1473 transitions. [2023-08-26 07:51:36,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:36,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:36,229 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:36,229 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 266 flow. Second operand 6 states and 1473 transitions. [2023-08-26 07:51:36,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 122 transitions, 388 flow [2023-08-26 07:51:36,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 122 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 07:51:36,232 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 300 flow [2023-08-26 07:51:36,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2023-08-26 07:51:36,233 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2023-08-26 07:51:36,233 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 300 flow [2023-08-26 07:51:36,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:36,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:36,234 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:36,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 07:51:36,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:36,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:36,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1313135306, now seen corresponding path program 2 times [2023-08-26 07:51:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457517813] [2023-08-26 07:51:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:36,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:36,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457517813] [2023-08-26 07:51:36,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457517813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:36,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147938936] [2023-08-26 07:51:36,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:51:36,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:36,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:36,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:36,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 07:51:36,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 07:51:36,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:51:36,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 07:51:36,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:36,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 07:51:36,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 07:51:36,667 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:51:36,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 07:51:36,694 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 07:51:36,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 07:51:36,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 07:51:36,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 07:51:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147938936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:51:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 07:51:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 07:51:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430837572] [2023-08-26 07:51:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:51:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:51:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:51:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 07:51:36,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 458 [2023-08-26 07:51:36,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 300 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:36,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:36,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 458 [2023-08-26 07:51:36,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:38,060 INFO L124 PetriNetUnfolderBase]: 6070/12334 cut-off events. [2023-08-26 07:51:38,061 INFO L125 PetriNetUnfolderBase]: For 260/260 co-relation queries the response was YES. [2023-08-26 07:51:38,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24596 conditions, 12334 events. 6070/12334 cut-off events. For 260/260 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 90239 event pairs, 2328 based on Foata normal form. 0/10473 useless extension candidates. Maximal degree in co-relation 24560. Up to 7816 conditions per place. [2023-08-26 07:51:38,122 INFO L140 encePairwiseOnDemand]: 428/458 looper letters, 307 selfloop transitions, 51 changer transitions 0/369 dead transitions. [2023-08-26 07:51:38,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 369 transitions, 1557 flow [2023-08-26 07:51:38,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:51:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:51:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1366 transitions. [2023-08-26 07:51:38,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49708879184861715 [2023-08-26 07:51:38,125 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1366 transitions. [2023-08-26 07:51:38,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1366 transitions. [2023-08-26 07:51:38,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:38,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1366 transitions. [2023-08-26 07:51:38,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 227.66666666666666) internal successors, (1366), 6 states have internal predecessors, (1366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:38,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:38,132 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:38,132 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 300 flow. Second operand 6 states and 1366 transitions. [2023-08-26 07:51:38,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 369 transitions, 1557 flow [2023-08-26 07:51:38,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 369 transitions, 1543 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 07:51:38,137 INFO L231 Difference]: Finished difference. Result has 136 places, 170 transitions, 640 flow [2023-08-26 07:51:38,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=640, PETRI_PLACES=136, PETRI_TRANSITIONS=170} [2023-08-26 07:51:38,138 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2023-08-26 07:51:38,138 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 170 transitions, 640 flow [2023-08-26 07:51:38,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:38,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:38,138 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:38,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-26 07:51:38,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:38,344 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:38,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1313135074, now seen corresponding path program 1 times [2023-08-26 07:51:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426816430] [2023-08-26 07:51:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:38,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:38,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426816430] [2023-08-26 07:51:38,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426816430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:38,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145576310] [2023-08-26 07:51:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:38,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:38,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:38,453 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 07:51:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:38,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 07:51:38,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:38,558 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:38,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:51:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 07:51:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145576310] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:51:38,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:51:38,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 07:51:38,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061872538] [2023-08-26 07:51:38,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:51:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 07:51:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 07:51:38,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 07:51:38,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:38,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 170 transitions, 640 flow. Second operand has 12 states, 12 states have (on average 237.58333333333334) internal successors, (2851), 12 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:38,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:38,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:38,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:39,218 INFO L124 PetriNetUnfolderBase]: 1809/6006 cut-off events. [2023-08-26 07:51:39,219 INFO L125 PetriNetUnfolderBase]: For 1203/1312 co-relation queries the response was YES. [2023-08-26 07:51:39,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11966 conditions, 6006 events. 1809/6006 cut-off events. For 1203/1312 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 52877 event pairs, 958 based on Foata normal form. 48/5498 useless extension candidates. Maximal degree in co-relation 11908. Up to 2949 conditions per place. [2023-08-26 07:51:39,244 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 63 selfloop transitions, 11 changer transitions 0/176 dead transitions. [2023-08-26 07:51:39,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 176 transitions, 824 flow [2023-08-26 07:51:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:51:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:51:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2898 transitions. [2023-08-26 07:51:39,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527292576419214 [2023-08-26 07:51:39,249 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2898 transitions. [2023-08-26 07:51:39,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2898 transitions. [2023-08-26 07:51:39,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:39,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2898 transitions. [2023-08-26 07:51:39,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 241.5) internal successors, (2898), 12 states have internal predecessors, (2898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:39,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:39,260 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:39,260 INFO L175 Difference]: Start difference. First operand has 136 places, 170 transitions, 640 flow. Second operand 12 states and 2898 transitions. [2023-08-26 07:51:39,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 176 transitions, 824 flow [2023-08-26 07:51:39,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 176 transitions, 824 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 07:51:39,268 INFO L231 Difference]: Finished difference. Result has 153 places, 176 transitions, 724 flow [2023-08-26 07:51:39,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=724, PETRI_PLACES=153, PETRI_TRANSITIONS=176} [2023-08-26 07:51:39,268 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 39 predicate places. [2023-08-26 07:51:39,268 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 176 transitions, 724 flow [2023-08-26 07:51:39,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 237.58333333333334) internal successors, (2851), 12 states have internal predecessors, (2851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:39,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:39,269 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:39,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 07:51:39,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:39,475 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:39,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 103374142, now seen corresponding path program 2 times [2023-08-26 07:51:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120550845] [2023-08-26 07:51:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:39,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:39,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:39,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120550845] [2023-08-26 07:51:39,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120550845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:51:39,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:51:39,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:51:39,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938349208] [2023-08-26 07:51:39,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:51:39,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:51:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:51:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:51:39,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 458 [2023-08-26 07:51:39,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 176 transitions, 724 flow. Second operand has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:39,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 458 [2023-08-26 07:51:39,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:40,868 INFO L124 PetriNetUnfolderBase]: 4737/11594 cut-off events. [2023-08-26 07:51:40,868 INFO L125 PetriNetUnfolderBase]: For 3960/3986 co-relation queries the response was YES. [2023-08-26 07:51:40,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27064 conditions, 11594 events. 4737/11594 cut-off events. For 3960/3986 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 101297 event pairs, 1238 based on Foata normal form. 0/10536 useless extension candidates. Maximal degree in co-relation 26981. Up to 6816 conditions per place. [2023-08-26 07:51:40,929 INFO L140 encePairwiseOnDemand]: 448/458 looper letters, 285 selfloop transitions, 23 changer transitions 2/368 dead transitions. [2023-08-26 07:51:40,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 368 transitions, 1983 flow [2023-08-26 07:51:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 07:51:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 07:51:40,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1952 transitions. [2023-08-26 07:51:40,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262008733624454 [2023-08-26 07:51:40,934 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1952 transitions. [2023-08-26 07:51:40,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1952 transitions. [2023-08-26 07:51:40,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:40,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1952 transitions. [2023-08-26 07:51:40,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 195.2) internal successors, (1952), 10 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:40,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:40,944 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 458.0) internal successors, (5038), 11 states have internal predecessors, (5038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:40,944 INFO L175 Difference]: Start difference. First operand has 153 places, 176 transitions, 724 flow. Second operand 10 states and 1952 transitions. [2023-08-26 07:51:40,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 368 transitions, 1983 flow [2023-08-26 07:51:40,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 368 transitions, 1935 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 07:51:40,969 INFO L231 Difference]: Finished difference. Result has 164 places, 200 transitions, 864 flow [2023-08-26 07:51:40,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=864, PETRI_PLACES=164, PETRI_TRANSITIONS=200} [2023-08-26 07:51:40,970 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 50 predicate places. [2023-08-26 07:51:40,970 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 200 transitions, 864 flow [2023-08-26 07:51:40,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:40,971 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:40,971 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:40,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 07:51:40,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:40,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash -569470292, now seen corresponding path program 1 times [2023-08-26 07:51:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:40,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520485237] [2023-08-26 07:51:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:40,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:41,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520485237] [2023-08-26 07:51:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520485237] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152882843] [2023-08-26 07:51:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:41,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:41,098 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:41,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 07:51:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:41,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 07:51:41,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:41,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:51:41,211 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:41,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152882843] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:51:41,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:51:41,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-26 07:51:41,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364677100] [2023-08-26 07:51:41,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:51:41,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 07:51:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 07:51:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 07:51:41,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 458 [2023-08-26 07:51:41,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 200 transitions, 864 flow. Second operand has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:41,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:41,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 458 [2023-08-26 07:51:41,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:51:41,281 INFO L124 PetriNetUnfolderBase]: 77/323 cut-off events. [2023-08-26 07:51:41,281 INFO L125 PetriNetUnfolderBase]: For 403/407 co-relation queries the response was YES. [2023-08-26 07:51:41,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 323 events. 77/323 cut-off events. For 403/407 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1017 event pairs, 20 based on Foata normal form. 35/346 useless extension candidates. Maximal degree in co-relation 919. Up to 153 conditions per place. [2023-08-26 07:51:41,282 INFO L140 encePairwiseOnDemand]: 455/458 looper letters, 69 selfloop transitions, 2 changer transitions 2/101 dead transitions. [2023-08-26 07:51:41,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 101 transitions, 605 flow [2023-08-26 07:51:41,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 07:51:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 07:51:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 992 transitions. [2023-08-26 07:51:41,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414847161572053 [2023-08-26 07:51:41,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 992 transitions. [2023-08-26 07:51:41,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 992 transitions. [2023-08-26 07:51:41,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:51:41,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 992 transitions. [2023-08-26 07:51:41,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:41,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:41,289 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:41,289 INFO L175 Difference]: Start difference. First operand has 164 places, 200 transitions, 864 flow. Second operand 4 states and 992 transitions. [2023-08-26 07:51:41,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 101 transitions, 605 flow [2023-08-26 07:51:41,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 101 transitions, 521 flow, removed 18 selfloop flow, removed 12 redundant places. [2023-08-26 07:51:41,292 INFO L231 Difference]: Finished difference. Result has 91 places, 74 transitions, 285 flow [2023-08-26 07:51:41,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=91, PETRI_TRANSITIONS=74} [2023-08-26 07:51:41,293 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -23 predicate places. [2023-08-26 07:51:41,293 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 74 transitions, 285 flow [2023-08-26 07:51:41,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 238.71428571428572) internal successors, (1671), 7 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:41,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:51:41,294 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:51:41,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 07:51:41,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:41,499 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:51:41,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:51:41,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1898551044, now seen corresponding path program 1 times [2023-08-26 07:51:41,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:51:41,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031673421] [2023-08-26 07:51:41,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:41,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:51:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:41,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:51:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031673421] [2023-08-26 07:51:41,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031673421] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:51:41,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242243150] [2023-08-26 07:51:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:51:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:51:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:51:41,750 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:51:41,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 07:51:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:51:41,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 07:51:41,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:51:41,855 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:51:41,924 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:51:41,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:51:41,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:51:41,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:51:42,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-08-26 07:51:42,027 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:51:42,027 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:51:48,062 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_405) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 07:51:48,074 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_405) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 07:51:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:51:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242243150] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:51:48,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:51:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-26 07:51:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68143254] [2023-08-26 07:51:48,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:51:48,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 07:51:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:51:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 07:51:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=5, NotChecked=42, Total=182 [2023-08-26 07:51:48,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 458 [2023-08-26 07:51:48,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 74 transitions, 285 flow. Second operand has 14 states, 14 states have (on average 171.57142857142858) internal successors, (2402), 14 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:51:48,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:51:48,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 458 [2023-08-26 07:51:48,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:04,273 WARN L234 SmtUtils]: Spent 12.03s on a formula simplification. DAG size of input: 25 DAG size of output: 20 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:52:06,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:52:08,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:52:10,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:52:12,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 07:52:12,478 INFO L124 PetriNetUnfolderBase]: 136/391 cut-off events. [2023-08-26 07:52:12,478 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2023-08-26 07:52:12,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 391 events. 136/391 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1114 event pairs, 12 based on Foata normal form. 3/377 useless extension candidates. Maximal degree in co-relation 1087. Up to 213 conditions per place. [2023-08-26 07:52:12,480 INFO L140 encePairwiseOnDemand]: 449/458 looper letters, 80 selfloop transitions, 13 changer transitions 0/99 dead transitions. [2023-08-26 07:52:12,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 99 transitions, 554 flow [2023-08-26 07:52:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 07:52:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 07:52:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1261 transitions. [2023-08-26 07:52:12,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39332501559575794 [2023-08-26 07:52:12,483 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1261 transitions. [2023-08-26 07:52:12,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1261 transitions. [2023-08-26 07:52:12,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:12,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1261 transitions. [2023-08-26 07:52:12,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:12,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:12,490 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:12,490 INFO L175 Difference]: Start difference. First operand has 91 places, 74 transitions, 285 flow. Second operand 7 states and 1261 transitions. [2023-08-26 07:52:12,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 99 transitions, 554 flow [2023-08-26 07:52:12,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 99 transitions, 537 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 07:52:12,493 INFO L231 Difference]: Finished difference. Result has 96 places, 78 transitions, 346 flow [2023-08-26 07:52:12,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=96, PETRI_TRANSITIONS=78} [2023-08-26 07:52:12,493 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -18 predicate places. [2023-08-26 07:52:12,493 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 78 transitions, 346 flow [2023-08-26 07:52:12,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 171.57142857142858) internal successors, (2402), 14 states have internal predecessors, (2402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:12,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:12,495 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:12,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-26 07:52:12,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:12,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:52:12,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 623640413, now seen corresponding path program 1 times [2023-08-26 07:52:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:12,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37909763] [2023-08-26 07:52:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:13,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:13,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37909763] [2023-08-26 07:52:13,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37909763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:13,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:52:13,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:52:13,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051237114] [2023-08-26 07:52:13,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:13,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:52:13,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:13,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:52:13,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:52:13,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 458 [2023-08-26 07:52:13,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 78 transitions, 346 flow. Second operand has 6 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:13,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 458 [2023-08-26 07:52:13,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:13,158 INFO L124 PetriNetUnfolderBase]: 134/387 cut-off events. [2023-08-26 07:52:13,158 INFO L125 PetriNetUnfolderBase]: For 443/449 co-relation queries the response was YES. [2023-08-26 07:52:13,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 387 events. 134/387 cut-off events. For 443/449 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1105 event pairs, 102 based on Foata normal form. 2/385 useless extension candidates. Maximal degree in co-relation 1129. Up to 328 conditions per place. [2023-08-26 07:52:13,159 INFO L140 encePairwiseOnDemand]: 452/458 looper letters, 74 selfloop transitions, 5 changer transitions 0/85 dead transitions. [2023-08-26 07:52:13,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 85 transitions, 538 flow [2023-08-26 07:52:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:52:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:52:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1057 transitions. [2023-08-26 07:52:13,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3846433770014556 [2023-08-26 07:52:13,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1057 transitions. [2023-08-26 07:52:13,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1057 transitions. [2023-08-26 07:52:13,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:13,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1057 transitions. [2023-08-26 07:52:13,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.16666666666666) internal successors, (1057), 6 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,166 INFO L175 Difference]: Start difference. First operand has 96 places, 78 transitions, 346 flow. Second operand 6 states and 1057 transitions. [2023-08-26 07:52:13,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 85 transitions, 538 flow [2023-08-26 07:52:13,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 85 transitions, 527 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-26 07:52:13,169 INFO L231 Difference]: Finished difference. Result has 97 places, 77 transitions, 343 flow [2023-08-26 07:52:13,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=343, PETRI_PLACES=97, PETRI_TRANSITIONS=77} [2023-08-26 07:52:13,170 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -17 predicate places. [2023-08-26 07:52:13,170 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 77 transitions, 343 flow [2023-08-26 07:52:13,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.33333333333334) internal successors, (1022), 6 states have internal predecessors, (1022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:13,171 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:13,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 07:52:13,171 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:52:13,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2115943681, now seen corresponding path program 1 times [2023-08-26 07:52:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858943921] [2023-08-26 07:52:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858943921] [2023-08-26 07:52:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858943921] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 07:52:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 07:52:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 07:52:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672412716] [2023-08-26 07:52:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 07:52:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 07:52:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 07:52:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 07:52:13,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 458 [2023-08-26 07:52:13,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 77 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:13,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 458 [2023-08-26 07:52:13,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:13,534 INFO L124 PetriNetUnfolderBase]: 132/382 cut-off events. [2023-08-26 07:52:13,534 INFO L125 PetriNetUnfolderBase]: For 404/410 co-relation queries the response was YES. [2023-08-26 07:52:13,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 382 events. 132/382 cut-off events. For 404/410 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1087 event pairs, 102 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 1119. Up to 328 conditions per place. [2023-08-26 07:52:13,535 INFO L140 encePairwiseOnDemand]: 452/458 looper letters, 73 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2023-08-26 07:52:13,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 84 transitions, 533 flow [2023-08-26 07:52:13,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 07:52:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 07:52:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions. [2023-08-26 07:52:13,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38427947598253276 [2023-08-26 07:52:13,538 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions. [2023-08-26 07:52:13,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions. [2023-08-26 07:52:13,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:52:13,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions. [2023-08-26 07:52:13,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,542 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,542 INFO L175 Difference]: Start difference. First operand has 97 places, 77 transitions, 343 flow. Second operand 6 states and 1056 transitions. [2023-08-26 07:52:13,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 84 transitions, 533 flow [2023-08-26 07:52:13,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 84 transitions, 523 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:52:13,545 INFO L231 Difference]: Finished difference. Result has 96 places, 76 transitions, 341 flow [2023-08-26 07:52:13,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=341, PETRI_PLACES=96, PETRI_TRANSITIONS=76} [2023-08-26 07:52:13,546 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -18 predicate places. [2023-08-26 07:52:13,546 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 76 transitions, 341 flow [2023-08-26 07:52:13,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:13,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:52:13,546 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:52:13,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 07:52:13,546 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:52:13,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:52:13,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1789778170, now seen corresponding path program 1 times [2023-08-26 07:52:13,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:52:13,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89488243] [2023-08-26 07:52:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:52:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:52:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89488243] [2023-08-26 07:52:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89488243] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:52:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459973928] [2023-08-26 07:52:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:52:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:52:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:52:13,965 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:52:13,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 07:52:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:52:14,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-26 07:52:14,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:52:14,078 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:52:14,139 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:52:14,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:52:14,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:52:14,268 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:52:14,396 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:52:19,263 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:52:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:52:19,281 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:52:29,124 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:52:31,171 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_697 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_697)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:52:45,437 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_697 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_142| Int) (v_ArrVal_693 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_142|)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_693) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_142| v_ArrVal_697) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_141|)))) is different from false [2023-08-26 07:52:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 07:52:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459973928] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:52:45,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:52:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 21 [2023-08-26 07:52:45,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805006724] [2023-08-26 07:52:45,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:52:45,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-26 07:52:45,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:52:45,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-26 07:52:45,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=283, Unknown=17, NotChecked=114, Total=506 [2023-08-26 07:52:45,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 458 [2023-08-26 07:52:45,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 76 transitions, 341 flow. Second operand has 23 states, 23 states have (on average 168.0) internal successors, (3864), 23 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:52:45,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:52:45,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 458 [2023-08-26 07:52:45,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:52:46,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:47,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:48,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:51,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:52,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:53,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:54,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:55,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:52:56,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:04,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:05,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:06,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:10,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:11,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:12,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:13,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:18,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:19,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:20,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:22,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:23,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:24,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:25,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:26,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:28,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:29,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:30,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:31,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:35,598 INFO L124 PetriNetUnfolderBase]: 226/671 cut-off events. [2023-08-26 07:53:35,599 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2023-08-26 07:53:35,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1917 conditions, 671 events. 226/671 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2155 event pairs, 19 based on Foata normal form. 4/674 useless extension candidates. Maximal degree in co-relation 1893. Up to 236 conditions per place. [2023-08-26 07:53:35,602 INFO L140 encePairwiseOnDemand]: 448/458 looper letters, 130 selfloop transitions, 24 changer transitions 0/160 dead transitions. [2023-08-26 07:53:35,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 925 flow [2023-08-26 07:53:35,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 07:53:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 07:53:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2091 transitions. [2023-08-26 07:53:35,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3804585152838428 [2023-08-26 07:53:35,608 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2091 transitions. [2023-08-26 07:53:35,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2091 transitions. [2023-08-26 07:53:35,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:53:35,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2091 transitions. [2023-08-26 07:53:35,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 174.25) internal successors, (2091), 12 states have internal predecessors, (2091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:35,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:35,617 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 458.0) internal successors, (5954), 13 states have internal predecessors, (5954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:35,617 INFO L175 Difference]: Start difference. First operand has 96 places, 76 transitions, 341 flow. Second operand 12 states and 2091 transitions. [2023-08-26 07:53:35,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 925 flow [2023-08-26 07:53:35,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 160 transitions, 905 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-26 07:53:35,621 INFO L231 Difference]: Finished difference. Result has 108 places, 90 transitions, 494 flow [2023-08-26 07:53:35,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=494, PETRI_PLACES=108, PETRI_TRANSITIONS=90} [2023-08-26 07:53:35,622 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, -6 predicate places. [2023-08-26 07:53:35,622 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 90 transitions, 494 flow [2023-08-26 07:53:35,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 168.0) internal successors, (3864), 23 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:35,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:53:35,623 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:53:35,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 07:53:35,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 07:53:35,828 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:53:35,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:53:35,829 INFO L85 PathProgramCache]: Analyzing trace with hash 313595538, now seen corresponding path program 1 times [2023-08-26 07:53:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:53:35,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75344331] [2023-08-26 07:53:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:35,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:53:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:53:36,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75344331] [2023-08-26 07:53:36,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75344331] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:53:36,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710122781] [2023-08-26 07:53:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:53:36,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:53:36,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:53:36,293 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:53:36,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 07:53:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:53:36,439 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 07:53:36,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:53:36,447 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:53:36,491 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:53:36,492 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:53:36,506 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:53:36,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:53:36,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:53:36,897 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 07:53:41,202 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-08-26 07:53:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:53:41,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:53:51,176 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145|) 0))) is different from false [2023-08-26 07:53:53,212 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145|) 0))) is different from false [2023-08-26 07:53:55,297 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (v_ArrVal_877 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145|) 0))) is different from false [2023-08-26 07:53:55,464 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146| Int) (v_ArrVal_877 Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146|)))) is different from false [2023-08-26 07:53:55,482 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146| Int) (v_ArrVal_877 Int) (v_ArrVal_873 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_873))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146| v_ArrVal_877))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_145| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_146|)))) is different from false [2023-08-26 07:53:55,580 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 07:53:55,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710122781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:53:55,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:53:55,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2023-08-26 07:53:55,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86129771] [2023-08-26 07:53:55,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:53:55,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 07:53:55,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:53:55,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 07:53:55,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=265, Unknown=13, NotChecked=190, Total=552 [2023-08-26 07:53:55,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 458 [2023-08-26 07:53:55,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 90 transitions, 494 flow. Second operand has 24 states, 24 states have (on average 168.04166666666666) internal successors, (4033), 24 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:53:55,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:53:55,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 458 [2023-08-26 07:53:55,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:53:56,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:57,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:53:58,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:01,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:03,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:04,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:05,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:07,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:08,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:13,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:14,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:15,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:16,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:18,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:19,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:20,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:21,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:22,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:23,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:27,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:28,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:29,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:30,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:31,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:32,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:33,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:34,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:35,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:36,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:37,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:41,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:42,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:44,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:45,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:47,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:48,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:52,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:53,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:55,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:54:56,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:01,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:02,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:03,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:10,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:11,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:55:21,553 INFO L124 PetriNetUnfolderBase]: 272/849 cut-off events. [2023-08-26 07:55:21,553 INFO L125 PetriNetUnfolderBase]: For 1144/1152 co-relation queries the response was YES. [2023-08-26 07:55:21,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 849 events. 272/849 cut-off events. For 1144/1152 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3217 event pairs, 15 based on Foata normal form. 5/853 useless extension candidates. Maximal degree in co-relation 2597. Up to 203 conditions per place. [2023-08-26 07:55:21,558 INFO L140 encePairwiseOnDemand]: 447/458 looper letters, 154 selfloop transitions, 33 changer transitions 0/193 dead transitions. [2023-08-26 07:55:21,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 193 transitions, 1204 flow [2023-08-26 07:55:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 07:55:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 07:55:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2442 transitions. [2023-08-26 07:55:21,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3808484092326887 [2023-08-26 07:55:21,563 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2442 transitions. [2023-08-26 07:55:21,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2442 transitions. [2023-08-26 07:55:21,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:55:21,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2442 transitions. [2023-08-26 07:55:21,567 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 174.42857142857142) internal successors, (2442), 14 states have internal predecessors, (2442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:55:21,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 458.0) internal successors, (6870), 15 states have internal predecessors, (6870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:55:21,573 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 458.0) internal successors, (6870), 15 states have internal predecessors, (6870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:55:21,573 INFO L175 Difference]: Start difference. First operand has 108 places, 90 transitions, 494 flow. Second operand 14 states and 2442 transitions. [2023-08-26 07:55:21,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 193 transitions, 1204 flow [2023-08-26 07:55:21,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 193 transitions, 1155 flow, removed 19 selfloop flow, removed 3 redundant places. [2023-08-26 07:55:21,579 INFO L231 Difference]: Finished difference. Result has 127 places, 104 transitions, 683 flow [2023-08-26 07:55:21,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=683, PETRI_PLACES=127, PETRI_TRANSITIONS=104} [2023-08-26 07:55:21,580 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 13 predicate places. [2023-08-26 07:55:21,580 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 104 transitions, 683 flow [2023-08-26 07:55:21,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 168.04166666666666) internal successors, (4033), 24 states have internal predecessors, (4033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:55:21,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:55:21,581 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:55:21,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 07:55:21,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-26 07:55:21,809 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:55:21,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:55:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -851917634, now seen corresponding path program 2 times [2023-08-26 07:55:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:55:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285677855] [2023-08-26 07:55:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:55:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:55:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:55:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:55:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:55:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285677855] [2023-08-26 07:55:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285677855] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:55:22,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513561518] [2023-08-26 07:55:22,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:55:22,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:55:22,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:55:22,693 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:55:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 07:55:22,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:55:22,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:55:22,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 53 conjunts are in the unsatisfiable core [2023-08-26 07:55:22,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:55:22,880 INFO L322 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-26 07:55:22,880 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2023-08-26 07:55:22,964 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:55:22,964 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:55:22,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:55:23,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 07:55:23,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:55:23,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 07:55:23,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 07:55:23,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-08-26 07:55:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:55:23,878 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:55:39,961 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 07:55:41,998 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1154)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|)))) is different from false [2023-08-26 07:55:44,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 07:55:46,154 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int)) (or (forall ((v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_65| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_65| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2023-08-26 07:55:48,268 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int) (v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1149 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_65| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (< |v_t_funThread1of1ForFork0_~i~0#1_65| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1149)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 07:55:50,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int) (v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1149 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_65| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (< |v_t_funThread1of1ForFork0_~i~0#1_65| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) v_ArrVal_1149) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 07:55:52,615 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int) (v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1149 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_65| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (< |v_t_funThread1of1ForFork0_~i~0#1_65| 1) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (store (select |c_#memory_int| |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1149) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0)))) is different from false [2023-08-26 07:55:52,642 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_65| Int) (v_ArrVal_1154 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| Int) (v_ArrVal_1146 (Array Int Int)) (v_ArrVal_1149 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_65| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150|) (< |v_t_funThread1of1ForFork0_~i~0#1_65| 1) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1146) |c_~#cache~0.base|) |c_~#cache~0.offset| v_ArrVal_1149) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_150| v_ArrVal_1154) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_149|) 0)))) is different from false [2023-08-26 07:55:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 37 not checked. [2023-08-26 07:55:52,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513561518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:55:52,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:55:52,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 34 [2023-08-26 07:55:52,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720018073] [2023-08-26 07:55:52,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:55:52,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-26 07:55:52,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:55:52,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-26 07:55:52,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=618, Unknown=15, NotChecked=472, Total=1260 [2023-08-26 07:55:52,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 458 [2023-08-26 07:55:52,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 104 transitions, 683 flow. Second operand has 36 states, 36 states have (on average 168.66666666666666) internal successors, (6072), 36 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:55:52,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:55:52,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 458 [2023-08-26 07:55:52,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:56:11,171 INFO L124 PetriNetUnfolderBase]: 592/1761 cut-off events. [2023-08-26 07:56:11,171 INFO L125 PetriNetUnfolderBase]: For 3450/3458 co-relation queries the response was YES. [2023-08-26 07:56:11,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5985 conditions, 1761 events. 592/1761 cut-off events. For 3450/3458 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7737 event pairs, 50 based on Foata normal form. 11/1770 useless extension candidates. Maximal degree in co-relation 5945. Up to 422 conditions per place. [2023-08-26 07:56:11,179 INFO L140 encePairwiseOnDemand]: 446/458 looper letters, 292 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2023-08-26 07:56:11,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 395 transitions, 2793 flow [2023-08-26 07:56:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-26 07:56:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-26 07:56:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 5715 transitions. [2023-08-26 07:56:11,187 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3781262405716554 [2023-08-26 07:56:11,187 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 5715 transitions. [2023-08-26 07:56:11,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 5715 transitions. [2023-08-26 07:56:11,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 07:56:11,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 5715 transitions. [2023-08-26 07:56:11,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 173.1818181818182) internal successors, (5715), 33 states have internal predecessors, (5715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:56:11,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 458.0) internal successors, (15572), 34 states have internal predecessors, (15572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:56:11,207 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 458.0) internal successors, (15572), 34 states have internal predecessors, (15572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:56:11,207 INFO L175 Difference]: Start difference. First operand has 127 places, 104 transitions, 683 flow. Second operand 33 states and 5715 transitions. [2023-08-26 07:56:11,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 395 transitions, 2793 flow [2023-08-26 07:56:11,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 395 transitions, 2714 flow, removed 20 selfloop flow, removed 6 redundant places. [2023-08-26 07:56:11,218 INFO L231 Difference]: Finished difference. Result has 163 places, 177 transitions, 1540 flow [2023-08-26 07:56:11,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=1540, PETRI_PLACES=163, PETRI_TRANSITIONS=177} [2023-08-26 07:56:11,218 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 49 predicate places. [2023-08-26 07:56:11,218 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 177 transitions, 1540 flow [2023-08-26 07:56:11,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 168.66666666666666) internal successors, (6072), 36 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:56:11,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 07:56:11,220 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 07:56:11,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 07:56:11,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 07:56:11,425 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr4ASSERT_VIOLATIONDATA_RACE, t_funErr1ASSERT_VIOLATIONDATA_RACE, t_funErr3ASSERT_VIOLATIONDATA_RACE, t_funErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-08-26 07:56:11,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 07:56:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1452183008, now seen corresponding path program 2 times [2023-08-26 07:56:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 07:56:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535138590] [2023-08-26 07:56:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 07:56:11,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 07:56:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 07:56:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 07:56:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535138590] [2023-08-26 07:56:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535138590] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 07:56:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204978567] [2023-08-26 07:56:12,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 07:56:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 07:56:12,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 07:56:12,296 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 07:56:12,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 07:56:12,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 07:56:12,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 07:56:12,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-26 07:56:12,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 07:56:12,510 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 07:56:12,556 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 07:56:12,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 07:56:12,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 07:56:12,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2023-08-26 07:56:12,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-08-26 07:56:12,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2023-08-26 07:56:12,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 07:56:13,093 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-08-26 07:56:24,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-08-26 07:56:24,804 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 07:56:24,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 07:56:40,831 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:56:42,862 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1435)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|)))) is different from false [2023-08-26 07:57:05,092 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int)) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:57:05,101 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)) (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:57:05,108 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem38#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:57:05,133 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (store (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:57:07,171 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:57:07,181 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)) (= (select (store (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0))) is different from false [2023-08-26 07:57:07,208 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (store (select (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (let ((.cse1 (select .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse2 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse1 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:57:25,725 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1426 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1435 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| Int) (v_ArrVal_1429 (Array Int Int))) (or (= (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1426))) (let ((.cse1 (select .cse0 |c_~#cache~0.base|))) (let ((.cse2 (select .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (store (select (store (store .cse0 |c_~#cache~0.base| (store .cse1 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ .cse2 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1429) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse2)))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156| v_ArrVal_1435) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_155| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_156|)))) is different from false [2023-08-26 07:57:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 35 not checked. [2023-08-26 07:57:25,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204978567] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 07:57:25,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 07:57:25,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 39 [2023-08-26 07:57:25,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008044673] [2023-08-26 07:57:25,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 07:57:25,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-08-26 07:57:25,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 07:57:25,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-08-26 07:57:25,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=735, Unknown=55, NotChecked=670, Total=1640 [2023-08-26 07:57:25,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 458 [2023-08-26 07:57:25,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 177 transitions, 1540 flow. Second operand has 41 states, 41 states have (on average 162.0731707317073) internal successors, (6645), 41 states have internal predecessors, (6645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 07:57:25,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 07:57:25,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 458 [2023-08-26 07:57:25,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 07:57:27,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:28,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:29,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:39,380 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 39 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 07:57:41,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-26 07:57:43,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:44,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:46,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:47,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:48,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:50,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:55,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:57:56,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:01,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:03,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:04,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:05,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:07,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:08,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:10,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:11,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:16,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:18,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:25,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:26,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:28,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:29,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:30,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:32,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:33,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:35,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:39,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:40,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:42,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:43,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:45,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:50,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:51,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:52,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:58:54,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:01,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:03,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:04,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:06,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:07,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:09,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:10,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:11,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:13,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:14,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:19,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:21,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:28,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:43,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 07:59:48,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:00:02,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:00:19,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:00:21,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:00:31,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:00:46,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:02,868 WARN L234 SmtUtils]: Spent 6.05s on a formula simplification. DAG size of input: 68 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:01:10,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:11,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:19,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:20,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:21,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:23,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:26,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:28,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:29,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:30,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:32,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:33,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:34,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:35,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:36,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:38,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:39,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:41,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:01:43,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:02:20,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 08:03:02,521 WARN L234 SmtUtils]: Spent 9.16s on a formula simplification. DAG size of input: 76 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 08:03:16,714 INFO L124 PetriNetUnfolderBase]: 599/1799 cut-off events. [2023-08-26 08:03:16,715 INFO L125 PetriNetUnfolderBase]: For 6204/6206 co-relation queries the response was YES. [2023-08-26 08:03:16,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7167 conditions, 1799 events. 599/1799 cut-off events. For 6204/6206 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 8033 event pairs, 50 based on Foata normal form. 3/1801 useless extension candidates. Maximal degree in co-relation 7119. Up to 332 conditions per place. [2023-08-26 08:03:16,721 INFO L140 encePairwiseOnDemand]: 436/458 looper letters, 0 selfloop transitions, 0 changer transitions 288/288 dead transitions. [2023-08-26 08:03:16,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 288 transitions, 2927 flow [2023-08-26 08:03:16,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-26 08:03:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-26 08:03:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 4376 transitions. [2023-08-26 08:03:16,725 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35387352417920104 [2023-08-26 08:03:16,725 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 4376 transitions. [2023-08-26 08:03:16,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 4376 transitions. [2023-08-26 08:03:16,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:16,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 4376 transitions. [2023-08-26 08:03:16,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 162.07407407407408) internal successors, (4376), 27 states have internal predecessors, (4376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:16,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 458.0) internal successors, (12824), 28 states have internal predecessors, (12824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:16,736 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 458.0) internal successors, (12824), 28 states have internal predecessors, (12824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:16,736 INFO L175 Difference]: Start difference. First operand has 163 places, 177 transitions, 1540 flow. Second operand 27 states and 4376 transitions. [2023-08-26 08:03:16,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 288 transitions, 2927 flow [2023-08-26 08:03:16,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 288 transitions, 2542 flow, removed 128 selfloop flow, removed 11 redundant places. [2023-08-26 08:03:16,751 INFO L231 Difference]: Finished difference. Result has 177 places, 0 transitions, 0 flow [2023-08-26 08:03:16,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1252, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=0, PETRI_PLACES=177, PETRI_TRANSITIONS=0} [2023-08-26 08:03:16,751 INFO L281 CegarLoopForPetriNet]: 114 programPoint places, 63 predicate places. [2023-08-26 08:03:16,751 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 0 transitions, 0 flow [2023-08-26 08:03:16,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 162.0731707317073) internal successors, (6645), 41 states have internal predecessors, (6645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:16,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2023-08-26 08:03:16,754 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONASSERT (13 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (7 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONASSERT (4 of 19 remaining) [2023-08-26 08:03:16,755 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-08-26 08:03:16,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-08-26 08:03:16,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-08-26 08:03:16,756 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-08-26 08:03:16,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 08:03:16,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 08:03:16,961 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:16,963 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE,SAFE (1/2) [2023-08-26 08:03:16,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 245 places, 277 transitions, 562 flow [2023-08-26 08:03:16,988 INFO L124 PetriNetUnfolderBase]: 52/404 cut-off events. [2023-08-26 08:03:16,988 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 08:03:16,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 404 events. 52/404 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1739 event pairs, 0 based on Foata normal form. 0/329 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-26 08:03:16,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 245 places, 277 transitions, 562 flow [2023-08-26 08:03:16,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 241 places, 272 transitions, 549 flow [2023-08-26 08:03:16,990 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:03:16,990 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 241 places, 272 transitions, 549 flow [2023-08-26 08:03:16,991 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 241 places, 272 transitions, 549 flow [2023-08-26 08:03:16,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 272 transitions, 549 flow [2023-08-26 08:03:17,010 INFO L124 PetriNetUnfolderBase]: 51/399 cut-off events. [2023-08-26 08:03:17,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:03:17,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 399 events. 51/399 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1687 event pairs, 0 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 239. Up to 8 conditions per place. [2023-08-26 08:03:17,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 28462 [2023-08-26 08:03:19,415 INFO L134 LiptonReduction]: Checked pairs total: 106304 [2023-08-26 08:03:19,415 INFO L136 LiptonReduction]: Total number of compositions: 179 [2023-08-26 08:03:19,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-26 08:03:19,416 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;@77d1211c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:03:19,416 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-26 08:03:19,418 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:03:19,418 INFO L124 PetriNetUnfolderBase]: 6/30 cut-off events. [2023-08-26 08:03:19,418 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:03:19,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:19,418 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-26 08:03:19,418 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 08:03:19,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:19,418 INFO L85 PathProgramCache]: Analyzing trace with hash -102512566, now seen corresponding path program 1 times [2023-08-26 08:03:19,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:19,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2350677] [2023-08-26 08:03:19,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:19,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:19,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2350677] [2023-08-26 08:03:19,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2350677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:03:19,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:03:19,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:03:19,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123549959] [2023-08-26 08:03:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:03:19,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:03:19,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:19,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:03:19,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:03:19,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 456 [2023-08-26 08:03:19,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 135 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:19,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 456 [2023-08-26 08:03:19,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:19,550 INFO L124 PetriNetUnfolderBase]: 485/1719 cut-off events. [2023-08-26 08:03:19,551 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:03:19,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2632 conditions, 1719 events. 485/1719 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12072 event pairs, 399 based on Foata normal form. 191/1710 useless extension candidates. Maximal degree in co-relation 2535. Up to 906 conditions per place. [2023-08-26 08:03:19,553 INFO L140 encePairwiseOnDemand]: 431/456 looper letters, 26 selfloop transitions, 2 changer transitions 55/114 dead transitions. [2023-08-26 08:03:19,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 327 flow [2023-08-26 08:03:19,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:03:19,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:03:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 778 transitions. [2023-08-26 08:03:19,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5687134502923976 [2023-08-26 08:03:19,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 778 transitions. [2023-08-26 08:03:19,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 778 transitions. [2023-08-26 08:03:19,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:19,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 778 transitions. [2023-08-26 08:03:19,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 456.0) internal successors, (1824), 4 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,556 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 456.0) internal successors, (1824), 4 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,556 INFO L175 Difference]: Start difference. First operand has 112 places, 135 transitions, 275 flow. Second operand 3 states and 778 transitions. [2023-08-26 08:03:19,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 327 flow [2023-08-26 08:03:19,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:03:19,557 INFO L231 Difference]: Finished difference. Result has 114 places, 59 transitions, 133 flow [2023-08-26 08:03:19,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=456, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=114, PETRI_TRANSITIONS=59} [2023-08-26 08:03:19,558 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, 2 predicate places. [2023-08-26 08:03:19,558 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 59 transitions, 133 flow [2023-08-26 08:03:19,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:19,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:19,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 08:03:19,558 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 08:03:19,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1906305051, now seen corresponding path program 1 times [2023-08-26 08:03:19,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:19,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915439800] [2023-08-26 08:03:19,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:19,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:19,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915439800] [2023-08-26 08:03:19,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915439800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:19,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827570081] [2023-08-26 08:03:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:19,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:19,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:19,585 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:19,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-26 08:03:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:19,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:03:19,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:19,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:03:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:19,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827570081] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:03:19,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:03:19,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 08:03:19,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552769429] [2023-08-26 08:03:19,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:03:19,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:03:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:03:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:03:19,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 456 [2023-08-26 08:03:19,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 59 transitions, 133 flow. Second operand has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:19,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 456 [2023-08-26 08:03:19,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:19,769 INFO L124 PetriNetUnfolderBase]: 66/272 cut-off events. [2023-08-26 08:03:19,769 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 08:03:19,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 272 events. 66/272 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 927 event pairs, 57 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 427. Up to 147 conditions per place. [2023-08-26 08:03:19,769 INFO L140 encePairwiseOnDemand]: 453/456 looper letters, 26 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-26 08:03:19,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 207 flow [2023-08-26 08:03:19,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:03:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:03:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1450 transitions. [2023-08-26 08:03:19,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5299707602339181 [2023-08-26 08:03:19,771 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1450 transitions. [2023-08-26 08:03:19,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1450 transitions. [2023-08-26 08:03:19,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:19,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1450 transitions. [2023-08-26 08:03:19,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.66666666666666) internal successors, (1450), 6 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 456.0) internal successors, (3192), 7 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,774 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 456.0) internal successors, (3192), 7 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,774 INFO L175 Difference]: Start difference. First operand has 114 places, 59 transitions, 133 flow. Second operand 6 states and 1450 transitions. [2023-08-26 08:03:19,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 207 flow [2023-08-26 08:03:19,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 08:03:19,775 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 165 flow [2023-08-26 08:03:19,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=456, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2023-08-26 08:03:19,775 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -44 predicate places. [2023-08-26 08:03:19,775 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 165 flow [2023-08-26 08:03:19,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:19,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:19,776 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1] [2023-08-26 08:03:19,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-26 08:03:19,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 08:03:19,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 08:03:19,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:19,981 INFO L85 PathProgramCache]: Analyzing trace with hash 399881354, now seen corresponding path program 2 times [2023-08-26 08:03:19,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:19,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764238050] [2023-08-26 08:03:19,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:19,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:20,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764238050] [2023-08-26 08:03:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764238050] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027860568] [2023-08-26 08:03:20,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:03:20,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:20,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:20,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-26 08:03:20,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 08:03:20,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:03:20,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 08:03:20,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:20,147 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:03:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:20,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027860568] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:03:20,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:03:20,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 08:03:20,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861177023] [2023-08-26 08:03:20,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:03:20,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 08:03:20,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:20,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 08:03:20,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 08:03:20,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 456 [2023-08-26 08:03:20,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 165 flow. Second operand has 12 states, 12 states have (on average 237.25) internal successors, (2847), 12 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:20,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:20,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 456 [2023-08-26 08:03:20,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:20,271 INFO L124 PetriNetUnfolderBase]: 66/278 cut-off events. [2023-08-26 08:03:20,272 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-26 08:03:20,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 278 events. 66/278 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 932 event pairs, 57 based on Foata normal form. 6/251 useless extension candidates. Maximal degree in co-relation 418. Up to 147 conditions per place. [2023-08-26 08:03:20,272 INFO L140 encePairwiseOnDemand]: 453/456 looper letters, 26 selfloop transitions, 11 changer transitions 0/68 dead transitions. [2023-08-26 08:03:20,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 68 transitions, 275 flow [2023-08-26 08:03:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 08:03:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 08:03:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2875 transitions. [2023-08-26 08:03:20,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5254020467836257 [2023-08-26 08:03:20,275 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2875 transitions. [2023-08-26 08:03:20,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2875 transitions. [2023-08-26 08:03:20,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:20,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2875 transitions. [2023-08-26 08:03:20,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 239.58333333333334) internal successors, (2875), 12 states have internal predecessors, (2875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:20,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 456.0) internal successors, (5928), 13 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:20,282 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 456.0) internal successors, (5928), 13 states have internal predecessors, (5928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:20,282 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 165 flow. Second operand 12 states and 2875 transitions. [2023-08-26 08:03:20,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 68 transitions, 275 flow [2023-08-26 08:03:20,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 68 transitions, 261 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 08:03:20,283 INFO L231 Difference]: Finished difference. Result has 84 places, 68 transitions, 235 flow [2023-08-26 08:03:20,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=456, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=235, PETRI_PLACES=84, PETRI_TRANSITIONS=68} [2023-08-26 08:03:20,283 INFO L281 CegarLoopForPetriNet]: 112 programPoint places, -28 predicate places. [2023-08-26 08:03:20,283 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 68 transitions, 235 flow [2023-08-26 08:03:20,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 237.25) internal successors, (2847), 12 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:20,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:20,284 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1] [2023-08-26 08:03:20,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-26 08:03:20,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 08:03:20,489 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 08:03:20,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:20,489 INFO L85 PathProgramCache]: Analyzing trace with hash -135308566, now seen corresponding path program 3 times [2023-08-26 08:03:20,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:20,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165890061] [2023-08-26 08:03:20,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:20,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 08:03:20,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 08:03:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 08:03:20,523 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 08:03:20,524 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 08:03:20,524 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-26 08:03:20,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 08:03:20,524 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-08-26 08:03:20,524 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-26 08:03:20,525 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-26 08:03:20,525 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-26 08:03:20,553 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 08:03:20,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,605 INFO L124 PetriNetUnfolderBase]: 87/671 cut-off events. [2023-08-26 08:03:20,605 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 08:03:20,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 671 events. 87/671 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3598 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 406. Up to 12 conditions per place. [2023-08-26 08:03:20,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 08:03:20,615 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,615 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 386 transitions, 790 flow [2023-08-26 08:03:20,695 INFO L124 PetriNetUnfolderBase]: 87/671 cut-off events. [2023-08-26 08:03:20,696 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 08:03:20,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 671 events. 87/671 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3598 event pairs, 0 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 406. Up to 12 conditions per place. [2023-08-26 08:03:20,713 INFO L119 LiptonReduction]: Number of co-enabled transitions 82176 [2023-08-26 08:03:23,421 INFO L134 LiptonReduction]: Checked pairs total: 316590 [2023-08-26 08:03:23,422 INFO L136 LiptonReduction]: Total number of compositions: 246 [2023-08-26 08:03:23,422 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 08:03:23,423 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;@77d1211c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 08:03:23,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-26 08:03:23,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 08:03:23,428 INFO L124 PetriNetUnfolderBase]: 13/65 cut-off events. [2023-08-26 08:03:23,428 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 08:03:23,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:23,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:23,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:03:23,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:23,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1785209241, now seen corresponding path program 1 times [2023-08-26 08:03:23,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:23,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652775130] [2023-08-26 08:03:23,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:23,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:23,449 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-26 08:03:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652775130] [2023-08-26 08:03:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652775130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:03:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 08:03:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 08:03:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19960163] [2023-08-26 08:03:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:03:23,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:03:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:23,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:03:23,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 08:03:23,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 632 [2023-08-26 08:03:23,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 203 transitions, 424 flow. Second operand has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:23,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:23,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 632 [2023-08-26 08:03:23,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:26,278 INFO L124 PetriNetUnfolderBase]: 21133/47889 cut-off events. [2023-08-26 08:03:26,278 INFO L125 PetriNetUnfolderBase]: For 188/262 co-relation queries the response was YES. [2023-08-26 08:03:26,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78044 conditions, 47889 events. 21133/47889 cut-off events. For 188/262 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 521546 event pairs, 18392 based on Foata normal form. 5003/46253 useless extension candidates. Maximal degree in co-relation 33362. Up to 30031 conditions per place. [2023-08-26 08:03:26,441 INFO L140 encePairwiseOnDemand]: 597/632 looper letters, 71 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2023-08-26 08:03:26,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 172 transitions, 508 flow [2023-08-26 08:03:26,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:03:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:03:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1093 transitions. [2023-08-26 08:03:26,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5764767932489452 [2023-08-26 08:03:26,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1093 transitions. [2023-08-26 08:03:26,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1093 transitions. [2023-08-26 08:03:26,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:26,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1093 transitions. [2023-08-26 08:03:26,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:26,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:26,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:26,445 INFO L175 Difference]: Start difference. First operand has 167 places, 203 transitions, 424 flow. Second operand 3 states and 1093 transitions. [2023-08-26 08:03:26,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 172 transitions, 508 flow [2023-08-26 08:03:26,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 172 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 08:03:26,447 INFO L231 Difference]: Finished difference. Result has 170 places, 172 transitions, 372 flow [2023-08-26 08:03:26,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=632, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=372, PETRI_PLACES=170, PETRI_TRANSITIONS=172} [2023-08-26 08:03:26,448 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 3 predicate places. [2023-08-26 08:03:26,448 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 172 transitions, 372 flow [2023-08-26 08:03:26,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.6666666666667) internal successors, (992), 3 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:26,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:26,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:26,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 08:03:26,448 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:03:26,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1364708302, now seen corresponding path program 1 times [2023-08-26 08:03:26,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:26,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052860965] [2023-08-26 08:03:26,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:26,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:26,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:03:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052860965] [2023-08-26 08:03:26,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052860965] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:26,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710017138] [2023-08-26 08:03:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:26,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:26,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:26,487 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:26,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-26 08:03:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:26,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 08:03:26,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 08:03:26,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 08:03:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710017138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:03:26,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 08:03:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 08:03:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935172032] [2023-08-26 08:03:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:03:26,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:03:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:03:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:03:26,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 632 [2023-08-26 08:03:26,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 172 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:26,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:26,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 632 [2023-08-26 08:03:26,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:29,388 INFO L124 PetriNetUnfolderBase]: 20708/46996 cut-off events. [2023-08-26 08:03:29,388 INFO L125 PetriNetUnfolderBase]: For 166/313 co-relation queries the response was YES. [2023-08-26 08:03:29,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77162 conditions, 46996 events. 20708/46996 cut-off events. For 166/313 co-relation queries the response was YES. Maximal size of possible extension queue 1201. Compared 514400 event pairs, 8816 based on Foata normal form. 0/40571 useless extension candidates. Maximal degree in co-relation 77149. Up to 29989 conditions per place. [2023-08-26 08:03:29,586 INFO L140 encePairwiseOnDemand]: 629/632 looper letters, 93 selfloop transitions, 2 changer transitions 0/194 dead transitions. [2023-08-26 08:03:29,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 194 transitions, 606 flow [2023-08-26 08:03:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:03:29,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:03:29,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1082 transitions. [2023-08-26 08:03:29,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.570675105485232 [2023-08-26 08:03:29,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1082 transitions. [2023-08-26 08:03:29,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1082 transitions. [2023-08-26 08:03:29,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:29,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1082 transitions. [2023-08-26 08:03:29,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 360.6666666666667) internal successors, (1082), 3 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:29,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:29,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:29,592 INFO L175 Difference]: Start difference. First operand has 170 places, 172 transitions, 372 flow. Second operand 3 states and 1082 transitions. [2023-08-26 08:03:29,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 194 transitions, 606 flow [2023-08-26 08:03:29,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 194 transitions, 602 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 08:03:29,594 INFO L231 Difference]: Finished difference. Result has 172 places, 173 transitions, 380 flow [2023-08-26 08:03:29,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=632, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=172, PETRI_TRANSITIONS=173} [2023-08-26 08:03:29,598 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 5 predicate places. [2023-08-26 08:03:29,598 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 173 transitions, 380 flow [2023-08-26 08:03:29,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:29,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:29,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:29,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-26 08:03:29,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:29,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:03:29,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:29,804 INFO L85 PathProgramCache]: Analyzing trace with hash 2041767000, now seen corresponding path program 1 times [2023-08-26 08:03:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242567255] [2023-08-26 08:03:29,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:29,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:29,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 08:03:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242567255] [2023-08-26 08:03:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242567255] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835899919] [2023-08-26 08:03:29,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:29,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:29,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:29,843 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:29,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-26 08:03:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:29,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-26 08:03:29,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-26 08:03:29,963 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 08:03:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835899919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:03:29,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 08:03:29,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-26 08:03:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952702592] [2023-08-26 08:03:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:03:29,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 08:03:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:29,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 08:03:29,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 08:03:29,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 632 [2023-08-26 08:03:29,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 173 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:29,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:29,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 632 [2023-08-26 08:03:29,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:35,608 INFO L124 PetriNetUnfolderBase]: 36268/83476 cut-off events. [2023-08-26 08:03:35,608 INFO L125 PetriNetUnfolderBase]: For 1026/1026 co-relation queries the response was YES. [2023-08-26 08:03:35,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136798 conditions, 83476 events. 36268/83476 cut-off events. For 1026/1026 co-relation queries the response was YES. Maximal size of possible extension queue 1922. Compared 994852 event pairs, 18392 based on Foata normal form. 0/72411 useless extension candidates. Maximal degree in co-relation 136779. Up to 30012 conditions per place. [2023-08-26 08:03:36,004 INFO L140 encePairwiseOnDemand]: 629/632 looper letters, 130 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2023-08-26 08:03:36,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 231 transitions, 760 flow [2023-08-26 08:03:36,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 08:03:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 08:03:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1118 transitions. [2023-08-26 08:03:36,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5896624472573839 [2023-08-26 08:03:36,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1118 transitions. [2023-08-26 08:03:36,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1118 transitions. [2023-08-26 08:03:36,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:36,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1118 transitions. [2023-08-26 08:03:36,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:36,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:36,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 632.0) internal successors, (2528), 4 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:36,008 INFO L175 Difference]: Start difference. First operand has 172 places, 173 transitions, 380 flow. Second operand 3 states and 1118 transitions. [2023-08-26 08:03:36,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 231 transitions, 760 flow [2023-08-26 08:03:36,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 231 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:03:36,028 INFO L231 Difference]: Finished difference. Result has 174 places, 174 transitions, 390 flow [2023-08-26 08:03:36,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=632, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=174, PETRI_TRANSITIONS=174} [2023-08-26 08:03:36,028 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 7 predicate places. [2023-08-26 08:03:36,028 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 174 transitions, 390 flow [2023-08-26 08:03:36,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:36,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:36,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:36,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-26 08:03:36,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:36,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:03:36,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -500120535, now seen corresponding path program 1 times [2023-08-26 08:03:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921617019] [2023-08-26 08:03:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:03:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921617019] [2023-08-26 08:03:36,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921617019] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:36,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371346150] [2023-08-26 08:03:36,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:36,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:36,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:36,277 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:36,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-26 08:03:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:36,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 08:03:36,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:36,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:03:36,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:03:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:03:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371346150] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:03:36,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:03:36,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 08:03:36,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499937246] [2023-08-26 08:03:36,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:03:36,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:03:36,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:36,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:03:36,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 08:03:36,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 632 [2023-08-26 08:03:36,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 174 transitions, 390 flow. Second operand has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:36,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:36,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 632 [2023-08-26 08:03:36,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:03:42,324 INFO L124 PetriNetUnfolderBase]: 37028/84322 cut-off events. [2023-08-26 08:03:42,324 INFO L125 PetriNetUnfolderBase]: For 3844/3844 co-relation queries the response was YES. [2023-08-26 08:03:42,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139731 conditions, 84322 events. 37028/84322 cut-off events. For 3844/3844 co-relation queries the response was YES. Maximal size of possible extension queue 2000. Compared 996730 event pairs, 32414 based on Foata normal form. 3/73915 useless extension candidates. Maximal degree in co-relation 139702. Up to 52331 conditions per place. [2023-08-26 08:03:42,713 INFO L140 encePairwiseOnDemand]: 629/632 looper letters, 73 selfloop transitions, 5 changer transitions 0/177 dead transitions. [2023-08-26 08:03:42,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 177 transitions, 558 flow [2023-08-26 08:03:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:03:42,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:03:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2053 transitions. [2023-08-26 08:03:42,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5414029535864979 [2023-08-26 08:03:42,715 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2053 transitions. [2023-08-26 08:03:42,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2053 transitions. [2023-08-26 08:03:42,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:03:42,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2053 transitions. [2023-08-26 08:03:42,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:42,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 632.0) internal successors, (4424), 7 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:42,719 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 632.0) internal successors, (4424), 7 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:42,719 INFO L175 Difference]: Start difference. First operand has 174 places, 174 transitions, 390 flow. Second operand 6 states and 2053 transitions. [2023-08-26 08:03:42,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 177 transitions, 558 flow [2023-08-26 08:03:42,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 177 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 08:03:42,724 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 424 flow [2023-08-26 08:03:42,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=632, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=424, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2023-08-26 08:03:42,724 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 14 predicate places. [2023-08-26 08:03:42,724 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 424 flow [2023-08-26 08:03:42,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:42,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:03:42,725 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:03:42,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-26 08:03:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-26 08:03:42,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:03:42,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:03:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2094561634, now seen corresponding path program 2 times [2023-08-26 08:03:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:03:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835182878] [2023-08-26 08:03:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:03:42,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:03:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:03:42,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:03:42,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:03:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835182878] [2023-08-26 08:03:42,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835182878] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:03:42,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764808659] [2023-08-26 08:03:42,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 08:03:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:03:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:03:42,978 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:03:43,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-26 08:03:43,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-26 08:03:43,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 08:03:43,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 08:03:43,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:03:43,151 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 08:03:43,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-26 08:03:43,172 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 08:03:43,172 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-26 08:03:43,203 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 08:03:43,203 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2023-08-26 08:03:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 08:03:43,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 08:03:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764808659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 08:03:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 08:03:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-26 08:03:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537816720] [2023-08-26 08:03:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 08:03:43,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 08:03:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:03:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 08:03:43,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-08-26 08:03:43,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 632 [2023-08-26 08:03:43,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 424 flow. Second operand has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:03:43,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:03:43,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 632 [2023-08-26 08:03:43,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 08:04:47,857 INFO L124 PetriNetUnfolderBase]: 622047/942190 cut-off events. [2023-08-26 08:04:47,857 INFO L125 PetriNetUnfolderBase]: For 21112/21112 co-relation queries the response was YES. [2023-08-26 08:04:50,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1882003 conditions, 942190 events. 622047/942190 cut-off events. For 21112/21112 co-relation queries the response was YES. Maximal size of possible extension queue 9241. Compared 8553692 event pairs, 325590 based on Foata normal form. 0/793027 useless extension candidates. Maximal degree in co-relation 1881966. Up to 652304 conditions per place. [2023-08-26 08:04:54,142 INFO L140 encePairwiseOnDemand]: 594/632 looper letters, 521 selfloop transitions, 83 changer transitions 0/619 dead transitions. [2023-08-26 08:04:54,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 619 transitions, 2607 flow [2023-08-26 08:04:54,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 08:04:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 08:04:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1985 transitions. [2023-08-26 08:04:54,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5234704641350211 [2023-08-26 08:04:54,146 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1985 transitions. [2023-08-26 08:04:54,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1985 transitions. [2023-08-26 08:04:54,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 08:04:54,146 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1985 transitions. [2023-08-26 08:04:54,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 330.8333333333333) internal successors, (1985), 6 states have internal predecessors, (1985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:04:54,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 632.0) internal successors, (4424), 7 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:04:54,166 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 632.0) internal successors, (4424), 7 states have internal predecessors, (4424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:04:54,166 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 424 flow. Second operand 6 states and 1985 transitions. [2023-08-26 08:04:54,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 619 transitions, 2607 flow [2023-08-26 08:04:54,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 619 transitions, 2593 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 08:04:54,196 INFO L231 Difference]: Finished difference. Result has 190 places, 257 transitions, 972 flow [2023-08-26 08:04:54,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=632, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=972, PETRI_PLACES=190, PETRI_TRANSITIONS=257} [2023-08-26 08:04:54,213 INFO L281 CegarLoopForPetriNet]: 167 programPoint places, 23 predicate places. [2023-08-26 08:04:54,213 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 257 transitions, 972 flow [2023-08-26 08:04:54,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.5) internal successors, (1407), 6 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:04:54,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 08:04:54,214 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 08:04:54,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-08-26 08:04:54,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:04:54,418 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONASSERT === [t_funErr5ASSERT_VIOLATIONASSERT, t_funErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 21 more)] === [2023-08-26 08:04:54,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 08:04:54,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2094561235, now seen corresponding path program 1 times [2023-08-26 08:04:54,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 08:04:54,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252553876] [2023-08-26 08:04:54,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:04:54,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 08:04:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:04:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:04:54,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 08:04:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252553876] [2023-08-26 08:04:54,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252553876] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 08:04:54,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033856945] [2023-08-26 08:04:54,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 08:04:54,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 08:04:54,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 08:04:54,513 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 08:04:54,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-26 08:04:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 08:04:54,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 08:04:54,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 08:04:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:04:54,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 08:04:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 08:04:54,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033856945] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 08:04:54,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 08:04:54,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-26 08:04:54,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127824829] [2023-08-26 08:04:54,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 08:04:54,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 08:04:54,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 08:04:54,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 08:04:54,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-26 08:04:54,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 632 [2023-08-26 08:04:54,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 257 transitions, 972 flow. Second operand has 12 states, 12 states have (on average 330.5833333333333) internal successors, (3967), 12 states have internal predecessors, (3967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 08:04:54,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 08:04:54,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 632 [2023-08-26 08:04:54,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand