/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 19:55:21,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 19:55:21,432 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 19:55:21,435 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 19:55:21,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 19:55:21,460 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 19:55:21,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 19:55:21,461 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 19:55:21,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 19:55:21,464 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 19:55:21,464 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 19:55:21,464 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 19:55:21,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 19:55:21,465 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 19:55:21,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 19:55:21,466 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 19:55:21,467 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 19:55:21,467 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 19:55:21,467 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 19:55:21,467 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 19:55:21,468 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 19:55:21,468 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 19:55:21,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 19:55:21,468 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 19:55:21,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 19:55:21,469 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 19:55:21,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 19:55:21,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 19:55:21,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 19:55:21,725 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 19:55:21,726 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 19:55:21,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-08-25 19:55:22,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 19:55:22,876 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 19:55:22,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-commit-1.wvr-bad.c [2023-08-25 19:55:22,885 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d6d0c0/8c1116be6dbe49029d81cbe81fa45b99/FLAG6e447f66c [2023-08-25 19:55:22,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511d6d0c0/8c1116be6dbe49029d81cbe81fa45b99 [2023-08-25 19:55:22,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 19:55:22,903 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 19:55:22,905 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 19:55:22,905 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 19:55:22,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 19:55:22,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:55:22" (1/1) ... [2023-08-25 19:55:22,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac387ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:22, skipping insertion in model container [2023-08-25 19:55:22,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 07:55:22" (1/1) ... [2023-08-25 19:55:22,934 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 19:55:23,106 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 19:55:23,112 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 19:55:23,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 19:55:23,151 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 19:55:23,151 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 19:55:23,155 INFO L206 MainTranslator]: Completed translation [2023-08-25 19:55:23,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23 WrapperNode [2023-08-25 19:55:23,156 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 19:55:23,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 19:55:23,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 19:55:23,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 19:55:23,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,224 INFO L138 Inliner]: procedures = 25, calls = 69, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 777 [2023-08-25 19:55:23,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 19:55:23,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 19:55:23,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 19:55:23,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 19:55:23,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 19:55:23,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 19:55:23,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 19:55:23,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 19:55:23,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (1/1) ... [2023-08-25 19:55:23,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 19:55:23,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:55:23,319 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 19:55:23,326 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 19:55:23,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 19:55:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 19:55:23,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 19:55:23,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 19:55:23,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 19:55:23,346 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 19:55:23,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 19:55:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 19:55:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 19:55:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 19:55:23,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 19:55:23,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 19:55:23,348 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 19:55:23,473 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 19:55:23,475 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 19:55:24,109 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 19:55:24,669 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 19:55:24,669 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 19:55:24,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:55:24 BoogieIcfgContainer [2023-08-25 19:55:24,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 19:55:24,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 19:55:24,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 19:55:24,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 19:55:24,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 07:55:22" (1/3) ... [2023-08-25 19:55:24,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9bcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:55:24, skipping insertion in model container [2023-08-25 19:55:24,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 07:55:23" (2/3) ... [2023-08-25 19:55:24,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be9bcb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 07:55:24, skipping insertion in model container [2023-08-25 19:55:24,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 07:55:24" (3/3) ... [2023-08-25 19:55:24,678 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2023-08-25 19:55:24,692 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 19:55:24,693 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 129 error locations. [2023-08-25 19:55:24,693 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 19:55:24,820 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 19:55:24,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 508 places, 525 transitions, 1074 flow [2023-08-25 19:55:24,964 INFO L124 PetriNetUnfolderBase]: 27/522 cut-off events. [2023-08-25 19:55:24,965 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 19:55:24,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 522 events. 27/522 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1070 event pairs, 0 based on Foata normal form. 0/366 useless extension candidates. Maximal degree in co-relation 431. Up to 6 conditions per place. [2023-08-25 19:55:24,971 INFO L82 GeneralOperation]: Start removeDead. Operand has 508 places, 525 transitions, 1074 flow [2023-08-25 19:55:24,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 494 places, 511 transitions, 1040 flow [2023-08-25 19:55:24,983 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 19:55:24,989 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 494 places, 511 transitions, 1040 flow [2023-08-25 19:55:24,991 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 494 places, 511 transitions, 1040 flow [2023-08-25 19:55:24,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 494 places, 511 transitions, 1040 flow [2023-08-25 19:55:25,075 INFO L124 PetriNetUnfolderBase]: 27/511 cut-off events. [2023-08-25 19:55:25,075 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 19:55:25,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 511 events. 27/511 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1069 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 431. Up to 6 conditions per place. [2023-08-25 19:55:25,086 INFO L119 LiptonReduction]: Number of co-enabled transitions 24776 [2023-08-25 19:55:51,545 INFO L134 LiptonReduction]: Checked pairs total: 60989 [2023-08-25 19:55:51,546 INFO L136 LiptonReduction]: Total number of compositions: 746 [2023-08-25 19:55:51,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 19:55:51,562 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;@67e24c82, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 19:55:51,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 232 error locations. [2023-08-25 19:55:51,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 19:55:51,564 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 19:55:51,564 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 19:55:51,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:51,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 19:55:51,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:51,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:51,569 INFO L85 PathProgramCache]: Analyzing trace with hash 3432, now seen corresponding path program 1 times [2023-08-25 19:55:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:51,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85885778] [2023-08-25 19:55:51,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:51,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:51,643 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 19:55:51,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:51,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85885778] [2023-08-25 19:55:51,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85885778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:51,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:51,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 19:55:51,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683759564] [2023-08-25 19:55:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:51,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 19:55:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 19:55:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 19:55:51,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 1271 [2023-08-25 19:55:51,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 165 transitions, 348 flow. Second operand has 2 states, 2 states have (on average 405.5) internal successors, (811), 2 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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 19:55:51,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:51,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 1271 [2023-08-25 19:55:51,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:51,828 INFO L124 PetriNetUnfolderBase]: 84/200 cut-off events. [2023-08-25 19:55:51,828 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-08-25 19:55:51,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 200 events. 84/200 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 505 event pairs, 37 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 228. Up to 131 conditions per place. [2023-08-25 19:55:51,830 INFO L140 encePairwiseOnDemand]: 1146/1271 looper letters, 25 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-08-25 19:55:51,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 148 flow [2023-08-25 19:55:51,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 19:55:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 19:55:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 960 transitions. [2023-08-25 19:55:51,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3776553894571204 [2023-08-25 19:55:51,846 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 960 transitions. [2023-08-25 19:55:51,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 960 transitions. [2023-08-25 19:55:51,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:51,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 960 transitions. [2023-08-25 19:55:51,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 480.0) internal successors, (960), 2 states have internal predecessors, (960), 0 states have call successors, (0), 0 states 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 19:55:51,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1271.0) internal successors, (3813), 3 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states 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 19:55:51,863 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1271.0) internal successors, (3813), 3 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states 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 19:55:51,864 INFO L175 Difference]: Start difference. First operand has 169 places, 165 transitions, 348 flow. Second operand 2 states and 960 transitions. [2023-08-25 19:55:51,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 148 flow [2023-08-25 19:55:51,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 40 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 19:55:51,868 INFO L231 Difference]: Finished difference. Result has 39 places, 40 transitions, 86 flow [2023-08-25 19:55:51,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=40} [2023-08-25 19:55:51,872 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -130 predicate places. [2023-08-25 19:55:51,872 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 40 transitions, 86 flow [2023-08-25 19:55:51,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 405.5) internal successors, (811), 2 states have internal predecessors, (811), 0 states have call successors, (0), 0 states 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 19:55:51,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:51,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 19:55:51,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 19:55:51,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:51,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:51,875 INFO L85 PathProgramCache]: Analyzing trace with hash 954197475, now seen corresponding path program 1 times [2023-08-25 19:55:51,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:51,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788573684] [2023-08-25 19:55:51,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:52,358 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 19:55:52,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788573684] [2023-08-25 19:55:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788573684] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:52,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:52,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 19:55:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181447033] [2023-08-25 19:55:52,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:52,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 19:55:52,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 19:55:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 19:55:52,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 1271 [2023-08-25 19:55:52,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 40 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 365.3333333333333) internal successors, (2192), 6 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states 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 19:55:52,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:52,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 1271 [2023-08-25 19:55:52,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:53,185 INFO L124 PetriNetUnfolderBase]: 230/338 cut-off events. [2023-08-25 19:55:53,185 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 19:55:53,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 686 conditions, 338 events. 230/338 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 587 event pairs, 15 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 683. Up to 178 conditions per place. [2023-08-25 19:55:53,186 INFO L140 encePairwiseOnDemand]: 1266/1271 looper letters, 59 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-25 19:55:53,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 63 transitions, 258 flow [2023-08-25 19:55:53,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 19:55:53,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 19:55:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2242 transitions. [2023-08-25 19:55:53,191 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2939942302648833 [2023-08-25 19:55:53,191 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2242 transitions. [2023-08-25 19:55:53,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2242 transitions. [2023-08-25 19:55:53,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:53,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2242 transitions. [2023-08-25 19:55:53,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 373.6666666666667) internal successors, (2242), 6 states have internal predecessors, (2242), 0 states have call successors, (0), 0 states 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 19:55:53,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:53,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:53,205 INFO L175 Difference]: Start difference. First operand has 39 places, 40 transitions, 86 flow. Second operand 6 states and 2242 transitions. [2023-08-25 19:55:53,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 63 transitions, 258 flow [2023-08-25 19:55:53,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 19:55:53,207 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 92 flow [2023-08-25 19:55:53,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-25 19:55:53,208 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -126 predicate places. [2023-08-25 19:55:53,208 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 92 flow [2023-08-25 19:55:53,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.3333333333333) internal successors, (2192), 6 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states 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 19:55:53,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:53,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 19:55:53,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 19:55:53,209 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:53,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:53,210 INFO L85 PathProgramCache]: Analyzing trace with hash -51987006, now seen corresponding path program 1 times [2023-08-25 19:55:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734659462] [2023-08-25 19:55:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:53,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:53,508 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 19:55:53,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:53,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734659462] [2023-08-25 19:55:53,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734659462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:53,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:53,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 19:55:53,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852996765] [2023-08-25 19:55:53,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 19:55:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:53,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 19:55:53,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 19:55:53,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 1271 [2023-08-25 19:55:53,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 92 flow. Second operand has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states 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 19:55:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 1271 [2023-08-25 19:55:53,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:53,967 INFO L124 PetriNetUnfolderBase]: 222/326 cut-off events. [2023-08-25 19:55:53,967 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-25 19:55:53,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 326 events. 222/326 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 557 event pairs, 79 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 691. Up to 237 conditions per place. [2023-08-25 19:55:53,968 INFO L140 encePairwiseOnDemand]: 1266/1271 looper letters, 50 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-25 19:55:53,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 230 flow [2023-08-25 19:55:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 19:55:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 19:55:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2233 transitions. [2023-08-25 19:55:53,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29281405717282977 [2023-08-25 19:55:53,973 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2233 transitions. [2023-08-25 19:55:53,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2233 transitions. [2023-08-25 19:55:53,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:53,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2233 transitions. [2023-08-25 19:55:53,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 372.1666666666667) internal successors, (2233), 6 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states 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 19:55:53,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:53,987 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:53,987 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 92 flow. Second operand 6 states and 2233 transitions. [2023-08-25 19:55:53,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 230 flow [2023-08-25 19:55:53,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 223 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 19:55:53,988 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 91 flow [2023-08-25 19:55:53,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-08-25 19:55:53,989 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -126 predicate places. [2023-08-25 19:55:53,989 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 91 flow [2023-08-25 19:55:53,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 366.5) internal successors, (2199), 6 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states 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 19:55:53,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:53,990 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] [2023-08-25 19:55:53,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 19:55:53,991 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:53,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash 290672590, now seen corresponding path program 1 times [2023-08-25 19:55:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:53,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056242485] [2023-08-25 19:55:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:54,256 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 19:55:54,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:54,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056242485] [2023-08-25 19:55:54,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056242485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:54,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:54,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 19:55:54,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33924404] [2023-08-25 19:55:54,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:54,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 19:55:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 19:55:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 19:55:54,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 1271 [2023-08-25 19:55:54,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 367.6666666666667) internal successors, (2206), 6 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states 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 19:55:54,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:54,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 1271 [2023-08-25 19:55:54,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:54,634 INFO L124 PetriNetUnfolderBase]: 220/322 cut-off events. [2023-08-25 19:55:54,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 19:55:54,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 322 events. 220/322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 548 event pairs, 100 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 675. Up to 301 conditions per place. [2023-08-25 19:55:54,635 INFO L140 encePairwiseOnDemand]: 1266/1271 looper letters, 41 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-08-25 19:55:54,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 195 flow [2023-08-25 19:55:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 19:55:54,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 19:55:54,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2224 transitions. [2023-08-25 19:55:54,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2916338840807763 [2023-08-25 19:55:54,640 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2224 transitions. [2023-08-25 19:55:54,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2224 transitions. [2023-08-25 19:55:54,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:54,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2224 transitions. [2023-08-25 19:55:54,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 370.6666666666667) internal successors, (2224), 6 states have internal predecessors, (2224), 0 states have call successors, (0), 0 states 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 19:55:54,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:54,651 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:55:54,651 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 91 flow. Second operand 6 states and 2224 transitions. [2023-08-25 19:55:54,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 195 flow [2023-08-25 19:55:54,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 19:55:54,652 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 90 flow [2023-08-25 19:55:54,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-25 19:55:54,653 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -126 predicate places. [2023-08-25 19:55:54,653 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 90 flow [2023-08-25 19:55:54,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 367.6666666666667) internal successors, (2206), 6 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states 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 19:55:54,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:54,654 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] [2023-08-25 19:55:54,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 19:55:54,654 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:54,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:54,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1459357173, now seen corresponding path program 1 times [2023-08-25 19:55:54,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:54,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188662584] [2023-08-25 19:55:54,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:54,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:54,766 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 19:55:54,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:54,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188662584] [2023-08-25 19:55:54,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188662584] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:54,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:54,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 19:55:54,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587624010] [2023-08-25 19:55:54,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:54,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 19:55:54,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:54,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 19:55:54,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 19:55:54,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 1271 [2023-08-25 19:55:54,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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 19:55:54,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:54,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 1271 [2023-08-25 19:55:54,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:55,006 INFO L124 PetriNetUnfolderBase]: 164/331 cut-off events. [2023-08-25 19:55:55,006 INFO L125 PetriNetUnfolderBase]: For 14/22 co-relation queries the response was YES. [2023-08-25 19:55:55,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 331 events. 164/331 cut-off events. For 14/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 999 event pairs, 37 based on Foata normal form. 5/245 useless extension candidates. Maximal degree in co-relation 627. Up to 167 conditions per place. [2023-08-25 19:55:55,008 INFO L140 encePairwiseOnDemand]: 1266/1271 looper letters, 36 selfloop transitions, 4 changer transitions 1/53 dead transitions. [2023-08-25 19:55:55,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 211 flow [2023-08-25 19:55:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 19:55:55,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 19:55:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2023-08-25 19:55:55,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32730133752950435 [2023-08-25 19:55:55,010 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1248 transitions. [2023-08-25 19:55:55,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1248 transitions. [2023-08-25 19:55:55,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:55,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1248 transitions. [2023-08-25 19:55:55,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states 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 19:55:55,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1271.0) internal successors, (5084), 4 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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 19:55:55,017 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1271.0) internal successors, (5084), 4 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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 19:55:55,017 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 90 flow. Second operand 3 states and 1248 transitions. [2023-08-25 19:55:55,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 211 flow [2023-08-25 19:55:55,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 202 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 19:55:55,020 INFO L231 Difference]: Finished difference. Result has 42 places, 40 transitions, 109 flow [2023-08-25 19:55:55,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=42, PETRI_TRANSITIONS=40} [2023-08-25 19:55:55,021 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -127 predicate places. [2023-08-25 19:55:55,022 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 40 transitions, 109 flow [2023-08-25 19:55:55,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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 19:55:55,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:55,022 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 19:55:55,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 19:55:55,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:55,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:55,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1345096269, now seen corresponding path program 1 times [2023-08-25 19:55:55,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:55,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179461292] [2023-08-25 19:55:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:55,146 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 19:55:55,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:55,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179461292] [2023-08-25 19:55:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179461292] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:55,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 19:55:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348869103] [2023-08-25 19:55:55,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:55,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 19:55:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 19:55:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 19:55:55,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 1271 [2023-08-25 19:55:55,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 40 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states 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 19:55:55,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:55,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 1271 [2023-08-25 19:55:55,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:55,325 INFO L124 PetriNetUnfolderBase]: 146/309 cut-off events. [2023-08-25 19:55:55,326 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-08-25 19:55:55,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 309 events. 146/309 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 927 event pairs, 41 based on Foata normal form. 14/319 useless extension candidates. Maximal degree in co-relation 673. Up to 145 conditions per place. [2023-08-25 19:55:55,327 INFO L140 encePairwiseOnDemand]: 1267/1271 looper letters, 34 selfloop transitions, 3 changer transitions 1/50 dead transitions. [2023-08-25 19:55:55,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 206 flow [2023-08-25 19:55:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 19:55:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 19:55:55,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1215 transitions. [2023-08-25 19:55:55,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31864673485444533 [2023-08-25 19:55:55,330 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1215 transitions. [2023-08-25 19:55:55,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1215 transitions. [2023-08-25 19:55:55,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:55,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1215 transitions. [2023-08-25 19:55:55,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 405.0) internal successors, (1215), 3 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states 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 19:55:55,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1271.0) internal successors, (5084), 4 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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 19:55:55,336 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1271.0) internal successors, (5084), 4 states have internal predecessors, (5084), 0 states have call successors, (0), 0 states 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 19:55:55,336 INFO L175 Difference]: Start difference. First operand has 42 places, 40 transitions, 109 flow. Second operand 3 states and 1215 transitions. [2023-08-25 19:55:55,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 206 flow [2023-08-25 19:55:55,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 50 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 19:55:55,337 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 107 flow [2023-08-25 19:55:55,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2023-08-25 19:55:55,337 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -126 predicate places. [2023-08-25 19:55:55,338 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 107 flow [2023-08-25 19:55:55,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states 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 19:55:55,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:55,338 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 19:55:55,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 19:55:55,338 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:55,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1798256102, now seen corresponding path program 1 times [2023-08-25 19:55:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:55,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497002134] [2023-08-25 19:55:55,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:55,486 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 19:55:55,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:55,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497002134] [2023-08-25 19:55:55,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497002134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:55,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:55,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 19:55:55,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821952143] [2023-08-25 19:55:55,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:55,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 19:55:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:55,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 19:55:55,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 19:55:55,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 1271 [2023-08-25 19:55:55,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 19:55:55,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:55,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 1271 [2023-08-25 19:55:55,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:55,809 INFO L124 PetriNetUnfolderBase]: 263/653 cut-off events. [2023-08-25 19:55:55,809 INFO L125 PetriNetUnfolderBase]: For 248/248 co-relation queries the response was YES. [2023-08-25 19:55:55,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 653 events. 263/653 cut-off events. For 248/248 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3054 event pairs, 174 based on Foata normal form. 28/675 useless extension candidates. Maximal degree in co-relation 1326. Up to 230 conditions per place. [2023-08-25 19:55:55,811 INFO L140 encePairwiseOnDemand]: 1267/1271 looper letters, 48 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-08-25 19:55:55,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 273 flow [2023-08-25 19:55:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 19:55:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 19:55:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1421 transitions. [2023-08-25 19:55:55,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2795043273013375 [2023-08-25 19:55:55,814 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1421 transitions. [2023-08-25 19:55:55,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1421 transitions. [2023-08-25 19:55:55,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:55,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1421 transitions. [2023-08-25 19:55:55,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 355.25) internal successors, (1421), 4 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states 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 19:55:55,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:55,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:55,821 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 107 flow. Second operand 4 states and 1421 transitions. [2023-08-25 19:55:55,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 273 flow [2023-08-25 19:55:55,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 265 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 19:55:55,826 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 123 flow [2023-08-25 19:55:55,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-25 19:55:55,826 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -123 predicate places. [2023-08-25 19:55:55,827 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 123 flow [2023-08-25 19:55:55,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 348.0) internal successors, (1392), 4 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states 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 19:55:55,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:55,827 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 19:55:55,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 19:55:55,828 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:55,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1904541609, now seen corresponding path program 1 times [2023-08-25 19:55:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:55,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729011802] [2023-08-25 19:55:55,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:55,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:55,911 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 19:55:55,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:55,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729011802] [2023-08-25 19:55:55,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729011802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:55:55,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:55:55,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 19:55:55,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508476781] [2023-08-25 19:55:55,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:55:55,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 19:55:55,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:55,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 19:55:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 19:55:55,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 1271 [2023-08-25 19:55:55,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 19:55:55,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:55,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 1271 [2023-08-25 19:55:55,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:56,161 INFO L124 PetriNetUnfolderBase]: 261/609 cut-off events. [2023-08-25 19:55:56,161 INFO L125 PetriNetUnfolderBase]: For 196/231 co-relation queries the response was YES. [2023-08-25 19:55:56,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1284 conditions, 609 events. 261/609 cut-off events. For 196/231 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2683 event pairs, 114 based on Foata normal form. 48/646 useless extension candidates. Maximal degree in co-relation 1277. Up to 253 conditions per place. [2023-08-25 19:55:56,164 INFO L140 encePairwiseOnDemand]: 1268/1271 looper letters, 49 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-25 19:55:56,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 65 transitions, 299 flow [2023-08-25 19:55:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 19:55:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 19:55:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1635 transitions. [2023-08-25 19:55:56,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32159716758457907 [2023-08-25 19:55:56,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1635 transitions. [2023-08-25 19:55:56,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1635 transitions. [2023-08-25 19:55:56,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:56,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1635 transitions. [2023-08-25 19:55:56,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 408.75) internal successors, (1635), 4 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 19:55:56,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:56,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:56,174 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 123 flow. Second operand 4 states and 1635 transitions. [2023-08-25 19:55:56,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 65 transitions, 299 flow [2023-08-25 19:55:56,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 289 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-25 19:55:56,176 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 131 flow [2023-08-25 19:55:56,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-25 19:55:56,177 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -119 predicate places. [2023-08-25 19:55:56,177 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 131 flow [2023-08-25 19:55:56,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 401.0) internal successors, (1604), 4 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states 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 19:55:56,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:56,177 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 19:55:56,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 19:55:56,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:56,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1531261174, now seen corresponding path program 1 times [2023-08-25 19:55:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695700911] [2023-08-25 19:55:56,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:56,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:56,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695700911] [2023-08-25 19:55:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695700911] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:55:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246610087] [2023-08-25 19:55:56,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:55:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:55:56,408 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 19:55:56,413 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 19:55:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:56,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-25 19:55:56,648 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:55:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:56,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:55:57,349 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:55:57,350 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 418 treesize of output 406 [2023-08-25 19:55:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:57,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246610087] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:55:57,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:55:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2023-08-25 19:55:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434664609] [2023-08-25 19:55:57,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:55:57,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 19:55:57,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:57,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 19:55:57,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-25 19:55:57,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 1271 [2023-08-25 19:55:57,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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 19:55:57,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:57,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 1271 [2023-08-25 19:55:57,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:55:57,993 INFO L124 PetriNetUnfolderBase]: 270/563 cut-off events. [2023-08-25 19:55:57,993 INFO L125 PetriNetUnfolderBase]: For 224/265 co-relation queries the response was YES. [2023-08-25 19:55:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 563 events. 270/563 cut-off events. For 224/265 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2241 event pairs, 59 based on Foata normal form. 6/558 useless extension candidates. Maximal degree in co-relation 1281. Up to 281 conditions per place. [2023-08-25 19:55:57,995 INFO L140 encePairwiseOnDemand]: 1267/1271 looper letters, 42 selfloop transitions, 4 changer transitions 3/61 dead transitions. [2023-08-25 19:55:57,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 283 flow [2023-08-25 19:55:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 19:55:57,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 19:55:57,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1635 transitions. [2023-08-25 19:55:57,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32159716758457907 [2023-08-25 19:55:57,999 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1635 transitions. [2023-08-25 19:55:57,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1635 transitions. [2023-08-25 19:55:58,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:55:58,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1635 transitions. [2023-08-25 19:55:58,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 408.75) internal successors, (1635), 4 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 19:55:58,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:58,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1271.0) internal successors, (6355), 5 states have internal predecessors, (6355), 0 states have call successors, (0), 0 states 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 19:55:58,006 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 131 flow. Second operand 4 states and 1635 transitions. [2023-08-25 19:55:58,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 283 flow [2023-08-25 19:55:58,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 279 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 19:55:58,008 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 156 flow [2023-08-25 19:55:58,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-25 19:55:58,009 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -118 predicate places. [2023-08-25 19:55:58,009 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 156 flow [2023-08-25 19:55:58,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states 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 19:55:58,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:55:58,010 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 19:55:58,019 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 19:55:58,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:55:58,216 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:55:58,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:55:58,217 INFO L85 PathProgramCache]: Analyzing trace with hash 345111093, now seen corresponding path program 2 times [2023-08-25 19:55:58,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:55:58,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807111981] [2023-08-25 19:55:58,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:55:58,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:55:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:55:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:58,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:55:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807111981] [2023-08-25 19:55:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807111981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:55:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790310571] [2023-08-25 19:55:58,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 19:55:58,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:55:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:55:58,503 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 19:55:58,506 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 19:55:58,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 19:55:58,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 19:55:58,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 19:55:58,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:55:58,845 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:55:58,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:58,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:55:59,494 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:55:59,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 461 treesize of output 467 [2023-08-25 19:55:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:55:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790310571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:55:59,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:55:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-25 19:55:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305578057] [2023-08-25 19:55:59,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:55:59,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 19:55:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:55:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 19:55:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-08-25 19:55:59,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 1271 [2023-08-25 19:55:59,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 156 flow. Second operand has 13 states, 13 states have (on average 313.84615384615387) internal successors, (4080), 13 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states 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 19:55:59,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:55:59,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 1271 [2023-08-25 19:55:59,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:00,590 INFO L124 PetriNetUnfolderBase]: 387/872 cut-off events. [2023-08-25 19:56:00,591 INFO L125 PetriNetUnfolderBase]: For 564/614 co-relation queries the response was YES. [2023-08-25 19:56:00,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1995 conditions, 872 events. 387/872 cut-off events. For 564/614 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4307 event pairs, 110 based on Foata normal form. 65/921 useless extension candidates. Maximal degree in co-relation 1986. Up to 188 conditions per place. [2023-08-25 19:56:00,594 INFO L140 encePairwiseOnDemand]: 1261/1271 looper letters, 62 selfloop transitions, 11 changer transitions 20/105 dead transitions. [2023-08-25 19:56:00,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 105 transitions, 511 flow [2023-08-25 19:56:00,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 19:56:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 19:56:00,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3194 transitions. [2023-08-25 19:56:00,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25129819040125884 [2023-08-25 19:56:00,602 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3194 transitions. [2023-08-25 19:56:00,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3194 transitions. [2023-08-25 19:56:00,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:00,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3194 transitions. [2023-08-25 19:56:00,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 319.4) internal successors, (3194), 10 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states 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 19:56:00,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1271.0) internal successors, (13981), 11 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states 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 19:56:00,617 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1271.0) internal successors, (13981), 11 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states 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 19:56:00,617 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 156 flow. Second operand 10 states and 3194 transitions. [2023-08-25 19:56:00,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 105 transitions, 511 flow [2023-08-25 19:56:00,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 498 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-25 19:56:00,620 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 209 flow [2023-08-25 19:56:00,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-25 19:56:00,621 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -107 predicate places. [2023-08-25 19:56:00,622 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 209 flow [2023-08-25 19:56:00,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 313.84615384615387) internal successors, (4080), 13 states have internal predecessors, (4080), 0 states have call successors, (0), 0 states 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 19:56:00,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:00,623 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] [2023-08-25 19:56:00,632 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 19:56:00,832 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,SelfDestructingSolverStorable9 [2023-08-25 19:56:00,832 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:00,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1778944666, now seen corresponding path program 1 times [2023-08-25 19:56:00,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983659392] [2023-08-25 19:56:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:00,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:56:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983659392] [2023-08-25 19:56:01,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983659392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:01,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997226180] [2023-08-25 19:56:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:01,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:01,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:01,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 19:56:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:01,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-25 19:56:01,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:01,757 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:01,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:56:01,844 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:04,140 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:56:04,141 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 538 treesize of output 645 [2023-08-25 19:56:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:56:06,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997226180] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:56:06,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:56:06,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2023-08-25 19:56:06,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659201717] [2023-08-25 19:56:06,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:56:06,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 19:56:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:06,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 19:56:06,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-25 19:56:06,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 1271 [2023-08-25 19:56:06,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 209 flow. Second operand has 11 states, 11 states have (on average 350.27272727272725) internal successors, (3853), 11 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states 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 19:56:06,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:06,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 1271 [2023-08-25 19:56:06,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:07,452 INFO L124 PetriNetUnfolderBase]: 599/1288 cut-off events. [2023-08-25 19:56:07,452 INFO L125 PetriNetUnfolderBase]: For 1285/1447 co-relation queries the response was YES. [2023-08-25 19:56:07,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3238 conditions, 1288 events. 599/1288 cut-off events. For 1285/1447 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6896 event pairs, 88 based on Foata normal form. 17/1291 useless extension candidates. Maximal degree in co-relation 3224. Up to 425 conditions per place. [2023-08-25 19:56:07,459 INFO L140 encePairwiseOnDemand]: 1266/1271 looper letters, 52 selfloop transitions, 13 changer transitions 15/92 dead transitions. [2023-08-25 19:56:07,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 92 transitions, 521 flow [2023-08-25 19:56:07,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 19:56:07,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 19:56:07,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2141 transitions. [2023-08-25 19:56:07,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2807500655651718 [2023-08-25 19:56:07,463 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2141 transitions. [2023-08-25 19:56:07,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2141 transitions. [2023-08-25 19:56:07,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:07,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2141 transitions. [2023-08-25 19:56:07,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 356.8333333333333) internal successors, (2141), 6 states have internal predecessors, (2141), 0 states have call successors, (0), 0 states 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 19:56:07,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:56:07,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:56:07,474 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 209 flow. Second operand 6 states and 2141 transitions. [2023-08-25 19:56:07,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 92 transitions, 521 flow [2023-08-25 19:56:07,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 515 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 19:56:07,478 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 320 flow [2023-08-25 19:56:07,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-08-25 19:56:07,479 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -102 predicate places. [2023-08-25 19:56:07,479 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 320 flow [2023-08-25 19:56:07,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 350.27272727272725) internal successors, (3853), 11 states have internal predecessors, (3853), 0 states have call successors, (0), 0 states 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 19:56:07,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:07,480 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] [2023-08-25 19:56:07,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 19:56:07,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:07,686 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:07,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1614765662, now seen corresponding path program 1 times [2023-08-25 19:56:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241560453] [2023-08-25 19:56:07,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:07,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241560453] [2023-08-25 19:56:07,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241560453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 19:56:07,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 19:56:07,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 19:56:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408421936] [2023-08-25 19:56:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 19:56:07,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 19:56:07,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:07,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 19:56:07,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-25 19:56:07,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 1271 [2023-08-25 19:56:07,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 347.6) internal successors, (1738), 5 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states 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 19:56:07,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:07,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 1271 [2023-08-25 19:56:07,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:08,548 INFO L124 PetriNetUnfolderBase]: 1014/2406 cut-off events. [2023-08-25 19:56:08,548 INFO L125 PetriNetUnfolderBase]: For 3511/3831 co-relation queries the response was YES. [2023-08-25 19:56:08,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6177 conditions, 2406 events. 1014/2406 cut-off events. For 3511/3831 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16619 event pairs, 728 based on Foata normal form. 76/2439 useless extension candidates. Maximal degree in co-relation 6161. Up to 738 conditions per place. [2023-08-25 19:56:08,557 INFO L140 encePairwiseOnDemand]: 1263/1271 looper letters, 67 selfloop transitions, 16 changer transitions 0/95 dead transitions. [2023-08-25 19:56:08,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 699 flow [2023-08-25 19:56:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 19:56:08,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 19:56:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2119 transitions. [2023-08-25 19:56:08,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2778651980068188 [2023-08-25 19:56:08,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2119 transitions. [2023-08-25 19:56:08,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2119 transitions. [2023-08-25 19:56:08,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:08,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2119 transitions. [2023-08-25 19:56:08,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 353.1666666666667) internal successors, (2119), 6 states have internal predecessors, (2119), 0 states have call successors, (0), 0 states 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 19:56:08,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:56:08,570 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1271.0) internal successors, (8897), 7 states have internal predecessors, (8897), 0 states have call successors, (0), 0 states 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 19:56:08,570 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 320 flow. Second operand 6 states and 2119 transitions. [2023-08-25 19:56:08,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 699 flow [2023-08-25 19:56:08,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 95 transitions, 638 flow, removed 24 selfloop flow, removed 2 redundant places. [2023-08-25 19:56:08,578 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 335 flow [2023-08-25 19:56:08,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=335, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-08-25 19:56:08,579 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -98 predicate places. [2023-08-25 19:56:08,579 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 335 flow [2023-08-25 19:56:08,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 347.6) internal successors, (1738), 5 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states 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 19:56:08,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:08,580 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] [2023-08-25 19:56:08,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 19:56:08,580 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:08,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash -634734907, now seen corresponding path program 1 times [2023-08-25 19:56:08,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:08,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140962213] [2023-08-25 19:56:08,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:08,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:08,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140962213] [2023-08-25 19:56:08,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140962213] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:08,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554904883] [2023-08-25 19:56:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:08,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:08,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:08,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:08,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 19:56:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:09,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 19:56:09,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:09,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:11,038 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:56:11,038 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 909 treesize of output 940 [2023-08-25 19:56:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:11,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554904883] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:56:11,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:56:11,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2023-08-25 19:56:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531964706] [2023-08-25 19:56:11,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:56:11,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 19:56:11,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 19:56:11,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-25 19:56:11,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 344 out of 1271 [2023-08-25 19:56:11,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 335 flow. Second operand has 9 states, 9 states have (on average 349.3333333333333) internal successors, (3144), 9 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states 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 19:56:11,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:11,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 344 of 1271 [2023-08-25 19:56:11,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:12,595 INFO L124 PetriNetUnfolderBase]: 1086/2570 cut-off events. [2023-08-25 19:56:12,596 INFO L125 PetriNetUnfolderBase]: For 2761/3080 co-relation queries the response was YES. [2023-08-25 19:56:12,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6236 conditions, 2570 events. 1086/2570 cut-off events. For 2761/3080 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 17780 event pairs, 340 based on Foata normal form. 50/2592 useless extension candidates. Maximal degree in co-relation 6218. Up to 827 conditions per place. [2023-08-25 19:56:12,605 INFO L140 encePairwiseOnDemand]: 1267/1271 looper letters, 61 selfloop transitions, 6 changer transitions 7/86 dead transitions. [2023-08-25 19:56:12,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 86 transitions, 552 flow [2023-08-25 19:56:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 19:56:12,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 19:56:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1781 transitions. [2023-08-25 19:56:12,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2802517702596381 [2023-08-25 19:56:12,609 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1781 transitions. [2023-08-25 19:56:12,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1781 transitions. [2023-08-25 19:56:12,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:12,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1781 transitions. [2023-08-25 19:56:12,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 356.2) internal successors, (1781), 5 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states 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 19:56:12,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1271.0) internal successors, (7626), 6 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states 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 19:56:12,615 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1271.0) internal successors, (7626), 6 states have internal predecessors, (7626), 0 states have call successors, (0), 0 states 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 19:56:12,615 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 335 flow. Second operand 5 states and 1781 transitions. [2023-08-25 19:56:12,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 86 transitions, 552 flow [2023-08-25 19:56:12,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 86 transitions, 538 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-25 19:56:12,620 INFO L231 Difference]: Finished difference. Result has 74 places, 57 transitions, 323 flow [2023-08-25 19:56:12,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=74, PETRI_TRANSITIONS=57} [2023-08-25 19:56:12,620 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -95 predicate places. [2023-08-25 19:56:12,621 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 57 transitions, 323 flow [2023-08-25 19:56:12,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 349.3333333333333) internal successors, (3144), 9 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states 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 19:56:12,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:12,621 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 19:56:12,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 19:56:12,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:12,830 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:12,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:12,830 INFO L85 PathProgramCache]: Analyzing trace with hash 314560636, now seen corresponding path program 1 times [2023-08-25 19:56:12,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:12,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716177412] [2023-08-25 19:56:12,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:13,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:13,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716177412] [2023-08-25 19:56:13,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716177412] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:13,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154118212] [2023-08-25 19:56:13,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:13,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:13,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:13,116 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:13,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 19:56:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:13,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 19:56:13,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:13,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:14,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:16,826 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:56:16,826 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 674 treesize of output 765 [2023-08-25 19:56:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:18,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154118212] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:56:18,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:56:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-08-25 19:56:18,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811171683] [2023-08-25 19:56:18,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:56:18,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-25 19:56:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-25 19:56:18,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-08-25 19:56:18,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 1271 [2023-08-25 19:56:18,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 57 transitions, 323 flow. Second operand has 13 states, 13 states have (on average 346.9230769230769) internal successors, (4510), 13 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states 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 19:56:18,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:18,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 1271 [2023-08-25 19:56:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:19,714 INFO L124 PetriNetUnfolderBase]: 1040/2372 cut-off events. [2023-08-25 19:56:19,714 INFO L125 PetriNetUnfolderBase]: For 2917/3185 co-relation queries the response was YES. [2023-08-25 19:56:19,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5878 conditions, 2372 events. 1040/2372 cut-off events. For 2917/3185 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 15672 event pairs, 172 based on Foata normal form. 90/2440 useless extension candidates. Maximal degree in co-relation 5859. Up to 537 conditions per place. [2023-08-25 19:56:19,721 INFO L140 encePairwiseOnDemand]: 1267/1271 looper letters, 58 selfloop transitions, 11 changer transitions 22/103 dead transitions. [2023-08-25 19:56:19,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 103 transitions, 622 flow [2023-08-25 19:56:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 19:56:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 19:56:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2475 transitions. [2023-08-25 19:56:19,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.278183657412611 [2023-08-25 19:56:19,729 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2475 transitions. [2023-08-25 19:56:19,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2475 transitions. [2023-08-25 19:56:19,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:19,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2475 transitions. [2023-08-25 19:56:19,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 353.57142857142856) internal successors, (2475), 7 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states 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 19:56:19,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1271.0) internal successors, (10168), 8 states have internal predecessors, (10168), 0 states have call successors, (0), 0 states 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 19:56:19,740 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1271.0) internal successors, (10168), 8 states have internal predecessors, (10168), 0 states have call successors, (0), 0 states 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 19:56:19,741 INFO L175 Difference]: Start difference. First operand has 74 places, 57 transitions, 323 flow. Second operand 7 states and 2475 transitions. [2023-08-25 19:56:19,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 103 transitions, 622 flow [2023-08-25 19:56:19,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 103 transitions, 608 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-25 19:56:19,747 INFO L231 Difference]: Finished difference. Result has 76 places, 56 transitions, 333 flow [2023-08-25 19:56:19,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=76, PETRI_TRANSITIONS=56} [2023-08-25 19:56:19,748 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -93 predicate places. [2023-08-25 19:56:19,748 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 56 transitions, 333 flow [2023-08-25 19:56:19,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 346.9230769230769) internal successors, (4510), 13 states have internal predecessors, (4510), 0 states have call successors, (0), 0 states 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 19:56:19,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:19,749 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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 19:56:19,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 19:56:19,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-25 19:56:19,955 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:19,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1297627318, now seen corresponding path program 2 times [2023-08-25 19:56:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739207489] [2023-08-25 19:56:19,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:20,264 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:20,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739207489] [2023-08-25 19:56:20,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739207489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:20,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387035942] [2023-08-25 19:56:20,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 19:56:20,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:20,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:20,265 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:20,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 19:56:20,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 19:56:20,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 19:56:20,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-25 19:56:20,575 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:20,675 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:20,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:22,325 INFO L322 Elim1Store]: treesize reduction 38, result has 77.5 percent of original size [2023-08-25 19:56:22,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 954 treesize of output 1004 [2023-08-25 19:56:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 19:56:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387035942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:56:23,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:56:23,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-25 19:56:23,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660710458] [2023-08-25 19:56:23,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:56:23,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 19:56:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:23,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 19:56:23,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-08-25 19:56:23,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 1271 [2023-08-25 19:56:23,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 56 transitions, 333 flow. Second operand has 12 states, 12 states have (on average 292.6666666666667) internal successors, (3512), 12 states have internal predecessors, (3512), 0 states have call successors, (0), 0 states 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 19:56:23,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:23,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 1271 [2023-08-25 19:56:23,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:23,867 INFO L124 PetriNetUnfolderBase]: 874/2096 cut-off events. [2023-08-25 19:56:23,867 INFO L125 PetriNetUnfolderBase]: For 2957/3080 co-relation queries the response was YES. [2023-08-25 19:56:23,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5254 conditions, 2096 events. 874/2096 cut-off events. For 2957/3080 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 13780 event pairs, 228 based on Foata normal form. 34/2112 useless extension candidates. Maximal degree in co-relation 5235. Up to 665 conditions per place. [2023-08-25 19:56:23,874 INFO L140 encePairwiseOnDemand]: 1262/1271 looper letters, 37 selfloop transitions, 13 changer transitions 57/119 dead transitions. [2023-08-25 19:56:23,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 733 flow [2023-08-25 19:56:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 19:56:23,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 19:56:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2985 transitions. [2023-08-25 19:56:23,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23485444531864674 [2023-08-25 19:56:23,879 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2985 transitions. [2023-08-25 19:56:23,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2985 transitions. [2023-08-25 19:56:23,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:23,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2985 transitions. [2023-08-25 19:56:23,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 298.5) internal successors, (2985), 10 states have internal predecessors, (2985), 0 states have call successors, (0), 0 states 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 19:56:23,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1271.0) internal successors, (13981), 11 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states 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 19:56:23,890 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1271.0) internal successors, (13981), 11 states have internal predecessors, (13981), 0 states have call successors, (0), 0 states 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 19:56:23,891 INFO L175 Difference]: Start difference. First operand has 76 places, 56 transitions, 333 flow. Second operand 10 states and 2985 transitions. [2023-08-25 19:56:23,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 733 flow [2023-08-25 19:56:23,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 119 transitions, 701 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-25 19:56:23,895 INFO L231 Difference]: Finished difference. Result has 80 places, 54 transitions, 320 flow [2023-08-25 19:56:23,895 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=320, PETRI_PLACES=80, PETRI_TRANSITIONS=54} [2023-08-25 19:56:23,895 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -89 predicate places. [2023-08-25 19:56:23,895 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 54 transitions, 320 flow [2023-08-25 19:56:23,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 292.6666666666667) internal successors, (3512), 12 states have internal predecessors, (3512), 0 states have call successors, (0), 0 states 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 19:56:23,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:23,896 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 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 19:56:23,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-25 19:56:24,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-25 19:56:24,104 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:24,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:24,104 INFO L85 PathProgramCache]: Analyzing trace with hash 256755143, now seen corresponding path program 1 times [2023-08-25 19:56:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:24,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95296940] [2023-08-25 19:56:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:24,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95296940] [2023-08-25 19:56:24,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95296940] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:24,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666336840] [2023-08-25 19:56:24,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:24,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:24,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:24,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 19:56:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:25,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 19:56:25,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:25,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:25,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:25,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:25,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:29,539 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 19:56:29,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 596 treesize of output 794 [2023-08-25 19:56:31,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:31,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666336840] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 19:56:31,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 19:56:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 14 [2023-08-25 19:56:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021494948] [2023-08-25 19:56:31,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 19:56:31,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-25 19:56:31,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 19:56:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-25 19:56:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-08-25 19:56:31,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 1271 [2023-08-25 19:56:31,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 54 transitions, 320 flow. Second operand has 15 states, 15 states have (on average 279.06666666666666) internal successors, (4186), 15 states have internal predecessors, (4186), 0 states have call successors, (0), 0 states 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 19:56:31,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 19:56:31,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 1271 [2023-08-25 19:56:31,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 19:56:33,742 INFO L124 PetriNetUnfolderBase]: 1291/2900 cut-off events. [2023-08-25 19:56:33,742 INFO L125 PetriNetUnfolderBase]: For 3460/3648 co-relation queries the response was YES. [2023-08-25 19:56:33,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7438 conditions, 2900 events. 1291/2900 cut-off events. For 3460/3648 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 19582 event pairs, 186 based on Foata normal form. 103/2984 useless extension candidates. Maximal degree in co-relation 7419. Up to 447 conditions per place. [2023-08-25 19:56:33,754 INFO L140 encePairwiseOnDemand]: 1265/1271 looper letters, 116 selfloop transitions, 27 changer transitions 52/207 dead transitions. [2023-08-25 19:56:33,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 207 transitions, 1288 flow [2023-08-25 19:56:33,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-25 19:56:33,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-25 19:56:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4859 transitions. [2023-08-25 19:56:33,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.22488082565835146 [2023-08-25 19:56:33,761 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4859 transitions. [2023-08-25 19:56:33,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4859 transitions. [2023-08-25 19:56:33,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 19:56:33,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4859 transitions. [2023-08-25 19:56:33,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 285.8235294117647) internal successors, (4859), 17 states have internal predecessors, (4859), 0 states have call successors, (0), 0 states 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 19:56:33,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 1271.0) internal successors, (22878), 18 states have internal predecessors, (22878), 0 states have call successors, (0), 0 states 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 19:56:33,779 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 1271.0) internal successors, (22878), 18 states have internal predecessors, (22878), 0 states have call successors, (0), 0 states 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 19:56:33,779 INFO L175 Difference]: Start difference. First operand has 80 places, 54 transitions, 320 flow. Second operand 17 states and 4859 transitions. [2023-08-25 19:56:33,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 207 transitions, 1288 flow [2023-08-25 19:56:33,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 207 transitions, 1224 flow, removed 4 selfloop flow, removed 8 redundant places. [2023-08-25 19:56:33,785 INFO L231 Difference]: Finished difference. Result has 92 places, 69 transitions, 523 flow [2023-08-25 19:56:33,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1271, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=523, PETRI_PLACES=92, PETRI_TRANSITIONS=69} [2023-08-25 19:56:33,786 INFO L281 CegarLoopForPetriNet]: 169 programPoint places, -77 predicate places. [2023-08-25 19:56:33,786 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 69 transitions, 523 flow [2023-08-25 19:56:33,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 279.06666666666666) internal successors, (4186), 15 states have internal predecessors, (4186), 0 states have call successors, (0), 0 states 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 19:56:33,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 19:56:33,786 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 19:56:33,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 19:56:33,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:33,994 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 228 more)] === [2023-08-25 19:56:33,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 19:56:33,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1562674683, now seen corresponding path program 2 times [2023-08-25 19:56:33,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 19:56:33,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207803129] [2023-08-25 19:56:33,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 19:56:33,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 19:56:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 19:56:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 19:56:34,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 19:56:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207803129] [2023-08-25 19:56:34,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207803129] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 19:56:34,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882266117] [2023-08-25 19:56:34,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 19:56:34,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 19:56:34,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 19:56:34,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 19:56:34,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-25 19:56:35,290 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 19:56:35,290 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 19:56:35,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-25 19:56:35,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 19:56:35,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:35,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 19:56:36,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 19:56:36,392 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 19:56:47,597 WARN L234 SmtUtils]: Spent 5.51s on a formula simplification. DAG size of input: 689 DAG size of output: 647 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-25 19:56:47,599 INFO L322 Elim1Store]: treesize reduction 154, result has 94.2 percent of original size [2023-08-25 19:56:47,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 171 case distinctions, treesize of input 971 treesize of output 3244 Received shutdown request... [2023-08-25 20:09:14,093 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-25 20:09:14,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONASSERT (231 of 232 remaining) [2023-08-25 20:09:14,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-25 20:09:14,115 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 20:09:14,118 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 20:09:14,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-25 20:09:14,297 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (230 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (229 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (228 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (227 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (226 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (225 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (224 of 232 remaining) [2023-08-25 20:09:14,298 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (223 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (222 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (221 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (220 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (219 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (218 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (217 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (216 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (215 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (214 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (213 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (212 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (211 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (210 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (209 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (208 of 232 remaining) [2023-08-25 20:09:14,299 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err23ASSERT_VIOLATIONDATA_RACE (207 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err24ASSERT_VIOLATIONDATA_RACE (206 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err25ASSERT_VIOLATIONDATA_RACE (205 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err26ASSERT_VIOLATIONDATA_RACE (204 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err27ASSERT_VIOLATIONDATA_RACE (203 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err28ASSERT_VIOLATIONDATA_RACE (202 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err29ASSERT_VIOLATIONDATA_RACE (201 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err30ASSERT_VIOLATIONDATA_RACE (200 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err31ASSERT_VIOLATIONDATA_RACE (199 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err32ASSERT_VIOLATIONDATA_RACE (198 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err33ASSERT_VIOLATIONDATA_RACE (197 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err34ASSERT_VIOLATIONDATA_RACE (196 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err35ASSERT_VIOLATIONDATA_RACE (195 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err36ASSERT_VIOLATIONDATA_RACE (194 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err37ASSERT_VIOLATIONDATA_RACE (193 of 232 remaining) [2023-08-25 20:09:14,300 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err38ASSERT_VIOLATIONDATA_RACE (192 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err39ASSERT_VIOLATIONDATA_RACE (191 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err40ASSERT_VIOLATIONDATA_RACE (190 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err41ASSERT_VIOLATIONDATA_RACE (189 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err42ASSERT_VIOLATIONDATA_RACE (188 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err43ASSERT_VIOLATIONDATA_RACE (187 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err44ASSERT_VIOLATIONDATA_RACE (186 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err45ASSERT_VIOLATIONDATA_RACE (185 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err46ASSERT_VIOLATIONDATA_RACE (184 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err47ASSERT_VIOLATIONDATA_RACE (183 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err48ASSERT_VIOLATIONDATA_RACE (182 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err49ASSERT_VIOLATIONDATA_RACE (181 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (180 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (179 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (178 of 232 remaining) [2023-08-25 20:09:14,301 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (177 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (176 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (175 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (174 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (173 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (172 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (171 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (170 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (169 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (168 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (167 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (166 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (165 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (164 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (163 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (162 of 232 remaining) [2023-08-25 20:09:14,302 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (161 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (160 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (159 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (158 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (157 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (156 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (155 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (154 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (153 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (152 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (151 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (150 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (149 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (148 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (147 of 232 remaining) [2023-08-25 20:09:14,303 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (146 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (145 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (144 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (143 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (142 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err14ASSERT_VIOLATIONDATA_RACE (141 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err15ASSERT_VIOLATIONDATA_RACE (140 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err16ASSERT_VIOLATIONDATA_RACE (139 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err17ASSERT_VIOLATIONDATA_RACE (138 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err18ASSERT_VIOLATIONDATA_RACE (137 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err19ASSERT_VIOLATIONDATA_RACE (136 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err20ASSERT_VIOLATIONDATA_RACE (135 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err21ASSERT_VIOLATIONDATA_RACE (134 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err22ASSERT_VIOLATIONDATA_RACE (133 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err23ASSERT_VIOLATIONDATA_RACE (132 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err24ASSERT_VIOLATIONDATA_RACE (131 of 232 remaining) [2023-08-25 20:09:14,304 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (130 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (129 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (128 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (127 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (126 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (125 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (124 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (123 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (122 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (121 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (120 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (119 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (118 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (117 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (116 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (115 of 232 remaining) [2023-08-25 20:09:14,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (114 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (113 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (112 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (111 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (108 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (107 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (106 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (105 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (104 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (103 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (101 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 232 remaining) [2023-08-25 20:09:14,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONDATA_RACE (99 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONDATA_RACE (98 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONDATA_RACE (97 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONDATA_RACE (96 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONDATA_RACE (95 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONDATA_RACE (94 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6ASSERT_VIOLATIONDATA_RACE (93 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err7ASSERT_VIOLATIONDATA_RACE (92 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err8ASSERT_VIOLATIONDATA_RACE (91 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err9ASSERT_VIOLATIONDATA_RACE (90 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err10ASSERT_VIOLATIONDATA_RACE (89 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err11ASSERT_VIOLATIONDATA_RACE (88 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err13ASSERT_VIOLATIONDATA_RACE (86 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 232 remaining) [2023-08-25 20:09:14,307 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err15ASSERT_VIOLATIONDATA_RACE (84 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err16ASSERT_VIOLATIONDATA_RACE (83 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err17ASSERT_VIOLATIONDATA_RACE (82 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err19ASSERT_VIOLATIONDATA_RACE (80 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err20ASSERT_VIOLATIONDATA_RACE (79 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err21ASSERT_VIOLATIONDATA_RACE (78 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err22ASSERT_VIOLATIONDATA_RACE (77 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err23ASSERT_VIOLATIONDATA_RACE (76 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err24ASSERT_VIOLATIONDATA_RACE (75 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err25ASSERT_VIOLATIONDATA_RACE (74 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err26ASSERT_VIOLATIONDATA_RACE (73 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err27ASSERT_VIOLATIONDATA_RACE (72 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err28ASSERT_VIOLATIONDATA_RACE (71 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err29ASSERT_VIOLATIONDATA_RACE (70 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err30ASSERT_VIOLATIONDATA_RACE (69 of 232 remaining) [2023-08-25 20:09:14,308 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err31ASSERT_VIOLATIONDATA_RACE (68 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err32ASSERT_VIOLATIONDATA_RACE (67 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err33ASSERT_VIOLATIONDATA_RACE (66 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err34ASSERT_VIOLATIONDATA_RACE (65 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err35ASSERT_VIOLATIONDATA_RACE (64 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err36ASSERT_VIOLATIONDATA_RACE (63 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err37ASSERT_VIOLATIONDATA_RACE (62 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err38ASSERT_VIOLATIONDATA_RACE (61 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err39ASSERT_VIOLATIONDATA_RACE (60 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err40ASSERT_VIOLATIONDATA_RACE (59 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err41ASSERT_VIOLATIONDATA_RACE (58 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err42ASSERT_VIOLATIONDATA_RACE (57 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err43ASSERT_VIOLATIONDATA_RACE (56 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err44ASSERT_VIOLATIONDATA_RACE (55 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err45ASSERT_VIOLATIONDATA_RACE (54 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err46ASSERT_VIOLATIONDATA_RACE (53 of 232 remaining) [2023-08-25 20:09:14,309 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err47ASSERT_VIOLATIONDATA_RACE (52 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err48ASSERT_VIOLATIONDATA_RACE (51 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err49ASSERT_VIOLATIONDATA_RACE (50 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONDATA_RACE (49 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONDATA_RACE (48 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONDATA_RACE (47 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONDATA_RACE (46 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONDATA_RACE (45 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONDATA_RACE (44 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONDATA_RACE (42 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err8ASSERT_VIOLATIONDATA_RACE (41 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err9ASSERT_VIOLATIONDATA_RACE (40 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err10ASSERT_VIOLATIONDATA_RACE (39 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err11ASSERT_VIOLATIONDATA_RACE (38 of 232 remaining) [2023-08-25 20:09:14,310 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err12ASSERT_VIOLATIONDATA_RACE (37 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err13ASSERT_VIOLATIONDATA_RACE (36 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err14ASSERT_VIOLATIONDATA_RACE (35 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err15ASSERT_VIOLATIONDATA_RACE (34 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err16ASSERT_VIOLATIONDATA_RACE (33 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err17ASSERT_VIOLATIONDATA_RACE (32 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err18ASSERT_VIOLATIONDATA_RACE (31 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err19ASSERT_VIOLATIONDATA_RACE (30 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err20ASSERT_VIOLATIONDATA_RACE (29 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err21ASSERT_VIOLATIONDATA_RACE (28 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err22ASSERT_VIOLATIONDATA_RACE (27 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err23ASSERT_VIOLATIONDATA_RACE (26 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err24ASSERT_VIOLATIONDATA_RACE (25 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err0ASSERT_VIOLATIONDATA_RACE (24 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err1ASSERT_VIOLATIONDATA_RACE (23 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err2ASSERT_VIOLATIONDATA_RACE (22 of 232 remaining) [2023-08-25 20:09:14,311 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err3ASSERT_VIOLATIONDATA_RACE (21 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err4ASSERT_VIOLATIONDATA_RACE (20 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err6ASSERT_VIOLATIONDATA_RACE (18 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err7ASSERT_VIOLATIONDATA_RACE (17 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err8ASSERT_VIOLATIONDATA_RACE (16 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err9ASSERT_VIOLATIONDATA_RACE (15 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err10ASSERT_VIOLATIONDATA_RACE (14 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err11ASSERT_VIOLATIONDATA_RACE (13 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err13ASSERT_VIOLATIONDATA_RACE (11 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err15ASSERT_VIOLATIONDATA_RACE (9 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err16ASSERT_VIOLATIONDATA_RACE (8 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err17ASSERT_VIOLATIONDATA_RACE (7 of 232 remaining) [2023-08-25 20:09:14,312 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err18ASSERT_VIOLATIONDATA_RACE (6 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err19ASSERT_VIOLATIONDATA_RACE (5 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err20ASSERT_VIOLATIONDATA_RACE (4 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err21ASSERT_VIOLATIONDATA_RACE (3 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err22ASSERT_VIOLATIONDATA_RACE (2 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err23ASSERT_VIOLATIONDATA_RACE (1 of 232 remaining) [2023-08-25 20:09:14,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread3Err24ASSERT_VIOLATIONDATA_RACE (0 of 232 remaining) [2023-08-25 20:09:14,313 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 20:09:14,318 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 20:09:14,318 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 20:09:14,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:09:14 BasicIcfg [2023-08-25 20:09:14,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 20:09:14,320 INFO L158 Benchmark]: Toolchain (without parser) took 831417.46ms. Allocated memory was 346.0MB in the beginning and 1.7GB in the end (delta: 1.4GB). Free memory was 321.1MB in the beginning and 839.8MB in the end (delta: -518.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-25 20:09:14,320 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 346.0MB. Free memory was 323.7MB in the beginning and 323.6MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 20:09:14,320 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.10ms. Allocated memory is still 346.0MB. Free memory was 321.1MB in the beginning and 306.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-25 20:09:14,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.24ms. Allocated memory is still 346.0MB. Free memory was 306.3MB in the beginning and 301.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 20:09:14,321 INFO L158 Benchmark]: Boogie Preprocessor took 69.19ms. Allocated memory is still 346.0MB. Free memory was 301.7MB in the beginning and 297.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 20:09:14,321 INFO L158 Benchmark]: RCFGBuilder took 1377.29ms. Allocated memory was 346.0MB in the beginning and 482.3MB in the end (delta: 136.3MB). Free memory was 297.5MB in the beginning and 403.6MB in the end (delta: -106.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.0GB. [2023-08-25 20:09:14,321 INFO L158 Benchmark]: TraceAbstraction took 829645.74ms. Allocated memory was 482.3MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 403.6MB in the beginning and 839.8MB in the end (delta: -436.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-25 20:09:14,322 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.11ms. Allocated memory is still 346.0MB. Free memory was 323.7MB in the beginning and 323.6MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 251.10ms. Allocated memory is still 346.0MB. Free memory was 321.1MB in the beginning and 306.3MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 68.24ms. Allocated memory is still 346.0MB. Free memory was 306.3MB in the beginning and 301.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 69.19ms. Allocated memory is still 346.0MB. Free memory was 301.7MB in the beginning and 297.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1377.29ms. Allocated memory was 346.0MB in the beginning and 482.3MB in the end (delta: 136.3MB). Free memory was 297.5MB in the beginning and 403.6MB in the end (delta: -106.1MB). Peak memory consumption was 111.1MB. Max. memory is 16.0GB. * TraceAbstraction took 829645.74ms. Allocated memory was 482.3MB in the beginning and 1.7GB in the end (delta: 1.2GB). Free memory was 403.6MB in the beginning and 839.8MB in the end (delta: -436.2MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.6s, 494 PlacesBefore, 169 PlacesAfterwards, 511 TransitionsBefore, 165 TransitionsAfterwards, 24776 CoEnabledTransitionPairs, 8 FixpointIterations, 348 TrivialSequentialCompositions, 341 ConcurrentSequentialCompositions, 27 TrivialYvCompositions, 9 ConcurrentYvCompositions, 21 ChoiceCompositions, 746 TotalNumberOfCompositions, 60989 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42078, independent: 41777, independent conditional: 0, independent unconditional: 41777, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8596, independent: 8525, independent conditional: 0, independent unconditional: 8525, dependent: 71, dependent conditional: 0, dependent unconditional: 71, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 42078, independent: 33252, independent conditional: 0, independent unconditional: 33252, dependent: 230, dependent conditional: 0, dependent unconditional: 230, unknown: 8596, unknown conditional: 0, unknown unconditional: 8596] , Statistics on independence cache: Total cache size (in pairs): 715, Positive cache size: 695, Positive conditional cache size: 0, Positive unconditional cache size: 695, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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 CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 52]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 54]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 55]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 56]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 59]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 61]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 62]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 63]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 66]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 68]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 78]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 90]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 114]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 119]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 121]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 122]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 133]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 135]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 136]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 137]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 138]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 173]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 173]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 145]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 146]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 147]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 173]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 151]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 157]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 158]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 159]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 155]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - TimeoutResultAtElement [Line: 154]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 38 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 27ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 655 locations, 232 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: 829.5s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 26.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 929 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 929 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2250 IncrementalHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 12 mSDtfsCounter, 2250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 563 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=16, InterpolantAutomatonStates: 99, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 27.3s InterpolantComputationTime, 718 NumberOfCodeBlocks, 718 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 934 ConstructedInterpolants, 34 QuantifiedInterpolants, 11880 SizeOfPredicates, 496 NumberOfNonLiveVariables, 3300 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 30 InterpolantComputations, 9 PerfectInterpolantSequences, 83/118 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