/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 06:52:49,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 06:52:49,224 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-25 06:52:49,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 06:52:49,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 06:52:49,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 06:52:49,257 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 06:52:49,257 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 06:52:49,258 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 06:52:49,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 06:52:49,262 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 06:52:49,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 06:52:49,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 06:52:49,263 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 06:52:49,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 06:52:49,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 06:52:49,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 06:52:49,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 06:52:49,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 06:52:49,266 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 06:52:49,266 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 06:52:49,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 06:52:49,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 06:52:49,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 06:52:49,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 06:52:49,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 06:52:49,268 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 06:52:49,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 06:52:49,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 06:52:49,268 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 06:52:49,268 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.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-25 06:52:49,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 06:52:49,620 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 06:52:49,622 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 06:52:49,623 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 06:52:49,623 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 06:52:49,625 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-25 06:52:50,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 06:52:50,868 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 06:52:50,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-08-25 06:52:50,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e28029/92f742d1f39a49cb90f2510ca100bac9/FLAG5ba967a33 [2023-08-25 06:52:50,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c80e28029/92f742d1f39a49cb90f2510ca100bac9 [2023-08-25 06:52:50,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 06:52:50,902 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 06:52:50,904 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 06:52:50,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 06:52:50,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 06:52:50,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:52:50" (1/1) ... [2023-08-25 06:52:50,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d99563f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:50, skipping insertion in model container [2023-08-25 06:52:50,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 06:52:50" (1/1) ... [2023-08-25 06:52:50,943 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 06:52:51,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 06:52:51,158 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 06:52:51,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 06:52:51,219 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 06:52:51,219 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 06:52:51,227 INFO L206 MainTranslator]: Completed translation [2023-08-25 06:52:51,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51 WrapperNode [2023-08-25 06:52:51,228 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 06:52:51,229 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 06:52:51,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 06:52:51,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 06:52:51,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,286 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 507 [2023-08-25 06:52:51,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 06:52:51,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 06:52:51,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 06:52:51,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 06:52:51,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 06:52:51,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 06:52:51,363 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 06:52:51,363 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 06:52:51,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (1/1) ... [2023-08-25 06:52:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 06:52:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:52:51,389 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-25 06:52:51,408 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-25 06:52:51,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 06:52:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 06:52:51,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 06:52:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 06:52:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 06:52:51,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 06:52:51,441 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 06:52:51,441 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 06:52:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 06:52:51,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 06:52:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-25 06:52:51,442 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-25 06:52:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 06:52:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 06:52:51,442 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 06:52:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 06:52:51,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 06:52:51,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 06:52:51,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 06:52:51,445 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 06:52:51,587 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 06:52:51,589 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 06:52:52,291 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 06:52:52,633 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 06:52:52,633 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-08-25 06:52:52,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:52:52 BoogieIcfgContainer [2023-08-25 06:52:52,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 06:52:52,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 06:52:52,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 06:52:52,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 06:52:52,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 06:52:50" (1/3) ... [2023-08-25 06:52:52,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67595ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:52:52, skipping insertion in model container [2023-08-25 06:52:52,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 06:52:51" (2/3) ... [2023-08-25 06:52:52,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67595ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 06:52:52, skipping insertion in model container [2023-08-25 06:52:52,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 06:52:52" (3/3) ... [2023-08-25 06:52:52,644 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-08-25 06:52:52,660 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 06:52:52,661 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 73 error locations. [2023-08-25 06:52:52,662 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 06:52:52,797 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-25 06:52:52,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 388 places, 393 transitions, 818 flow [2023-08-25 06:52:53,003 INFO L124 PetriNetUnfolderBase]: 18/389 cut-off events. [2023-08-25 06:52:53,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 06:52:53,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 389 events. 18/389 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 491 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-25 06:52:53,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 388 places, 393 transitions, 818 flow [2023-08-25 06:52:53,019 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 371 places, 376 transitions, 776 flow [2023-08-25 06:52:53,022 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 06:52:53,034 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-25 06:52:53,037 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 371 places, 376 transitions, 776 flow [2023-08-25 06:52:53,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 376 transitions, 776 flow [2023-08-25 06:52:53,100 INFO L124 PetriNetUnfolderBase]: 18/376 cut-off events. [2023-08-25 06:52:53,100 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-25 06:52:53,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 376 events. 18/376 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 490 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 326. Up to 3 conditions per place. [2023-08-25 06:52:53,110 INFO L119 LiptonReduction]: Number of co-enabled transitions 10944 [2023-08-25 06:53:05,334 INFO L134 LiptonReduction]: Checked pairs total: 62603 [2023-08-25 06:53:05,334 INFO L136 LiptonReduction]: Total number of compositions: 396 [2023-08-25 06:53:05,346 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 06:53:05,352 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;@16c992f1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 06:53:05,352 INFO L358 AbstractCegarLoop]: Starting to check reachability of 126 error locations. [2023-08-25 06:53:05,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 06:53:05,353 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 06:53:05,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 06:53:05,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:05,354 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 06:53:05,354 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:05,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:05,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1972, now seen corresponding path program 1 times [2023-08-25 06:53:05,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:05,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223581856] [2023-08-25 06:53:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:05,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:05,450 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-25 06:53:05,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:05,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223581856] [2023-08-25 06:53:05,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223581856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:05,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:05,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 06:53:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139932733] [2023-08-25 06:53:05,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:05,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 06:53:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 06:53:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 06:53:05,486 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 789 [2023-08-25 06:53:05,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 266 flow. Second operand has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:05,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:05,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 789 [2023-08-25 06:53:05,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:05,928 INFO L124 PetriNetUnfolderBase]: 2173/3652 cut-off events. [2023-08-25 06:53:05,928 INFO L125 PetriNetUnfolderBase]: For 289/289 co-relation queries the response was YES. [2023-08-25 06:53:05,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 3652 events. 2173/3652 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 19682 event pairs, 1717 based on Foata normal form. 0/3026 useless extension candidates. Maximal degree in co-relation 5722. Up to 2951 conditions per place. [2023-08-25 06:53:05,953 INFO L140 encePairwiseOnDemand]: 721/789 looper letters, 36 selfloop transitions, 0 changer transitions 0/53 dead transitions. [2023-08-25 06:53:05,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 202 flow [2023-08-25 06:53:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 06:53:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 06:53:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 728 transitions. [2023-08-25 06:53:05,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46134347275031684 [2023-08-25 06:53:05,972 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 728 transitions. [2023-08-25 06:53:05,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 728 transitions. [2023-08-25 06:53:05,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:05,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 728 transitions. [2023-08-25 06:53:05,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 364.0) internal successors, (728), 2 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:05,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:05,991 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 789.0) internal successors, (2367), 3 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:05,992 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 266 flow. Second operand 2 states and 728 transitions. [2023-08-25 06:53:05,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 202 flow [2023-08-25 06:53:06,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 186 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-25 06:53:06,004 INFO L231 Difference]: Finished difference. Result has 54 places, 53 transitions, 114 flow [2023-08-25 06:53:06,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=114, PETRI_PLACES=54, PETRI_TRANSITIONS=53} [2023-08-25 06:53:06,009 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -75 predicate places. [2023-08-25 06:53:06,009 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 53 transitions, 114 flow [2023-08-25 06:53:06,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 312.5) internal successors, (625), 2 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:06,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 06:53:06,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 06:53:06,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:06,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:06,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1189152977, now seen corresponding path program 1 times [2023-08-25 06:53:06,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:06,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147056653] [2023-08-25 06:53:06,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:06,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:06,202 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-25 06:53:06,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:06,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147056653] [2023-08-25 06:53:06,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147056653] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:06,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:06,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:53:06,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293156732] [2023-08-25 06:53:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:06,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:53:06,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:06,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:53:06,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:53:06,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 789 [2023-08-25 06:53:06,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 53 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:06,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 789 [2023-08-25 06:53:06,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:06,583 INFO L124 PetriNetUnfolderBase]: 2645/4384 cut-off events. [2023-08-25 06:53:06,583 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-08-25 06:53:06,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8127 conditions, 4384 events. 2645/4384 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 23499 event pairs, 2127 based on Foata normal form. 0/3676 useless extension candidates. Maximal degree in co-relation 8124. Up to 3584 conditions per place. [2023-08-25 06:53:06,609 INFO L140 encePairwiseOnDemand]: 787/789 looper letters, 36 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-25 06:53:06,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 186 flow [2023-08-25 06:53:06,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:53:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:53:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 938 transitions. [2023-08-25 06:53:06,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39628221377270806 [2023-08-25 06:53:06,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 938 transitions. [2023-08-25 06:53:06,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 938 transitions. [2023-08-25 06:53:06,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:06,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 938 transitions. [2023-08-25 06:53:06,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,621 INFO L175 Difference]: Start difference. First operand has 54 places, 53 transitions, 114 flow. Second operand 3 states and 938 transitions. [2023-08-25 06:53:06,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 186 flow [2023-08-25 06:53:06,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 06:53:06,622 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 114 flow [2023-08-25 06:53:06,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-25 06:53:06,623 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -74 predicate places. [2023-08-25 06:53:06,623 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 114 flow [2023-08-25 06:53:06,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.0) internal successors, (906), 3 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:06,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:06,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:06,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 06:53:06,625 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:06,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash -602145056, now seen corresponding path program 1 times [2023-08-25 06:53:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:06,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818975087] [2023-08-25 06:53:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:06,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:07,167 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-25 06:53:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818975087] [2023-08-25 06:53:07,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818975087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:07,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:07,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:53:07,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136818202] [2023-08-25 06:53:07,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:07,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:53:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:07,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:53:07,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:53:07,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 06:53:07,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 114 flow. Second operand has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:07,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:07,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 06:53:07,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:08,062 INFO L124 PetriNetUnfolderBase]: 5673/7551 cut-off events. [2023-08-25 06:53:08,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 06:53:08,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15231 conditions, 7551 events. 5673/7551 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 30380 event pairs, 909 based on Foata normal form. 0/6405 useless extension candidates. Maximal degree in co-relation 15227. Up to 3208 conditions per place. [2023-08-25 06:53:08,099 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 106 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2023-08-25 06:53:08,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 452 flow [2023-08-25 06:53:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:53:08,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:53:08,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1731 transitions. [2023-08-25 06:53:08,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3656527249683143 [2023-08-25 06:53:08,104 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1731 transitions. [2023-08-25 06:53:08,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1731 transitions. [2023-08-25 06:53:08,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:08,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1731 transitions. [2023-08-25 06:53:08,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 288.5) internal successors, (1731), 6 states have internal predecessors, (1731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:08,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:08,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:08,118 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 114 flow. Second operand 6 states and 1731 transitions. [2023-08-25 06:53:08,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 452 flow [2023-08-25 06:53:08,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:53:08,120 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 119 flow [2023-08-25 06:53:08,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=119, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-25 06:53:08,121 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-25 06:53:08,121 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 119 flow [2023-08-25 06:53:08,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 272.5) internal successors, (1635), 6 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:08,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:08,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:08,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 06:53:08,123 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:08,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1526995189, now seen corresponding path program 1 times [2023-08-25 06:53:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:08,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397833555] [2023-08-25 06:53:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:08,453 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-25 06:53:08,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:08,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397833555] [2023-08-25 06:53:08,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397833555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:08,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:08,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:53:08,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202150689] [2023-08-25 06:53:08,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:53:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:08,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:53:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:53:08,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 06:53:08,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:08,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:08,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 06:53:08,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:09,282 INFO L124 PetriNetUnfolderBase]: 5548/7376 cut-off events. [2023-08-25 06:53:09,282 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-08-25 06:53:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15681 conditions, 7376 events. 5548/7376 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 29355 event pairs, 3864 based on Foata normal form. 0/6300 useless extension candidates. Maximal degree in co-relation 15677. Up to 6318 conditions per place. [2023-08-25 06:53:09,312 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 89 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2023-08-25 06:53:09,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 391 flow [2023-08-25 06:53:09,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:53:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:53:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1714 transitions. [2023-08-25 06:53:09,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3620616814533164 [2023-08-25 06:53:09,317 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1714 transitions. [2023-08-25 06:53:09,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1714 transitions. [2023-08-25 06:53:09,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:09,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1714 transitions. [2023-08-25 06:53:09,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 285.6666666666667) internal successors, (1714), 6 states have internal predecessors, (1714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,330 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,330 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 119 flow. Second operand 6 states and 1714 transitions. [2023-08-25 06:53:09,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 391 flow [2023-08-25 06:53:09,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 94 transitions, 384 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 06:53:09,337 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 118 flow [2023-08-25 06:53:09,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-25 06:53:09,338 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -71 predicate places. [2023-08-25 06:53:09,338 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 118 flow [2023-08-25 06:53:09,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.8333333333333) internal successors, (1643), 6 states have internal predecessors, (1643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:09,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:09,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 06:53:09,339 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:09,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:09,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1633722716, now seen corresponding path program 1 times [2023-08-25 06:53:09,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:09,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819138083] [2023-08-25 06:53:09,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:09,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:09,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:09,464 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-25 06:53:09,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:09,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819138083] [2023-08-25 06:53:09,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819138083] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:09,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:09,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 06:53:09,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100432616] [2023-08-25 06:53:09,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:09,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:53:09,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:09,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:53:09,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:53:09,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-25 06:53:09,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:09,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-25 06:53:09,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:09,866 INFO L124 PetriNetUnfolderBase]: 2205/3192 cut-off events. [2023-08-25 06:53:09,866 INFO L125 PetriNetUnfolderBase]: For 117/142 co-relation queries the response was YES. [2023-08-25 06:53:09,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6456 conditions, 3192 events. 2205/3192 cut-off events. For 117/142 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14391 event pairs, 145 based on Foata normal form. 5/2774 useless extension candidates. Maximal degree in co-relation 6452. Up to 1160 conditions per place. [2023-08-25 06:53:09,881 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-25 06:53:09,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 98 transitions, 393 flow [2023-08-25 06:53:09,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 06:53:09,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 06:53:09,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1621 transitions. [2023-08-25 06:53:09,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108998732572877 [2023-08-25 06:53:09,887 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1621 transitions. [2023-08-25 06:53:09,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1621 transitions. [2023-08-25 06:53:09,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:09,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1621 transitions. [2023-08-25 06:53:09,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 324.2) internal successors, (1621), 5 states have internal predecessors, (1621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,897 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,897 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 118 flow. Second operand 5 states and 1621 transitions. [2023-08-25 06:53:09,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 98 transitions, 393 flow [2023-08-25 06:53:09,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 377 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 06:53:09,901 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 139 flow [2023-08-25 06:53:09,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-08-25 06:53:09,903 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -69 predicate places. [2023-08-25 06:53:09,903 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 139 flow [2023-08-25 06:53:09,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 311.75) internal successors, (1247), 4 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:09,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:09,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:09,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 06:53:09,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:09,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1840018890, now seen corresponding path program 1 times [2023-08-25 06:53:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575613137] [2023-08-25 06:53:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:09,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:10,349 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-25 06:53:10,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:10,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575613137] [2023-08-25 06:53:10,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575613137] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:10,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:10,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:53:10,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283014188] [2023-08-25 06:53:10,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:10,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:53:10,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:10,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:53:10,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:53:10,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 789 [2023-08-25 06:53:10,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 139 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:10,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:10,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 789 [2023-08-25 06:53:10,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:11,113 INFO L124 PetriNetUnfolderBase]: 5985/8023 cut-off events. [2023-08-25 06:53:11,113 INFO L125 PetriNetUnfolderBase]: For 2856/2856 co-relation queries the response was YES. [2023-08-25 06:53:11,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18549 conditions, 8023 events. 5985/8023 cut-off events. For 2856/2856 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 33832 event pairs, 4657 based on Foata normal form. 0/7213 useless extension candidates. Maximal degree in co-relation 18542. Up to 7969 conditions per place. [2023-08-25 06:53:11,157 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 67 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2023-08-25 06:53:11,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 319 flow [2023-08-25 06:53:11,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 06:53:11,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 06:53:11,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1689 transitions. [2023-08-25 06:53:11,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3567807351077313 [2023-08-25 06:53:11,163 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1689 transitions. [2023-08-25 06:53:11,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1689 transitions. [2023-08-25 06:53:11,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:11,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1689 transitions. [2023-08-25 06:53:11,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,173 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 789.0) internal successors, (5523), 7 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,174 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 139 flow. Second operand 6 states and 1689 transitions. [2023-08-25 06:53:11,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 319 flow [2023-08-25 06:53:11,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 72 transitions, 316 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:53:11,178 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 142 flow [2023-08-25 06:53:11,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-08-25 06:53:11,181 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -66 predicate places. [2023-08-25 06:53:11,183 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 142 flow [2023-08-25 06:53:11,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:11,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:11,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 06:53:11,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:11,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:11,185 INFO L85 PathProgramCache]: Analyzing trace with hash 925835819, now seen corresponding path program 1 times [2023-08-25 06:53:11,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:11,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458634162] [2023-08-25 06:53:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:11,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:53:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:11,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458634162] [2023-08-25 06:53:11,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458634162] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:11,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:11,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 06:53:11,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972898611] [2023-08-25 06:53:11,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:11,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:53:11,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:11,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:53:11,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:53:11,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 789 [2023-08-25 06:53:11,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:11,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 789 [2023-08-25 06:53:11,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:11,708 INFO L124 PetriNetUnfolderBase]: 2555/3755 cut-off events. [2023-08-25 06:53:11,708 INFO L125 PetriNetUnfolderBase]: For 1013/1047 co-relation queries the response was YES. [2023-08-25 06:53:11,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8231 conditions, 3755 events. 2555/3755 cut-off events. For 1013/1047 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 17512 event pairs, 333 based on Foata normal form. 2/3425 useless extension candidates. Maximal degree in co-relation 8224. Up to 1507 conditions per place. [2023-08-25 06:53:11,729 INFO L140 encePairwiseOnDemand]: 784/789 looper letters, 79 selfloop transitions, 7 changer transitions 0/99 dead transitions. [2023-08-25 06:53:11,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 99 transitions, 437 flow [2023-08-25 06:53:11,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 06:53:11,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 06:53:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1619 transitions. [2023-08-25 06:53:11,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41039290240811155 [2023-08-25 06:53:11,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1619 transitions. [2023-08-25 06:53:11,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1619 transitions. [2023-08-25 06:53:11,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:11,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1619 transitions. [2023-08-25 06:53:11,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 323.8) internal successors, (1619), 5 states have internal predecessors, (1619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,743 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 789.0) internal successors, (4734), 6 states have internal predecessors, (4734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,743 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 142 flow. Second operand 5 states and 1619 transitions. [2023-08-25 06:53:11,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 99 transitions, 437 flow [2023-08-25 06:53:11,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 99 transitions, 428 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 06:53:11,753 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 179 flow [2023-08-25 06:53:11,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-08-25 06:53:11,754 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -63 predicate places. [2023-08-25 06:53:11,754 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 179 flow [2023-08-25 06:53:11,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:11,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:11,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:11,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 06:53:11,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:11,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:11,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1736758879, now seen corresponding path program 2 times [2023-08-25 06:53:11,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:11,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078553871] [2023-08-25 06:53:11,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:11,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:12,104 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-25 06:53:12,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:12,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078553871] [2023-08-25 06:53:12,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078553871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:12,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:12,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 06:53:12,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474676593] [2023-08-25 06:53:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:12,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 06:53:12,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:12,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 06:53:12,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-25 06:53:12,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 789 [2023-08-25 06:53:12,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 179 flow. Second operand has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 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-25 06:53:12,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:12,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 789 [2023-08-25 06:53:12,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:12,916 INFO L124 PetriNetUnfolderBase]: 4571/6859 cut-off events. [2023-08-25 06:53:12,916 INFO L125 PetriNetUnfolderBase]: For 3503/3530 co-relation queries the response was YES. [2023-08-25 06:53:12,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16237 conditions, 6859 events. 4571/6859 cut-off events. For 3503/3530 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 36904 event pairs, 449 based on Foata normal form. 168/6615 useless extension candidates. Maximal degree in co-relation 16227. Up to 2132 conditions per place. [2023-08-25 06:53:12,942 INFO L140 encePairwiseOnDemand]: 782/789 looper letters, 91 selfloop transitions, 7 changer transitions 21/132 dead transitions. [2023-08-25 06:53:12,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 132 transitions, 644 flow [2023-08-25 06:53:12,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 06:53:12,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 06:53:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2215 transitions. [2023-08-25 06:53:12,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40105015390186494 [2023-08-25 06:53:12,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2215 transitions. [2023-08-25 06:53:12,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2215 transitions. [2023-08-25 06:53:12,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:12,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2215 transitions. [2023-08-25 06:53:12,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 316.42857142857144) internal successors, (2215), 7 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:12,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:12,967 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 789.0) internal successors, (6312), 8 states have internal predecessors, (6312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:12,967 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 179 flow. Second operand 7 states and 2215 transitions. [2023-08-25 06:53:12,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 132 transitions, 644 flow [2023-08-25 06:53:12,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 132 transitions, 639 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:53:12,976 INFO L231 Difference]: Finished difference. Result has 73 places, 54 transitions, 186 flow [2023-08-25 06:53:12,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=73, PETRI_TRANSITIONS=54} [2023-08-25 06:53:12,978 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-25 06:53:12,978 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 54 transitions, 186 flow [2023-08-25 06:53:12,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.3333333333333) internal successors, (1832), 6 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-25 06:53:12,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:12,979 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 06:53:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 06:53:12,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:12,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1870030227, now seen corresponding path program 1 times [2023-08-25 06:53:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730026674] [2023-08-25 06:53:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:53:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730026674] [2023-08-25 06:53:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730026674] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:53:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643029331] [2023-08-25 06:53:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:13,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:53:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:13,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:53:13,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:53:13,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-25 06:53:13,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 54 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:13,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-25 06:53:13,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:13,441 INFO L124 PetriNetUnfolderBase]: 2485/3633 cut-off events. [2023-08-25 06:53:13,441 INFO L125 PetriNetUnfolderBase]: For 3149/3149 co-relation queries the response was YES. [2023-08-25 06:53:13,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9418 conditions, 3633 events. 2485/3633 cut-off events. For 3149/3149 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 16274 event pairs, 669 based on Foata normal form. 54/3467 useless extension candidates. Maximal degree in co-relation 9406. Up to 3093 conditions per place. [2023-08-25 06:53:13,461 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 51 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-25 06:53:13,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 316 flow [2023-08-25 06:53:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:53:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:53:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-25 06:53:13,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-25 06:53:13,464 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:13,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,472 INFO L175 Difference]: Start difference. First operand has 73 places, 54 transitions, 186 flow. Second operand 3 states and 975 transitions. [2023-08-25 06:53:13,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 316 flow [2023-08-25 06:53:13,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 66 transitions, 288 flow, removed 1 selfloop flow, removed 11 redundant places. [2023-08-25 06:53:13,478 INFO L231 Difference]: Finished difference. Result has 65 places, 53 transitions, 160 flow [2023-08-25 06:53:13,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=53} [2023-08-25 06:53:13,478 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -64 predicate places. [2023-08-25 06:53:13,479 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 53 transitions, 160 flow [2023-08-25 06:53:13,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:13,479 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:53:13,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 06:53:13,480 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:13,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1428632059, now seen corresponding path program 1 times [2023-08-25 06:53:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634816606] [2023-08-25 06:53:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 06:53:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634816606] [2023-08-25 06:53:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634816606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 06:53:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052822560] [2023-08-25 06:53:13,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:13,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 06:53:13,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 06:53:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 06:53:13,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 789 [2023-08-25 06:53:13,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:13,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 789 [2023-08-25 06:53:13,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:13,971 INFO L124 PetriNetUnfolderBase]: 2096/3332 cut-off events. [2023-08-25 06:53:13,971 INFO L125 PetriNetUnfolderBase]: For 1591/1625 co-relation queries the response was YES. [2023-08-25 06:53:13,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 3332 events. 2096/3332 cut-off events. For 1591/1625 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 15456 event pairs, 1003 based on Foata normal form. 48/3143 useless extension candidates. Maximal degree in co-relation 8220. Up to 2752 conditions per place. [2023-08-25 06:53:13,988 INFO L140 encePairwiseOnDemand]: 786/789 looper letters, 49 selfloop transitions, 2 changer transitions 3/67 dead transitions. [2023-08-25 06:53:13,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 67 transitions, 304 flow [2023-08-25 06:53:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 06:53:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 06:53:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2023-08-25 06:53:13,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41191381495564006 [2023-08-25 06:53:13,991 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:13,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2023-08-25 06:53:13,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,997 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 789.0) internal successors, (3156), 4 states have internal predecessors, (3156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:13,997 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 160 flow. Second operand 3 states and 975 transitions. [2023-08-25 06:53:13,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 67 transitions, 304 flow [2023-08-25 06:53:14,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 67 transitions, 302 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:53:14,001 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 170 flow [2023-08-25 06:53:14,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2023-08-25 06:53:14,002 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -62 predicate places. [2023-08-25 06:53:14,002 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 170 flow [2023-08-25 06:53:14,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:14,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:53:14,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 06:53:14,003 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:14,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -480627784, now seen corresponding path program 1 times [2023-08-25 06:53:14,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:14,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669683180] [2023-08-25 06:53:14,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 06:53:14,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:14,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669683180] [2023-08-25 06:53:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669683180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:14,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 06:53:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714422559] [2023-08-25 06:53:14,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:14,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:53:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:53:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:53:14,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-25 06:53:14,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:14,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-25 06:53:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:14,576 INFO L124 PetriNetUnfolderBase]: 2228/3548 cut-off events. [2023-08-25 06:53:14,577 INFO L125 PetriNetUnfolderBase]: For 2012/2034 co-relation queries the response was YES. [2023-08-25 06:53:14,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9194 conditions, 3548 events. 2228/3548 cut-off events. For 2012/2034 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16788 event pairs, 1657 based on Foata normal form. 22/3307 useless extension candidates. Maximal degree in co-relation 9183. Up to 2984 conditions per place. [2023-08-25 06:53:14,595 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 40 selfloop transitions, 2 changer transitions 18/73 dead transitions. [2023-08-25 06:53:14,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 337 flow [2023-08-25 06:53:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 06:53:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 06:53:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-25 06:53:14,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-25 06:53:14,599 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-25 06:53:14,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-25 06:53:14,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:14,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-25 06:53:14,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,606 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 170 flow. Second operand 4 states and 1148 transitions. [2023-08-25 06:53:14,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 337 flow [2023-08-25 06:53:14,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 335 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 06:53:14,611 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 182 flow [2023-08-25 06:53:14,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-25 06:53:14,612 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -58 predicate places. [2023-08-25 06:53:14,612 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 182 flow [2023-08-25 06:53:14,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.5) internal successors, (1126), 4 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:14,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:53:14,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 06:53:14,613 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:14,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -622570275, now seen corresponding path program 1 times [2023-08-25 06:53:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129281112] [2023-08-25 06:53:14,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 06:53:14,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:14,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129281112] [2023-08-25 06:53:14,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129281112] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 06:53:14,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 06:53:14,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 06:53:14,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74235086] [2023-08-25 06:53:14,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 06:53:14,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 06:53:14,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 06:53:14,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 06:53:14,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 789 [2023-08-25 06:53:14,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 182 flow. Second operand has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:14,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:14,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 789 [2023-08-25 06:53:14,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:15,186 INFO L124 PetriNetUnfolderBase]: 2437/3937 cut-off events. [2023-08-25 06:53:15,186 INFO L125 PetriNetUnfolderBase]: For 2298/2320 co-relation queries the response was YES. [2023-08-25 06:53:15,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10107 conditions, 3937 events. 2437/3937 cut-off events. For 2298/2320 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 19353 event pairs, 1835 based on Foata normal form. 34/3675 useless extension candidates. Maximal degree in co-relation 10094. Up to 2985 conditions per place. [2023-08-25 06:53:15,202 INFO L140 encePairwiseOnDemand]: 785/789 looper letters, 41 selfloop transitions, 2 changer transitions 19/75 dead transitions. [2023-08-25 06:53:15,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 75 transitions, 363 flow [2023-08-25 06:53:15,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 06:53:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 06:53:15,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1148 transitions. [2023-08-25 06:53:15,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637515842839037 [2023-08-25 06:53:15,206 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1148 transitions. [2023-08-25 06:53:15,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1148 transitions. [2023-08-25 06:53:15,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 06:53:15,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1148 transitions. [2023-08-25 06:53:15,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 287.0) internal successors, (1148), 4 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:15,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:15,213 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 789.0) internal successors, (3945), 5 states have internal predecessors, (3945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:15,213 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 182 flow. Second operand 4 states and 1148 transitions. [2023-08-25 06:53:15,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 75 transitions, 363 flow [2023-08-25 06:53:15,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 75 transitions, 355 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-25 06:53:15,220 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 190 flow [2023-08-25 06:53:15,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-25 06:53:15,221 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, -56 predicate places. [2023-08-25 06:53:15,221 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 190 flow [2023-08-25 06:53:15,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.75) internal successors, (1127), 4 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:15,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 06:53:15,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 06:53:15,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 06:53:15,222 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 06:53:15,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 06:53:15,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1396244327, now seen corresponding path program 1 times [2023-08-25 06:53:15,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 06:53:15,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805777990] [2023-08-25 06:53:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 06:53:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:53:19,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 06:53:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805777990] [2023-08-25 06:53:19,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805777990] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 06:53:19,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485538673] [2023-08-25 06:53:19,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 06:53:19,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 06:53:19,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 06:53:19,145 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-25 06:53:19,169 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-25 06:53:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 06:53:19,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 57 conjunts are in the unsatisfiable core [2023-08-25 06:53:19,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 06:53:20,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 06:53:20,325 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-25 06:53:20,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2023-08-25 06:53:20,780 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 06:53:20,785 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:53:20,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 28 treesize of output 18 [2023-08-25 06:53:21,023 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:53:21,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 06:53:21,306 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:53:21,306 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2023-08-25 06:53:21,791 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:53:21,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 203 [2023-08-25 06:53:21,838 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 06:53:21,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 93 treesize of output 103 [2023-08-25 06:53:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 06:53:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485538673] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 06:53:23,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 06:53:23,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 50 [2023-08-25 06:53:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377353419] [2023-08-25 06:53:23,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 06:53:23,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-25 06:53:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 06:53:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-25 06:53:23,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2357, Unknown=7, NotChecked=0, Total=2550 [2023-08-25 06:53:23,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 789 [2023-08-25 06:53:23,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 190 flow. Second operand has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 06:53:23,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 06:53:23,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 789 [2023-08-25 06:53:23,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 06:53:49,575 WARN L234 SmtUtils]: Spent 18.65s on a formula simplification. DAG size of input: 177 DAG size of output: 143 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:53:59,699 WARN L234 SmtUtils]: Spent 7.46s on a formula simplification. DAG size of input: 175 DAG size of output: 138 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:54:06,777 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-25 06:54:08,385 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 [1] [2023-08-25 06:54:10,535 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-25 06:54:16,173 WARN L234 SmtUtils]: Spent 5.09s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:54:18,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:54:32,012 WARN L234 SmtUtils]: Spent 12.72s on a formula simplification. DAG size of input: 120 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:54:40,413 WARN L234 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 107 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:54:54,194 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-25 06:54:56,217 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-25 06:54:58,521 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-25 06:55:01,132 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-25 06:55:12,721 WARN L234 SmtUtils]: Spent 10.99s on a formula simplification. DAG size of input: 183 DAG size of output: 144 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:55:14,732 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 [0, 1] [2023-08-25 06:55:26,505 WARN L234 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 103 DAG size of output: 95 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:55:28,609 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 [0, 1] [2023-08-25 06:55:30,935 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 [0, 1] [2023-08-25 06:55:35,624 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 [0, 1] [2023-08-25 06:55:38,486 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-25 06:55:40,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:55:42,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:55:44,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:55:46,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:55:48,812 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-25 06:56:01,379 WARN L234 SmtUtils]: Spent 11.39s on a formula simplification. DAG size of input: 181 DAG size of output: 139 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:56:03,387 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 [0, 1] [2023-08-25 06:56:05,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:56:08,474 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 [0, 1] [2023-08-25 06:56:10,929 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-25 06:56:12,982 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 [0, 1] [2023-08-25 06:56:16,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:56:33,928 WARN L234 SmtUtils]: Spent 12.43s on a formula simplification. DAG size of input: 114 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:56:36,349 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-25 06:56:38,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:40,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:42,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:45,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:47,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:49,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:56:51,276 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-25 06:56:57,458 WARN L234 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 78 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:56:59,468 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 [0, 1] [2023-08-25 06:57:04,244 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-25 06:57:06,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:57:22,516 WARN L234 SmtUtils]: Spent 15.68s on a formula simplification. DAG size of input: 126 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:57:30,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:57:43,970 WARN L234 SmtUtils]: Spent 12.98s on a formula simplification. DAG size of input: 151 DAG size of output: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:57:46,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:57:50,410 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 [0, 1] [2023-08-25 06:57:52,802 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 [0, 1] [2023-08-25 06:57:57,415 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-25 06:58:00,276 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 [1] [2023-08-25 06:58:09,792 WARN L234 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 110 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:58:13,624 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-25 06:58:17,666 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 [0, 1] [2023-08-25 06:58:19,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:58:22,157 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 [0, 1] [2023-08-25 06:58:24,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:58:26,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:58:28,910 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 [0, 1] [2023-08-25 06:58:30,919 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 [0, 1] [2023-08-25 06:58:32,927 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 [0, 1] [2023-08-25 06:58:34,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:58:36,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:58:39,029 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 [0, 1] [2023-08-25 06:58:41,040 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 [0, 1] [2023-08-25 06:58:53,070 WARN L234 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 110 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:58:55,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:58:57,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:58:59,198 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-25 06:59:01,360 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 [0, 1] [2023-08-25 06:59:03,892 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 [0, 1] [2023-08-25 06:59:05,902 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 [0, 1] [2023-08-25 06:59:09,845 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-25 06:59:12,129 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-25 06:59:14,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 06:59:16,915 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-25 06:59:18,925 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-25 06:59:20,940 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-25 06:59:22,434 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 [1] [2023-08-25 06:59:46,828 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification. DAG size of input: 109 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 06:59:49,793 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 [0, 1] [2023-08-25 06:59:51,798 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 [0, 1] [2023-08-25 06:59:53,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:59:55,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 06:59:59,058 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 [0, 1] [2023-08-25 07:00:04,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:00:08,303 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-25 07:00:09,647 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 [1] [2023-08-25 07:00:13,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:00:15,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:00:18,295 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-25 07:00:19,482 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 [1] [2023-08-25 07:00:20,993 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 [1] [2023-08-25 07:00:30,272 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-25 07:00:32,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:00:34,301 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-25 07:00:36,374 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, 1] [2023-08-25 07:00:39,050 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 [0, 1] [2023-08-25 07:00:41,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:00:42,126 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, 1] [2023-08-25 07:00:43,682 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 [1] [2023-08-25 07:00:54,218 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-25 07:00:56,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:00:58,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:00,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:02,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:04,503 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-25 07:01:08,612 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-25 07:01:12,156 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-25 07:01:14,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:15,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:18,816 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-25 07:01:21,732 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-25 07:01:25,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:28,805 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 [1] [2023-08-25 07:01:30,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:33,528 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 [0, 1] [2023-08-25 07:01:37,263 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 [0, 1] [2023-08-25 07:01:42,350 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-25 07:01:44,484 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-25 07:01:46,790 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 [0, 1] [2023-08-25 07:01:51,407 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-25 07:01:52,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:55,622 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-25 07:01:57,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:01:59,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:02:02,154 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-25 07:02:04,769 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-25 07:02:08,554 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 [0, 1] [2023-08-25 07:02:10,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:02:12,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:02:14,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:02:16,592 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 [0, 1] [2023-08-25 07:02:21,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-25 07:02:23,990 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-25 07:02:25,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:02:30,067 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 [0, 1] [2023-08-25 07:02:31,767 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 [1] [2023-08-25 07:02:34,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:02:37,119 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-25 07:02:39,873 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, 1] [2023-08-25 07:02:41,897 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-25 07:02:43,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:02:46,318 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-25 07:02:49,939 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-25 07:02:53,170 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-25 07:02:56,352 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-25 07:02:58,065 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 [1] [2023-08-25 07:03:01,426 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-25 07:03:04,342 INFO L124 PetriNetUnfolderBase]: 78137/107827 cut-off events. [2023-08-25 07:03:04,343 INFO L125 PetriNetUnfolderBase]: For 74211/74211 co-relation queries the response was YES. [2023-08-25 07:03:04,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300785 conditions, 107827 events. 78137/107827 cut-off events. For 74211/74211 co-relation queries the response was YES. Maximal size of possible extension queue 2245. Compared 678228 event pairs, 2332 based on Foata normal form. 1656/101955 useless extension candidates. Maximal degree in co-relation 300771. Up to 16904 conditions per place. [2023-08-25 07:03:05,059 INFO L140 encePairwiseOnDemand]: 768/789 looper letters, 4043 selfloop transitions, 805 changer transitions 158/5007 dead transitions. [2023-08-25 07:03:05,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 5007 transitions, 23653 flow [2023-08-25 07:03:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 267 states. [2023-08-25 07:03:05,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2023-08-25 07:03:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 54625 transitions. [2023-08-25 07:03:05,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25930039921580916 [2023-08-25 07:03:05,195 INFO L72 ComplementDD]: Start complementDD. Operand 267 states and 54625 transitions. [2023-08-25 07:03:05,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 267 states and 54625 transitions. [2023-08-25 07:03:05,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 07:03:05,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 267 states and 54625 transitions. [2023-08-25 07:03:05,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 268 states, 267 states have (on average 204.5880149812734) internal successors, (54625), 267 states have internal predecessors, (54625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:03:05,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:03:05,566 INFO L81 ComplementDD]: Finished complementDD. Result has 268 states, 268 states have (on average 789.0) internal successors, (211452), 268 states have internal predecessors, (211452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:03:05,567 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 190 flow. Second operand 267 states and 54625 transitions. [2023-08-25 07:03:05,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 5007 transitions, 23653 flow [2023-08-25 07:03:05,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 5007 transitions, 23556 flow, removed 45 selfloop flow, removed 2 redundant places. [2023-08-25 07:03:05,852 INFO L231 Difference]: Finished difference. Result has 450 places, 1040 transitions, 6919 flow [2023-08-25 07:03:05,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=789, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=267, PETRI_FLOW=6919, PETRI_PLACES=450, PETRI_TRANSITIONS=1040} [2023-08-25 07:03:05,852 INFO L281 CegarLoopForPetriNet]: 129 programPoint places, 321 predicate places. [2023-08-25 07:03:05,853 INFO L495 AbstractCegarLoop]: Abstraction has has 450 places, 1040 transitions, 6919 flow [2023-08-25 07:03:05,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 188.23529411764707) internal successors, (9600), 51 states have internal predecessors, (9600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:03:05,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 07:03:05,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 07:03:05,868 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-25 07:03:06,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-25 07:03:06,062 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2023-08-25 07:03:06,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 07:03:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1604558203, now seen corresponding path program 2 times [2023-08-25 07:03:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 07:03:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996013494] [2023-08-25 07:03:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 07:03:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 07:03:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 07:03:09,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 07:03:09,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 07:03:09,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996013494] [2023-08-25 07:03:09,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996013494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 07:03:09,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791835604] [2023-08-25 07:03:09,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 07:03:09,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 07:03:09,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 07:03:09,940 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-25 07:03:09,945 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-25 07:03:10,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 07:03:10,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 07:03:10,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-25 07:03:10,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 07:03:11,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 07:03:11,031 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 18 treesize of output 20 [2023-08-25 07:03:11,238 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2023-08-25 07:03:11,380 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:03:11,380 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 30 [2023-08-25 07:03:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:03:11,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 07:03:11,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:03:11,938 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2023-08-25 07:03:12,325 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:03:12,325 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 159 treesize of output 203 [2023-08-25 07:03:12,376 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 07:03:12,376 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 93 treesize of output 103 [2023-08-25 07:03:13,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 07:03:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791835604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 07:03:13,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 07:03:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 44 [2023-08-25 07:03:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011449535] [2023-08-25 07:03:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 07:03:13,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-25 07:03:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 07:03:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-25 07:03:13,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1823, Unknown=3, NotChecked=0, Total=1980 [2023-08-25 07:03:13,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 789 [2023-08-25 07:03:13,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 1040 transitions, 6919 flow. Second operand has 45 states, 45 states have (on average 196.66666666666666) internal successors, (8850), 45 states have internal predecessors, (8850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 07:03:13,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 07:03:13,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 789 [2023-08-25 07:03:13,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 07:03:41,780 WARN L234 SmtUtils]: Spent 20.77s on a formula simplification. DAG size of input: 135 DAG size of output: 90 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:03:58,431 WARN L234 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 107 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:04:14,022 WARN L234 SmtUtils]: Spent 14.56s on a formula simplification. DAG size of input: 134 DAG size of output: 105 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:04:22,945 WARN L234 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 96 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:04:33,080 WARN L234 SmtUtils]: Spent 8.32s on a formula simplification. DAG size of input: 105 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:04:47,801 WARN L234 SmtUtils]: Spent 14.40s on a formula simplification. DAG size of input: 130 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:05:04,054 WARN L234 SmtUtils]: Spent 14.86s on a formula simplification. DAG size of input: 127 DAG size of output: 83 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:05:11,547 WARN L234 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 89 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:05:22,631 WARN L234 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 98 DAG size of output: 66 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:05:31,862 WARN L234 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 100 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:05:52,079 WARN L234 SmtUtils]: Spent 18.46s on a formula simplification. DAG size of input: 128 DAG size of output: 100 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:06:06,719 WARN L234 SmtUtils]: Spent 14.49s on a formula simplification. DAG size of input: 117 DAG size of output: 89 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:06:22,438 WARN L234 SmtUtils]: Spent 14.42s on a formula simplification. DAG size of input: 115 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:06:38,333 WARN L234 SmtUtils]: Spent 12.44s on a formula simplification. DAG size of input: 98 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 07:06:43,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 07:06:45,545 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] Received shutdown request... [2023-08-25 07:06:47,552 WARN L266 SmtUtils]: Removed 7 from assertion stack [2023-08-25 07:06:47,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2023-08-25 07:06:47,554 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONASSERT (125 of 126 remaining) [2023-08-25 07:06:47,568 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-25 07:06:47,577 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:06:47,577 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 07:06:47,754 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,SelfDestructingSolverStorable13 [2023-08-25 07:06:47,754 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (123 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (122 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (121 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (120 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (119 of 126 remaining) [2023-08-25 07:06:47,756 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (118 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (117 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (116 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (115 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (114 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (113 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (112 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (111 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (110 of 126 remaining) [2023-08-25 07:06:47,757 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (109 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (108 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (107 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (106 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (105 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (103 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (102 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (101 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (100 of 126 remaining) [2023-08-25 07:06:47,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (99 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (98 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (97 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (96 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (95 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (94 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (93 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 126 remaining) [2023-08-25 07:06:47,759 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 126 remaining) [2023-08-25 07:06:47,760 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (80 of 126 remaining) [2023-08-25 07:06:47,765 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (79 of 126 remaining) [2023-08-25 07:06:47,766 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (78 of 126 remaining) [2023-08-25 07:06:47,766 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (77 of 126 remaining) [2023-08-25 07:06:47,766 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 126 remaining) [2023-08-25 07:06:47,766 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (75 of 126 remaining) [2023-08-25 07:06:47,766 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (74 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (73 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (72 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (71 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (69 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (68 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (67 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (66 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (65 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 126 remaining) [2023-08-25 07:06:47,767 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (63 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (62 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (61 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (59 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (58 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (57 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (56 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 126 remaining) [2023-08-25 07:06:47,768 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (51 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (49 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 126 remaining) [2023-08-25 07:06:47,769 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (40 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (39 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 126 remaining) [2023-08-25 07:06:47,770 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (24 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (23 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (22 of 126 remaining) [2023-08-25 07:06:47,771 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (21 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (20 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (17 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (16 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (14 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 126 remaining) [2023-08-25 07:06:47,772 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (10 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (9 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (5 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (4 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 126 remaining) [2023-08-25 07:06:47,773 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 126 remaining) [2023-08-25 07:06:47,774 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 126 remaining) [2023-08-25 07:06:47,774 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 07:06:47,781 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 07:06:47,781 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 07:06:47,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 07:06:47 BasicIcfg [2023-08-25 07:06:47,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 07:06:47,784 INFO L158 Benchmark]: Toolchain (without parser) took 836882.61ms. Allocated memory was 329.3MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 305.5MB in the beginning and 1.1GB in the end (delta: -810.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-25 07:06:47,784 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 329.3MB. Free memory is still 305.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 07:06:47,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.18ms. Allocated memory is still 329.3MB. Free memory was 305.2MB in the beginning and 291.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-25 07:06:47,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.94ms. Allocated memory is still 329.3MB. Free memory was 291.5MB in the beginning and 288.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 07:06:47,787 INFO L158 Benchmark]: Boogie Preprocessor took 73.97ms. Allocated memory is still 329.3MB. Free memory was 288.1MB in the beginning and 284.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 07:06:47,787 INFO L158 Benchmark]: RCFGBuilder took 1274.18ms. Allocated memory was 329.3MB in the beginning and 411.0MB in the end (delta: 81.8MB). Free memory was 284.5MB in the beginning and 373.1MB in the end (delta: -88.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.0GB. [2023-08-25 07:06:47,787 INFO L158 Benchmark]: TraceAbstraction took 835145.32ms. Allocated memory was 411.0MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 372.0MB in the beginning and 1.1GB in the end (delta: -744.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-25 07:06:47,793 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 329.3MB. Free memory is still 305.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 324.18ms. Allocated memory is still 329.3MB. Free memory was 305.2MB in the beginning and 291.5MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.94ms. Allocated memory is still 329.3MB. Free memory was 291.5MB in the beginning and 288.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 73.97ms. Allocated memory is still 329.3MB. Free memory was 288.1MB in the beginning and 284.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1274.18ms. Allocated memory was 329.3MB in the beginning and 411.0MB in the end (delta: 81.8MB). Free memory was 284.5MB in the beginning and 373.1MB in the end (delta: -88.6MB). Peak memory consumption was 64.2MB. Max. memory is 16.0GB. * TraceAbstraction took 835145.32ms. Allocated memory was 411.0MB in the beginning and 1.8GB in the end (delta: 1.4GB). Free memory was 372.0MB in the beginning and 1.1GB in the end (delta: -744.0MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3s, 371 PlacesBefore, 129 PlacesAfterwards, 376 TransitionsBefore, 121 TransitionsAfterwards, 10944 CoEnabledTransitionPairs, 9 FixpointIterations, 268 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 8 ConcurrentYvCompositions, 13 ChoiceCompositions, 396 TotalNumberOfCompositions, 62603 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24514, independent: 23598, independent conditional: 0, independent unconditional: 23598, dependent: 916, dependent conditional: 0, dependent unconditional: 916, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4700, independent: 4588, independent conditional: 0, independent unconditional: 4588, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 24514, independent: 19010, independent conditional: 0, independent unconditional: 19010, dependent: 804, dependent conditional: 0, dependent unconditional: 804, unknown: 4700, unknown conditional: 0, unknown unconditional: 4700] , Statistics on independence cache: Total cache size (in pairs): 1336, Positive cache size: 1266, Positive conditional cache size: 0, Positive unconditional cache size: 1266, Negative cache size: 70, Negative conditional cache size: 0, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 48]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 50]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 72]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 79]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 104]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 125]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 129]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 130]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 131]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 132]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 133]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 134]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 144]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 149]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 90 for 121ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 466 locations, 126 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 835.0s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 802.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.5s, HoareTripleCheckerStatistics: 1979 mSolverCounterUnknown, 6949 SdHoareTripleChecker+Valid, 327.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6949 mSDsluCounter, 5922 SdHoareTripleChecker+Invalid, 323.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5702 mSDsCounter, 673 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18569 IncrementalHoareTripleChecker+Invalid, 21221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 673 mSolverCounterUnsat, 220 mSDtfsCounter, 18569 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1979 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 660 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 511 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42815 ImplicationChecksByTransitivity, 457.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6919occurred in iteration=13, InterpolantAutomatonStates: 321, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 567 NumberOfCodeBlocks, 567 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 647 ConstructedInterpolants, 23 QuantifiedInterpolants, 9301 SizeOfPredicates, 72 NumberOfNonLiveVariables, 1124 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 18/40 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown