/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 03:20:20,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 03:20:20,471 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 03:20:20,475 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 03:20:20,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 03:20:20,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 03:20:20,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 03:20:20,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 03:20:20,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 03:20:20,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 03:20:20,495 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 03:20:20,495 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 03:20:20,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 03:20:20,496 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 03:20:20,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 03:20:20,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 03:20:20,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 03:20:20,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 03:20:20,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 03:20:20,498 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 03:20:20,498 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 03:20:20,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 03:20:20,502 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 03:20:20,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 03:20:20,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 03:20:20,503 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 03:20:20,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 03:20:20,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 03:20:20,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 03:20:20,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 03:20:20,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 03:20:20,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 03:20:20,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 03:20:20,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 03:20:20,505 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 03:20:20,505 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 03:20:20,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 03:20:20,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 03:20:20,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 03:20:20,863 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 03:20:20,868 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 03:20:20,870 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2023-08-25 03:20:21,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 03:20:22,234 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 03:20:22,234 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2023-08-25 03:20:22,253 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d00f27e/7a9cd3cb0ac74136a26653d44ee1083a/FLAG2ad144315 [2023-08-25 03:20:22,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63d00f27e/7a9cd3cb0ac74136a26653d44ee1083a [2023-08-25 03:20:22,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 03:20:22,277 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 03:20:22,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 03:20:22,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 03:20:22,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 03:20:22,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b44b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22, skipping insertion in model container [2023-08-25 03:20:22,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,343 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 03:20:22,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 03:20:22,743 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 03:20:22,769 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 03:20:22,771 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [249] [2023-08-25 03:20:22,790 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [741] [2023-08-25 03:20:22,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 03:20:22,865 INFO L206 MainTranslator]: Completed translation [2023-08-25 03:20:22,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22 WrapperNode [2023-08-25 03:20:22,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 03:20:22,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 03:20:22,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 03:20:22,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 03:20:22,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,939 INFO L138 Inliner]: procedures = 264, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2023-08-25 03:20:22,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 03:20:22,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 03:20:22,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 03:20:22,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 03:20:22,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 03:20:22,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 03:20:22,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 03:20:22,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 03:20:22,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (1/1) ... [2023-08-25 03:20:22,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 03:20:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:20:23,029 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 03:20:23,039 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 03:20:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 03:20:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 03:20:23,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 03:20:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 03:20:23,071 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 03:20:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 03:20:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-25 03:20:23,072 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-25 03:20:23,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 03:20:23,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 03:20:23,073 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 03:20:23,220 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 03:20:23,222 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 03:20:23,406 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 03:20:23,414 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 03:20:23,415 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-25 03:20:23,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 03:20:23 BoogieIcfgContainer [2023-08-25 03:20:23,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 03:20:23,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 03:20:23,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 03:20:23,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 03:20:23,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 03:20:22" (1/3) ... [2023-08-25 03:20:23,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdc9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 03:20:23, skipping insertion in model container [2023-08-25 03:20:23,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 03:20:22" (2/3) ... [2023-08-25 03:20:23,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdc9c81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 03:20:23, skipping insertion in model container [2023-08-25 03:20:23,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 03:20:23" (3/3) ... [2023-08-25 03:20:23,424 INFO L112 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2023-08-25 03:20:23,440 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 03:20:23,441 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-08-25 03:20:23,441 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 03:20:23,536 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 03:20:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 102 transitions, 209 flow [2023-08-25 03:20:23,630 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-08-25 03:20:23,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 03:20:23,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-25 03:20:23,635 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 102 transitions, 209 flow [2023-08-25 03:20:23,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 101 transitions, 205 flow [2023-08-25 03:20:23,646 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 03:20:23,656 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 101 transitions, 205 flow [2023-08-25 03:20:23,660 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 101 transitions, 205 flow [2023-08-25 03:20:23,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 101 transitions, 205 flow [2023-08-25 03:20:23,697 INFO L124 PetriNetUnfolderBase]: 4/101 cut-off events. [2023-08-25 03:20:23,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 03:20:23,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 101 events. 4/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-25 03:20:23,700 INFO L119 LiptonReduction]: Number of co-enabled transitions 2262 [2023-08-25 03:20:25,501 INFO L134 LiptonReduction]: Checked pairs total: 8906 [2023-08-25 03:20:25,501 INFO L136 LiptonReduction]: Total number of compositions: 75 [2023-08-25 03:20:25,513 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 03:20:25,518 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;@501a515c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 03:20:25,518 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-25 03:20:25,537 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 03:20:25,537 INFO L124 PetriNetUnfolderBase]: 1/16 cut-off events. [2023-08-25 03:20:25,540 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 03:20:25,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:25,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:25,542 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:25,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 711355281, now seen corresponding path program 1 times [2023-08-25 03:20:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:25,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868321405] [2023-08-25 03:20:25,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:25,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:25,783 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 03:20:25,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868321405] [2023-08-25 03:20:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868321405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 03:20:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183390093] [2023-08-25 03:20:25,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:25,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 03:20:25,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:25,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 03:20:25,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 03:20:25,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-25 03:20:25,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 03:20:25,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:25,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-25 03:20:25,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:25,868 INFO L124 PetriNetUnfolderBase]: 37/165 cut-off events. [2023-08-25 03:20:25,868 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 03:20:25,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 165 events. 37/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 625 event pairs, 36 based on Foata normal form. 0/158 useless extension candidates. Maximal degree in co-relation 244. Up to 89 conditions per place. [2023-08-25 03:20:25,870 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 15 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-08-25 03:20:25,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 111 flow [2023-08-25 03:20:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 03:20:25,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 03:20:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 288 transitions. [2023-08-25 03:20:25,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5423728813559322 [2023-08-25 03:20:25,882 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 288 transitions. [2023-08-25 03:20:25,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 288 transitions. [2023-08-25 03:20:25,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:25,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 288 transitions. [2023-08-25 03:20:25,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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 03:20:25,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 03:20:25,892 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 177.0) internal successors, (708), 4 states have internal predecessors, (708), 0 states have call successors, (0), 0 states 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 03:20:25,894 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 75 flow. Second operand 3 states and 288 transitions. [2023-08-25 03:20:25,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 111 flow [2023-08-25 03:20:25,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 03:20:25,897 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 86 flow [2023-08-25 03:20:25,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-08-25 03:20:25,902 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-08-25 03:20:25,902 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 86 flow [2023-08-25 03:20:25,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states 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 03:20:25,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:25,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:25,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 03:20:25,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:25,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:25,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1960432891, now seen corresponding path program 1 times [2023-08-25 03:20:25,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:25,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925847648] [2023-08-25 03:20:25,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:25,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:25,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925847648] [2023-08-25 03:20:25,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925847648] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:20:25,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449274283] [2023-08-25 03:20:25,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:25,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:20:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:20:25,993 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 03:20:26,016 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 03:20:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:26,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 03:20:26,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:20:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:26,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 03:20:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:26,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449274283] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 03:20:26,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 03:20:26,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-25 03:20:26,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620766817] [2023-08-25 03:20:26,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 03:20:26,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 03:20:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 03:20:26,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-25 03:20:26,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-25 03:20:26,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 03:20:26,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:26,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-25 03:20:26,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:26,206 INFO L124 PetriNetUnfolderBase]: 37/168 cut-off events. [2023-08-25 03:20:26,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 03:20:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 168 events. 37/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 623 event pairs, 36 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 263. Up to 89 conditions per place. [2023-08-25 03:20:26,207 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 15 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-08-25 03:20:26,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 40 transitions, 138 flow [2023-08-25 03:20:26,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 03:20:26,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 03:20:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 563 transitions. [2023-08-25 03:20:26,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301318267419962 [2023-08-25 03:20:26,213 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 563 transitions. [2023-08-25 03:20:26,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 563 transitions. [2023-08-25 03:20:26,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:26,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 563 transitions. [2023-08-25 03:20:26,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 93.83333333333333) internal successors, (563), 6 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 03:20:26,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:26,219 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:26,220 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 86 flow. Second operand 6 states and 563 transitions. [2023-08-25 03:20:26,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 40 transitions, 138 flow [2023-08-25 03:20:26,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 134 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 03:20:26,221 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 118 flow [2023-08-25 03:20:26,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-25 03:20:26,222 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 9 predicate places. [2023-08-25 03:20:26,222 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 118 flow [2023-08-25 03:20:26,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.57142857142857) internal successors, (641), 7 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 03:20:26,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:26,223 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:26,233 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 03:20:26,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:20:26,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:26,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1754673354, now seen corresponding path program 2 times [2023-08-25 03:20:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365026977] [2023-08-25 03:20:26,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:26,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-25 03:20:26,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:26,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365026977] [2023-08-25 03:20:26,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365026977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:26,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:26,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 03:20:26,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208998686] [2023-08-25 03:20:26,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:26,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 03:20:26,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:26,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 03:20:26,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 03:20:26,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 177 [2023-08-25 03:20:26,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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 03:20:26,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:26,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 177 [2023-08-25 03:20:26,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:27,075 INFO L124 PetriNetUnfolderBase]: 268/583 cut-off events. [2023-08-25 03:20:27,076 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-25 03:20:27,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 583 events. 268/583 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2482 event pairs, 138 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1156. Up to 411 conditions per place. [2023-08-25 03:20:27,084 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 83 selfloop transitions, 22 changer transitions 0/106 dead transitions. [2023-08-25 03:20:27,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 106 transitions, 460 flow [2023-08-25 03:20:27,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 03:20:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 03:20:27,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 516 transitions. [2023-08-25 03:20:27,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858757062146893 [2023-08-25 03:20:27,086 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 516 transitions. [2023-08-25 03:20:27,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 516 transitions. [2023-08-25 03:20:27,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:27,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 516 transitions. [2023-08-25 03:20:27,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 86.0) internal successors, (516), 6 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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 03:20:27,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:27,091 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:27,092 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 118 flow. Second operand 6 states and 516 transitions. [2023-08-25 03:20:27,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 106 transitions, 460 flow [2023-08-25 03:20:27,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 106 transitions, 446 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-25 03:20:27,096 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 254 flow [2023-08-25 03:20:27,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=254, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-08-25 03:20:27,097 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 18 predicate places. [2023-08-25 03:20:27,097 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 254 flow [2023-08-25 03:20:27,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 70.83333333333333) internal successors, (425), 6 states have internal predecessors, (425), 0 states have call successors, (0), 0 states 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 03:20:27,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:27,098 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:27,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 03:20:27,098 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:27,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:27,099 INFO L85 PathProgramCache]: Analyzing trace with hash -364685487, now seen corresponding path program 1 times [2023-08-25 03:20:27,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:27,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266087358] [2023-08-25 03:20:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:27,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:27,404 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-25 03:20:27,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:27,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266087358] [2023-08-25 03:20:27,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266087358] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:27,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:27,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 03:20:27,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47643165] [2023-08-25 03:20:27,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:27,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 03:20:27,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:27,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 03:20:27,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 03:20:27,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 177 [2023-08-25 03:20:27,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 254 flow. Second operand has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 03:20:27,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:27,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 177 [2023-08-25 03:20:27,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:27,641 INFO L124 PetriNetUnfolderBase]: 310/670 cut-off events. [2023-08-25 03:20:27,641 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-08-25 03:20:27,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 670 events. 310/670 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2956 event pairs, 124 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1675. Up to 502 conditions per place. [2023-08-25 03:20:27,646 INFO L140 encePairwiseOnDemand]: 166/177 looper letters, 101 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2023-08-25 03:20:27,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 127 transitions, 730 flow [2023-08-25 03:20:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 03:20:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 03:20:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2023-08-25 03:20:27,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529190207156309 [2023-08-25 03:20:27,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 481 transitions. [2023-08-25 03:20:27,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 481 transitions. [2023-08-25 03:20:27,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:27,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 481 transitions. [2023-08-25 03:20:27,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 03:20:27,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:27,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:27,653 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 254 flow. Second operand 6 states and 481 transitions. [2023-08-25 03:20:27,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 127 transitions, 730 flow [2023-08-25 03:20:27,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 730 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 03:20:27,661 INFO L231 Difference]: Finished difference. Result has 67 places, 82 transitions, 438 flow [2023-08-25 03:20:27,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=438, PETRI_PLACES=67, PETRI_TRANSITIONS=82} [2023-08-25 03:20:27,663 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 28 predicate places. [2023-08-25 03:20:27,663 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 82 transitions, 438 flow [2023-08-25 03:20:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 0 states have call successors, (0), 0 states 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 03:20:27,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:27,663 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:27,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 03:20:27,664 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:27,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 129294706, now seen corresponding path program 1 times [2023-08-25 03:20:27,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:27,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398990124] [2023-08-25 03:20:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:27,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:27,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:27,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:27,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398990124] [2023-08-25 03:20:27,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398990124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:20:27,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927342278] [2023-08-25 03:20:27,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:27,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:20:27,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:20:27,745 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 03:20:27,791 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 03:20:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:27,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 03:20:27,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:20:27,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:27,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 03:20:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:27,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927342278] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 03:20:27,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 03:20:27,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-25 03:20:27,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990762532] [2023-08-25 03:20:27,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 03:20:27,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 03:20:27,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:27,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 03:20:27,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-25 03:20:27,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 177 [2023-08-25 03:20:27,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 82 transitions, 438 flow. Second operand has 12 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states 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 03:20:27,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:27,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 177 [2023-08-25 03:20:27,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:28,033 INFO L124 PetriNetUnfolderBase]: 121/375 cut-off events. [2023-08-25 03:20:28,033 INFO L125 PetriNetUnfolderBase]: For 310/317 co-relation queries the response was YES. [2023-08-25 03:20:28,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 375 events. 121/375 cut-off events. For 310/317 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1838 event pairs, 43 based on Foata normal form. 6/374 useless extension candidates. Maximal degree in co-relation 933. Up to 154 conditions per place. [2023-08-25 03:20:28,035 INFO L140 encePairwiseOnDemand]: 174/177 looper letters, 26 selfloop transitions, 11 changer transitions 0/88 dead transitions. [2023-08-25 03:20:28,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 88 transitions, 548 flow [2023-08-25 03:20:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 03:20:28,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 03:20:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1112 transitions. [2023-08-25 03:20:28,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5235404896421846 [2023-08-25 03:20:28,039 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1112 transitions. [2023-08-25 03:20:28,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1112 transitions. [2023-08-25 03:20:28,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:28,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1112 transitions. [2023-08-25 03:20:28,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 92.66666666666667) internal successors, (1112), 12 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states 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 03:20:28,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:20:28,048 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:20:28,048 INFO L175 Difference]: Start difference. First operand has 67 places, 82 transitions, 438 flow. Second operand 12 states and 1112 transitions. [2023-08-25 03:20:28,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 88 transitions, 548 flow [2023-08-25 03:20:28,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 88 transitions, 548 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 03:20:28,054 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 522 flow [2023-08-25 03:20:28,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=522, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2023-08-25 03:20:28,055 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 45 predicate places. [2023-08-25 03:20:28,055 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 522 flow [2023-08-25 03:20:28,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 91.41666666666667) internal successors, (1097), 12 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states 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 03:20:28,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:28,056 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:28,064 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 03:20:28,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:20:28,262 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:28,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:28,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1012549394, now seen corresponding path program 2 times [2023-08-25 03:20:28,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:28,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139782770] [2023-08-25 03:20:28,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:28,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:28,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139782770] [2023-08-25 03:20:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139782770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:28,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:28,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 03:20:28,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657638123] [2023-08-25 03:20:28,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:28,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 03:20:28,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:28,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 03:20:28,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 03:20:28,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 177 [2023-08-25 03:20:28,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 03:20:28,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:28,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 177 [2023-08-25 03:20:28,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:28,859 INFO L124 PetriNetUnfolderBase]: 351/780 cut-off events. [2023-08-25 03:20:28,860 INFO L125 PetriNetUnfolderBase]: For 609/609 co-relation queries the response was YES. [2023-08-25 03:20:28,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2379 conditions, 780 events. 351/780 cut-off events. For 609/609 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3693 event pairs, 116 based on Foata normal form. 0/733 useless extension candidates. Maximal degree in co-relation 2294. Up to 618 conditions per place. [2023-08-25 03:20:28,866 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 102 selfloop transitions, 53 changer transitions 8/164 dead transitions. [2023-08-25 03:20:28,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 164 transitions, 1160 flow [2023-08-25 03:20:28,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 03:20:28,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 03:20:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 503 transitions. [2023-08-25 03:20:28,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4736346516007533 [2023-08-25 03:20:28,869 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 503 transitions. [2023-08-25 03:20:28,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 503 transitions. [2023-08-25 03:20:28,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:28,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 503 transitions. [2023-08-25 03:20:28,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 0 states have call successors, (0), 0 states 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 03:20:28,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:28,873 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:28,873 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 522 flow. Second operand 6 states and 503 transitions. [2023-08-25 03:20:28,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 164 transitions, 1160 flow [2023-08-25 03:20:28,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 164 transitions, 1112 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-25 03:20:28,881 INFO L231 Difference]: Finished difference. Result has 89 places, 135 transitions, 956 flow [2023-08-25 03:20:28,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=956, PETRI_PLACES=89, PETRI_TRANSITIONS=135} [2023-08-25 03:20:28,884 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 50 predicate places. [2023-08-25 03:20:28,884 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 135 transitions, 956 flow [2023-08-25 03:20:28,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 03:20:28,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:28,885 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:28,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 03:20:28,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:28,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 89381196, now seen corresponding path program 1 times [2023-08-25 03:20:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:28,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887691761] [2023-08-25 03:20:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:28,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:29,249 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:29,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:29,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887691761] [2023-08-25 03:20:29,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887691761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:29,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:29,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 03:20:29,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900587028] [2023-08-25 03:20:29,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:29,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 03:20:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:29,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 03:20:29,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 03:20:29,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 177 [2023-08-25 03:20:29,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 135 transitions, 956 flow. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 03:20:29,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:29,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 177 [2023-08-25 03:20:29,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:29,553 INFO L124 PetriNetUnfolderBase]: 455/976 cut-off events. [2023-08-25 03:20:29,553 INFO L125 PetriNetUnfolderBase]: For 1337/1337 co-relation queries the response was YES. [2023-08-25 03:20:29,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3615 conditions, 976 events. 455/976 cut-off events. For 1337/1337 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4802 event pairs, 121 based on Foata normal form. 0/951 useless extension candidates. Maximal degree in co-relation 3550. Up to 789 conditions per place. [2023-08-25 03:20:29,561 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 142 selfloop transitions, 58 changer transitions 26/226 dead transitions. [2023-08-25 03:20:29,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 226 transitions, 1890 flow [2023-08-25 03:20:29,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 03:20:29,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 03:20:29,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 472 transitions. [2023-08-25 03:20:29,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-25 03:20:29,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 472 transitions. [2023-08-25 03:20:29,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 472 transitions. [2023-08-25 03:20:29,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:29,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 472 transitions. [2023-08-25 03:20:29,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 states 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 03:20:29,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:29,567 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 177.0) internal successors, (1239), 7 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states 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 03:20:29,567 INFO L175 Difference]: Start difference. First operand has 89 places, 135 transitions, 956 flow. Second operand 6 states and 472 transitions. [2023-08-25 03:20:29,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 226 transitions, 1890 flow [2023-08-25 03:20:29,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 226 transitions, 1826 flow, removed 32 selfloop flow, removed 0 redundant places. [2023-08-25 03:20:29,579 INFO L231 Difference]: Finished difference. Result has 99 places, 176 transitions, 1418 flow [2023-08-25 03:20:29,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1418, PETRI_PLACES=99, PETRI_TRANSITIONS=176} [2023-08-25 03:20:29,580 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 60 predicate places. [2023-08-25 03:20:29,580 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 176 transitions, 1418 flow [2023-08-25 03:20:29,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 03:20:29,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:29,581 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:29,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 03:20:29,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:29,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:29,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1125954593, now seen corresponding path program 1 times [2023-08-25 03:20:29,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:29,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318538755] [2023-08-25 03:20:29,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:29,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:31,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:31,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318538755] [2023-08-25 03:20:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318538755] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:31,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 03:20:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498094416] [2023-08-25 03:20:31,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:31,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 03:20:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:31,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 03:20:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2023-08-25 03:20:31,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:20:31,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 176 transitions, 1418 flow. Second operand has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 03:20:31,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:31,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:20:31,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:32,138 INFO L124 PetriNetUnfolderBase]: 863/1883 cut-off events. [2023-08-25 03:20:32,139 INFO L125 PetriNetUnfolderBase]: For 4267/4267 co-relation queries the response was YES. [2023-08-25 03:20:32,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8236 conditions, 1883 events. 863/1883 cut-off events. For 4267/4267 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 11625 event pairs, 88 based on Foata normal form. 3/1886 useless extension candidates. Maximal degree in co-relation 8166. Up to 724 conditions per place. [2023-08-25 03:20:32,154 INFO L140 encePairwiseOnDemand]: 160/177 looper letters, 396 selfloop transitions, 73 changer transitions 33/502 dead transitions. [2023-08-25 03:20:32,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 502 transitions, 4848 flow [2023-08-25 03:20:32,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 03:20:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 03:20:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 839 transitions. [2023-08-25 03:20:32,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.430919363122753 [2023-08-25 03:20:32,157 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 839 transitions. [2023-08-25 03:20:32,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 839 transitions. [2023-08-25 03:20:32,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:32,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 839 transitions. [2023-08-25 03:20:32,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 76.27272727272727) internal successors, (839), 11 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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 03:20:32,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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 03:20:32,163 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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 03:20:32,163 INFO L175 Difference]: Start difference. First operand has 99 places, 176 transitions, 1418 flow. Second operand 11 states and 839 transitions. [2023-08-25 03:20:32,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 502 transitions, 4848 flow [2023-08-25 03:20:32,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 502 transitions, 4712 flow, removed 68 selfloop flow, removed 0 redundant places. [2023-08-25 03:20:32,192 INFO L231 Difference]: Finished difference. Result has 117 places, 238 transitions, 2264 flow [2023-08-25 03:20:32,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2264, PETRI_PLACES=117, PETRI_TRANSITIONS=238} [2023-08-25 03:20:32,195 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 78 predicate places. [2023-08-25 03:20:32,195 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 238 transitions, 2264 flow [2023-08-25 03:20:32,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 03:20:32,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:32,197 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:32,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 03:20:32,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:32,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:32,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1375344539, now seen corresponding path program 2 times [2023-08-25 03:20:32,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:32,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738849104] [2023-08-25 03:20:32,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:32,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:33,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:33,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738849104] [2023-08-25 03:20:33,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738849104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:33,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:33,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-08-25 03:20:33,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280242500] [2023-08-25 03:20:33,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:33,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 03:20:33,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:33,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 03:20:33,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-08-25 03:20:33,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:20:33,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 238 transitions, 2264 flow. Second operand has 11 states, 11 states have (on average 60.81818181818182) internal successors, (669), 11 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 03:20:33,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:33,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:20:33,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:34,627 INFO L124 PetriNetUnfolderBase]: 908/2005 cut-off events. [2023-08-25 03:20:34,627 INFO L125 PetriNetUnfolderBase]: For 6948/6948 co-relation queries the response was YES. [2023-08-25 03:20:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 2005 events. 908/2005 cut-off events. For 6948/6948 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 12692 event pairs, 109 based on Foata normal form. 2/2007 useless extension candidates. Maximal degree in co-relation 9838. Up to 1250 conditions per place. [2023-08-25 03:20:34,648 INFO L140 encePairwiseOnDemand]: 161/177 looper letters, 250 selfloop transitions, 97 changer transitions 58/405 dead transitions. [2023-08-25 03:20:34,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 405 transitions, 4462 flow [2023-08-25 03:20:34,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 03:20:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 03:20:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 875 transitions. [2023-08-25 03:20:34,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4119585687382298 [2023-08-25 03:20:34,651 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 875 transitions. [2023-08-25 03:20:34,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 875 transitions. [2023-08-25 03:20:34,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:34,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 875 transitions. [2023-08-25 03:20:34,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 72.91666666666667) internal successors, (875), 12 states have internal predecessors, (875), 0 states have call successors, (0), 0 states 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 03:20:34,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:20:34,658 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:20:34,658 INFO L175 Difference]: Start difference. First operand has 117 places, 238 transitions, 2264 flow. Second operand 12 states and 875 transitions. [2023-08-25 03:20:34,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 405 transitions, 4462 flow [2023-08-25 03:20:34,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 405 transitions, 4454 flow, removed 4 selfloop flow, removed 0 redundant places. [2023-08-25 03:20:34,708 INFO L231 Difference]: Finished difference. Result has 137 places, 264 transitions, 3059 flow [2023-08-25 03:20:34,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=3059, PETRI_PLACES=137, PETRI_TRANSITIONS=264} [2023-08-25 03:20:34,709 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 98 predicate places. [2023-08-25 03:20:34,709 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 264 transitions, 3059 flow [2023-08-25 03:20:34,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 60.81818181818182) internal successors, (669), 11 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 03:20:34,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:34,710 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:34,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 03:20:34,712 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:34,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:34,712 INFO L85 PathProgramCache]: Analyzing trace with hash 906598757, now seen corresponding path program 3 times [2023-08-25 03:20:34,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:34,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511139712] [2023-08-25 03:20:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:34,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511139712] [2023-08-25 03:20:35,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511139712] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:35,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:35,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 03:20:35,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251261961] [2023-08-25 03:20:35,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:35,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 03:20:35,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:35,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 03:20:35,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2023-08-25 03:20:35,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:20:35,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 264 transitions, 3059 flow. Second operand has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 03:20:35,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:35,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:20:35,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:36,169 INFO L124 PetriNetUnfolderBase]: 873/1949 cut-off events. [2023-08-25 03:20:36,170 INFO L125 PetriNetUnfolderBase]: For 10735/10735 co-relation queries the response was YES. [2023-08-25 03:20:36,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10736 conditions, 1949 events. 873/1949 cut-off events. For 10735/10735 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12375 event pairs, 89 based on Foata normal form. 2/1951 useless extension candidates. Maximal degree in co-relation 10648. Up to 782 conditions per place. [2023-08-25 03:20:36,194 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 363 selfloop transitions, 93 changer transitions 26/482 dead transitions. [2023-08-25 03:20:36,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 482 transitions, 5715 flow [2023-08-25 03:20:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 03:20:36,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 03:20:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 762 transitions. [2023-08-25 03:20:36,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43050847457627117 [2023-08-25 03:20:36,197 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 762 transitions. [2023-08-25 03:20:36,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 762 transitions. [2023-08-25 03:20:36,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:36,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 762 transitions. [2023-08-25 03:20:36,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 76.2) internal successors, (762), 10 states have internal predecessors, (762), 0 states have call successors, (0), 0 states 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 03:20:36,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states 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 03:20:36,203 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 177.0) internal successors, (1947), 11 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states 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 03:20:36,203 INFO L175 Difference]: Start difference. First operand has 137 places, 264 transitions, 3059 flow. Second operand 10 states and 762 transitions. [2023-08-25 03:20:36,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 482 transitions, 5715 flow [2023-08-25 03:20:36,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 482 transitions, 5621 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-25 03:20:36,307 INFO L231 Difference]: Finished difference. Result has 145 places, 288 transitions, 3557 flow [2023-08-25 03:20:36,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=2985, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3557, PETRI_PLACES=145, PETRI_TRANSITIONS=288} [2023-08-25 03:20:36,308 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 106 predicate places. [2023-08-25 03:20:36,309 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 288 transitions, 3557 flow [2023-08-25 03:20:36,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 03:20:36,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:36,309 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:36,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 03:20:36,309 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:36,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:36,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1376095225, now seen corresponding path program 4 times [2023-08-25 03:20:36,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:36,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199463993] [2023-08-25 03:20:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:37,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:37,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199463993] [2023-08-25 03:20:37,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199463993] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:20:37,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 03:20:37,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-25 03:20:37,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685147538] [2023-08-25 03:20:37,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:37,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 03:20:37,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:37,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 03:20:37,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-08-25 03:20:37,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:20:37,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 288 transitions, 3557 flow. Second operand has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 03:20:37,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:37,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:20:37,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:20:38,255 INFO L124 PetriNetUnfolderBase]: 951/2115 cut-off events. [2023-08-25 03:20:38,256 INFO L125 PetriNetUnfolderBase]: For 14237/14237 co-relation queries the response was YES. [2023-08-25 03:20:38,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 2115 events. 951/2115 cut-off events. For 14237/14237 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13662 event pairs, 127 based on Foata normal form. 16/2131 useless extension candidates. Maximal degree in co-relation 11994. Up to 1273 conditions per place. [2023-08-25 03:20:38,285 INFO L140 encePairwiseOnDemand]: 162/177 looper letters, 284 selfloop transitions, 125 changer transitions 27/436 dead transitions. [2023-08-25 03:20:38,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 436 transitions, 5867 flow [2023-08-25 03:20:38,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 03:20:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 03:20:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 689 transitions. [2023-08-25 03:20:38,288 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4325172630257376 [2023-08-25 03:20:38,288 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 689 transitions. [2023-08-25 03:20:38,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 689 transitions. [2023-08-25 03:20:38,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:20:38,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 689 transitions. [2023-08-25 03:20:38,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 76.55555555555556) internal successors, (689), 9 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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 03:20:38,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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 03:20:38,293 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 177.0) internal successors, (1770), 10 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states 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 03:20:38,293 INFO L175 Difference]: Start difference. First operand has 145 places, 288 transitions, 3557 flow. Second operand 9 states and 689 transitions. [2023-08-25 03:20:38,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 436 transitions, 5867 flow [2023-08-25 03:20:38,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 436 transitions, 5786 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-25 03:20:38,364 INFO L231 Difference]: Finished difference. Result has 155 places, 317 transitions, 4509 flow [2023-08-25 03:20:38,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=3502, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4509, PETRI_PLACES=155, PETRI_TRANSITIONS=317} [2023-08-25 03:20:38,365 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 116 predicate places. [2023-08-25 03:20:38,365 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 317 transitions, 4509 flow [2023-08-25 03:20:38,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 61.22222222222222) internal successors, (551), 9 states have internal predecessors, (551), 0 states have call successors, (0), 0 states 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 03:20:38,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:20:38,365 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:20:38,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 03:20:38,366 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:20:38,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:20:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash 367435628, now seen corresponding path program 1 times [2023-08-25 03:20:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:20:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513502110] [2023-08-25 03:20:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:20:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:42,116 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:20:42,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:20:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513502110] [2023-08-25 03:20:42,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513502110] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:20:42,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310089201] [2023-08-25 03:20:42,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:20:42,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:20:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:20:42,121 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 03:20:42,136 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 03:20:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:20:42,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-25 03:20:42,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:20:42,371 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 15 treesize of output 11 [2023-08-25 03:20:42,415 INFO L322 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-08-25 03:20:42,416 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 21 treesize of output 13 [2023-08-25 03:20:42,519 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 03:20:42,583 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-25 03:20:42,662 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 03:20:42,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 03:20:42,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,838 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 56 [2023-08-25 03:20:42,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-08-25 03:20:42,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:42,974 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2023-08-25 03:20:43,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,020 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2023-08-25 03:20:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:20:43,280 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 03:20:43,280 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 90 treesize of output 101 [2023-08-25 03:20:51,390 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 03:20:51,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 03:20:54,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:20:54,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310089201] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 03:20:54,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 03:20:54,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [21, 20] total 44 [2023-08-25 03:20:54,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198869705] [2023-08-25 03:20:54,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:20:54,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 03:20:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:20:54,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 03:20:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1647, Unknown=3, NotChecked=0, Total=1980 [2023-08-25 03:20:54,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:20:54,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 317 transitions, 4509 flow. Second operand has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 03:20:54,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:20:54,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:20:54,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:21:06,029 INFO L124 PetriNetUnfolderBase]: 961/2121 cut-off events. [2023-08-25 03:21:06,029 INFO L125 PetriNetUnfolderBase]: For 18462/18462 co-relation queries the response was YES. [2023-08-25 03:21:06,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12871 conditions, 2121 events. 961/2121 cut-off events. For 18462/18462 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13632 event pairs, 116 based on Foata normal form. 1/2122 useless extension candidates. Maximal degree in co-relation 12773. Up to 715 conditions per place. [2023-08-25 03:21:06,053 INFO L140 encePairwiseOnDemand]: 159/177 looper letters, 468 selfloop transitions, 110 changer transitions 41/619 dead transitions. [2023-08-25 03:21:06,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 619 transitions, 8478 flow [2023-08-25 03:21:06,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-25 03:21:06,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-25 03:21:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1333 transitions. [2023-08-25 03:21:06,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39637228664882546 [2023-08-25 03:21:06,058 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1333 transitions. [2023-08-25 03:21:06,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1333 transitions. [2023-08-25 03:21:06,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:21:06,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1333 transitions. [2023-08-25 03:21:06,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 70.15789473684211) internal successors, (1333), 19 states have internal predecessors, (1333), 0 states have call successors, (0), 0 states 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 03:21:06,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 177.0) internal successors, (3540), 20 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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 03:21:06,066 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 177.0) internal successors, (3540), 20 states have internal predecessors, (3540), 0 states have call successors, (0), 0 states 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 03:21:06,066 INFO L175 Difference]: Start difference. First operand has 155 places, 317 transitions, 4509 flow. Second operand 19 states and 1333 transitions. [2023-08-25 03:21:06,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 619 transitions, 8478 flow [2023-08-25 03:21:06,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 619 transitions, 8136 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-08-25 03:21:06,153 INFO L231 Difference]: Finished difference. Result has 179 places, 397 transitions, 5628 flow [2023-08-25 03:21:06,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=4298, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=5628, PETRI_PLACES=179, PETRI_TRANSITIONS=397} [2023-08-25 03:21:06,154 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 140 predicate places. [2023-08-25 03:21:06,154 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 397 transitions, 5628 flow [2023-08-25 03:21:06,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 03:21:06,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:21:06,155 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:21:06,167 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 03:21:06,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:21:06,361 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:21:06,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:21:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 440868764, now seen corresponding path program 2 times [2023-08-25 03:21:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:21:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040162414] [2023-08-25 03:21:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:21:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:21:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:21:15,102 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:21:15,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:21:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040162414] [2023-08-25 03:21:15,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040162414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:21:15,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451484859] [2023-08-25 03:21:15,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 03:21:15,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:21:15,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:21:15,109 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 03:21:15,111 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 03:21:15,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-25 03:21:15,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 03:21:15,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-25 03:21:15,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:21:15,219 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 13 treesize of output 9 [2023-08-25 03:21:15,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 03:21:15,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-25 03:21:15,374 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 03:21:15,423 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 03:21:15,484 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 03:21:15,484 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 22 treesize of output 15 [2023-08-25 03:21:15,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 58 [2023-08-25 03:21:15,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,586 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-25 03:21:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-25 03:21:15,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 74 [2023-08-25 03:21:15,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:21:15,920 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 03:21:15,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 115 [2023-08-25 03:21:46,168 WARN L234 SmtUtils]: Spent 14.08s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 03:21:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:21:46,170 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 03:21:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451484859] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:21:46,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 03:21:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [22] total 33 [2023-08-25 03:21:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176757074] [2023-08-25 03:21:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:21:46,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 03:21:46,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:21:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 03:21:46,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=975, Unknown=7, NotChecked=0, Total=1122 [2023-08-25 03:21:46,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:21:46,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 397 transitions, 5628 flow. Second operand has 12 states, 12 states have (on average 60.666666666666664) internal successors, (728), 12 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 03:21:46,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:21:46,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:21:46,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:21:50,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:21:52,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:21:54,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:21:56,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:00,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:04,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:06,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:08,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:12,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:14,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:17,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:33,183 WARN L234 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 03:22:35,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:37,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:39,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:41,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:43,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:45,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 03:22:45,878 INFO L124 PetriNetUnfolderBase]: 1160/2548 cut-off events. [2023-08-25 03:22:45,879 INFO L125 PetriNetUnfolderBase]: For 23296/23296 co-relation queries the response was YES. [2023-08-25 03:22:45,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16274 conditions, 2548 events. 1160/2548 cut-off events. For 23296/23296 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17264 event pairs, 152 based on Foata normal form. 18/2566 useless extension candidates. Maximal degree in co-relation 16167. Up to 1381 conditions per place. [2023-08-25 03:22:45,906 INFO L140 encePairwiseOnDemand]: 159/177 looper letters, 433 selfloop transitions, 190 changer transitions 30/653 dead transitions. [2023-08-25 03:22:45,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 653 transitions, 9942 flow [2023-08-25 03:22:45,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 03:22:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 03:22:45,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 886 transitions. [2023-08-25 03:22:45,909 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171374764595104 [2023-08-25 03:22:45,909 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 886 transitions. [2023-08-25 03:22:45,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 886 transitions. [2023-08-25 03:22:45,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:22:45,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 886 transitions. [2023-08-25 03:22:45,911 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 73.83333333333333) internal successors, (886), 12 states have internal predecessors, (886), 0 states have call successors, (0), 0 states 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 03:22:45,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:22:45,914 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 177.0) internal successors, (2301), 13 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states 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 03:22:45,914 INFO L175 Difference]: Start difference. First operand has 179 places, 397 transitions, 5628 flow. Second operand 12 states and 886 transitions. [2023-08-25 03:22:45,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 653 transitions, 9942 flow [2023-08-25 03:22:46,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 653 transitions, 9874 flow, removed 34 selfloop flow, removed 0 redundant places. [2023-08-25 03:22:46,050 INFO L231 Difference]: Finished difference. Result has 197 places, 486 transitions, 7534 flow [2023-08-25 03:22:46,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=5590, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7534, PETRI_PLACES=197, PETRI_TRANSITIONS=486} [2023-08-25 03:22:46,051 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 158 predicate places. [2023-08-25 03:22:46,051 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 486 transitions, 7534 flow [2023-08-25 03:22:46,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 60.666666666666664) internal successors, (728), 12 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 03:22:46,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:22:46,051 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:22:46,057 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 03:22:46,252 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 03:22:46,253 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:22:46,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:22:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1764617884, now seen corresponding path program 3 times [2023-08-25 03:22:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:22:46,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436596108] [2023-08-25 03:22:46,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:22:46,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:22:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:23:18,527 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:23:18,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:23:18,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436596108] [2023-08-25 03:23:18,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436596108] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:23:18,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048683442] [2023-08-25 03:23:18,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 03:23:18,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:23:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:23:18,529 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 03:23:18,530 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 03:23:18,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-25 03:23:18,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 03:23:18,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-25 03:23:18,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:23:18,650 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 13 treesize of output 9 [2023-08-25 03:23:18,684 INFO L322 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-08-25 03:23:18,684 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 21 treesize of output 13 [2023-08-25 03:23:18,774 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 03:23:18,818 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-25 03:23:18,868 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 03:23:18,931 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 03:23:18,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:18,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:18,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:18,994 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 03:23:18,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 56 [2023-08-25 03:23:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:23:19,033 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 03:23:19,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048683442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 03:23:19,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 03:23:19,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2023-08-25 03:23:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841706483] [2023-08-25 03:23:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:23:19,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-25 03:23:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:23:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-25 03:23:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2023-08-25 03:23:19,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:23:19,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 486 transitions, 7534 flow. Second operand has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 03:23:19,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:23:19,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:23:19,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:23:20,248 INFO L124 PetriNetUnfolderBase]: 1206/2638 cut-off events. [2023-08-25 03:23:20,249 INFO L125 PetriNetUnfolderBase]: For 30484/30484 co-relation queries the response was YES. [2023-08-25 03:23:20,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18337 conditions, 2638 events. 1206/2638 cut-off events. For 30484/30484 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 17868 event pairs, 177 based on Foata normal form. 26/2664 useless extension candidates. Maximal degree in co-relation 18221. Up to 1090 conditions per place. [2023-08-25 03:23:20,285 INFO L140 encePairwiseOnDemand]: 161/177 looper letters, 528 selfloop transitions, 141 changer transitions 55/724 dead transitions. [2023-08-25 03:23:20,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 724 transitions, 11588 flow [2023-08-25 03:23:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 03:23:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 03:23:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 830 transitions. [2023-08-25 03:23:20,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262968669748331 [2023-08-25 03:23:20,287 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 830 transitions. [2023-08-25 03:23:20,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 830 transitions. [2023-08-25 03:23:20,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 03:23:20,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 830 transitions. [2023-08-25 03:23:20,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 75.45454545454545) internal successors, (830), 11 states have internal predecessors, (830), 0 states have call successors, (0), 0 states 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 03:23:20,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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 03:23:20,291 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 177.0) internal successors, (2124), 12 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states 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 03:23:20,291 INFO L175 Difference]: Start difference. First operand has 197 places, 486 transitions, 7534 flow. Second operand 11 states and 830 transitions. [2023-08-25 03:23:20,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 724 transitions, 11588 flow [2023-08-25 03:23:20,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 724 transitions, 11462 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-08-25 03:23:20,541 INFO L231 Difference]: Finished difference. Result has 211 places, 500 transitions, 8141 flow [2023-08-25 03:23:20,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=7448, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8141, PETRI_PLACES=211, PETRI_TRANSITIONS=500} [2023-08-25 03:23:20,542 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 172 predicate places. [2023-08-25 03:23:20,542 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 500 transitions, 8141 flow [2023-08-25 03:23:20,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.0) internal successors, (610), 10 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 03:23:20,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 03:23:20,543 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 03:23:20,549 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 03:23:20,747 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 03:23:20,747 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-25 03:23:20,748 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 03:23:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1213389960, now seen corresponding path program 4 times [2023-08-25 03:23:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 03:23:20,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887669478] [2023-08-25 03:23:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 03:23:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 03:23:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 03:23:48,366 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 03:23:48,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 03:23:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887669478] [2023-08-25 03:23:48,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887669478] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 03:23:48,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098501892] [2023-08-25 03:23:48,366 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 03:23:48,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 03:23:48,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 03:23:48,367 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 03:23:48,369 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 03:23:48,478 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 03:23:48,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 03:23:48,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 59 conjunts are in the unsatisfiable core [2023-08-25 03:23:48,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 03:23:48,570 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 13 treesize of output 9 [2023-08-25 03:23:48,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-25 03:23:48,679 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-08-25 03:23:48,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-08-25 03:23:48,792 INFO L322 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-08-25 03:23:48,792 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 22 treesize of output 15 [2023-08-25 03:23:48,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,859 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2023-08-25 03:23:48,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 03:23:48,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:48,911 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2023-08-25 03:23:48,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2023-08-25 03:23:49,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 59 [2023-08-25 03:23:49,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 03:23:49,266 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 03:23:49,266 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 122 treesize of output 126 [2023-08-25 03:24:13,481 WARN L234 SmtUtils]: Spent 14.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 03:24:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-25 03:24:13,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 03:25:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-25 03:25:04,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098501892] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-25 03:25:04,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-25 03:25:04,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19, 16] total 46 [2023-08-25 03:25:04,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160637592] [2023-08-25 03:25:04,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 03:25:04,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 03:25:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 03:25:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 03:25:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1929, Unknown=12, NotChecked=0, Total=2162 [2023-08-25 03:25:04,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 177 [2023-08-25 03:25:04,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 500 transitions, 8141 flow. Second operand has 14 states, 14 states have (on average 60.42857142857143) internal successors, (846), 14 states have internal predecessors, (846), 0 states have call successors, (0), 0 states 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 03:25:04,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 03:25:04,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 177 [2023-08-25 03:25:04,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 03:25:06,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:08,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:10,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:11,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:13,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:16,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:18,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:22,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:24,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:28,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:30,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:32,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:35,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:37,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:39,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:41,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:44,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:46,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:49,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:51,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:53,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:56,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:25:59,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:01,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:03,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:05,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:08,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:10,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:12,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:14,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:16,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:18,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:20,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:24,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:26,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:28,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:30,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:32,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:34,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:36,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:44,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:47,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:50,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:52,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:54,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:56,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:26:58,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:00,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:02,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:05,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:07,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:09,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:11,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:13,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:22,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:23,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:26,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:28,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:38,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:40,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:42,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:46,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:48,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:50,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:52,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:54,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:56,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:27:58,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:00,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:02,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:04,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:07,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:09,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:11,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:13,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:15,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:17,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:28,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:30,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:32,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:34,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:36,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:38,310 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2)) (.cse11 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|)) (.cse18 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse9 (select |c_#race| |c_~#a~0.base|)) (.cse10 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse4 (+ .cse3 |c_~#a~0.offset|)) (.cse1 (+ .cse3 |c_~#a~0.offset| 1)) (.cse6 (+ .cse3 2 |c_~#a~0.offset|))) (let ((.cse2 (let ((.cse7 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse4 v_ArrVal_901) .cse1 v_ArrVal_902) .cse6 v_ArrVal_904)))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse2 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse2 |c_~#a~0.base| (store (store .cse0 (+ .cse3 3 |c_~#a~0.offset|) 0) .cse4 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (not (= (select .cse0 .cse4) 0)) (not (= (select .cse0 .cse6) 0))))))) (not (= (select .cse10 (+ .cse3 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse17 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse14 (+ .cse17 |c_~#a~0.offset|)) (.cse13 (+ .cse17 |c_~#a~0.offset| 1)) (.cse15 (+ .cse17 2 |c_~#a~0.offset|))) (let ((.cse16 (let ((.cse19 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse14 v_ArrVal_901) .cse13 v_ArrVal_902) .cse15 v_ArrVal_904)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse12 (select .cse16 |c_~#a~0.base|))) (or (not (= (select .cse12 .cse13) 0)) (not (= (select .cse12 .cse14) 0)) (not (= (select .cse12 .cse15) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store (store .cse12 (+ .cse17 3 |c_~#a~0.offset|) 0) .cse14 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))))) (not (= (select .cse10 (+ .cse17 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse20 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse20 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse23 (+ .cse20 |c_~#a~0.offset|)) (.cse22 (+ .cse20 |c_~#a~0.offset| 1)) (.cse24 (+ .cse20 2 |c_~#a~0.offset|))) (let ((.cse25 (let ((.cse26 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse23 v_ArrVal_901) .cse22 v_ArrVal_902) .cse24 v_ArrVal_904)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse21 (select .cse25 |c_~#a~0.base|))) (or (not (= (select .cse21 .cse22) 0)) (not (= (select .cse21 .cse23) 0)) (not (= (select .cse21 .cse24) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store .cse25 |c_~#a~0.base| (store (store .cse21 (+ .cse20 3 |c_~#a~0.offset|) 0) .cse23 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse30 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse31 (+ .cse30 |c_~#a~0.offset|)) (.cse28 (+ .cse30 |c_~#a~0.offset| 1)) (.cse32 (+ .cse30 2 |c_~#a~0.offset|))) (let ((.cse29 (let ((.cse33 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse31 v_ArrVal_901) .cse28 v_ArrVal_902) .cse32 v_ArrVal_904)))) (store .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse33 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse27 (select .cse29 |c_~#a~0.base|))) (or (not (= (select .cse27 .cse28) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse29 |c_~#a~0.base| (store (store .cse27 (+ .cse30 3 |c_~#a~0.offset|) 0) .cse31 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse27 .cse31) 0)) (not (= (select .cse27 .cse32) 0))))))) (not (= (select .cse10 (+ .cse30 |c_~#a~0.offset| 4)) 0))))))) is different from true [2023-08-25 03:28:40,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:43,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:45,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:48,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:50,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:52,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:54,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:56,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:28:58,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:00,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:02,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:04,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:06,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:08,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:09,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:12,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:16,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:18,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:20,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:22,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:24,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:26,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:28,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:30,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:32,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:34,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:37,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:39,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:41,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:43,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:45,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:47,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:50,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:52,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:54,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:56,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:29:58,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:00,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:02,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:17,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:18,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:20,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:22,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:24,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:28,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:30,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:32,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:34,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:36,116 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 1)) (.cse5 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 2))) (let ((.cse27 (store |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base| (store (store (select |c_#race| |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18 0) .cse5 0)))) (let ((.cse11 (+ (* |c_ULTIMATE.start_main_~i~2#1| 28) |c_~#a~0.offset|)) (.cse9 (select |c_#race| |c_~#a~0.base|)) (.cse8 (+ |c_t_funThread1of1ForFork0_~p~0#1.offset| 3)) (.cse28 (select .cse27 |c_~#a~0.base|)) (.cse10 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse3 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse4 (+ .cse3 |c_~#a~0.offset|)) (.cse1 (+ .cse3 |c_~#a~0.offset| 1)) (.cse6 (+ .cse3 2 |c_~#a~0.offset|))) (let ((.cse2 (let ((.cse7 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse4 v_ArrVal_901) .cse1 v_ArrVal_902) .cse6 v_ArrVal_904)))) (store .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse0 (select .cse2 |c_~#a~0.base|))) (or (not (= (select .cse0 .cse1) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse2 |c_~#a~0.base| (store (store .cse0 (+ .cse3 3 |c_~#a~0.offset|) 0) .cse4 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (not (= (select .cse0 .cse4) 0)) (not (= (select .cse0 .cse6) 0))))))) (not (= (select .cse10 (+ .cse3 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse17 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse14 (+ .cse17 |c_~#a~0.offset|)) (.cse13 (+ .cse17 |c_~#a~0.offset| 1)) (.cse15 (+ .cse17 2 |c_~#a~0.offset|))) (let ((.cse16 (let ((.cse19 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse14 v_ArrVal_901) .cse13 v_ArrVal_902) .cse15 v_ArrVal_904)))) (store .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse12 (select .cse16 |c_~#a~0.base|))) (or (not (= (select .cse12 .cse13) 0)) (not (= (select .cse12 .cse14) 0)) (not (= (select .cse12 .cse15) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse16 |c_~#a~0.base| (store (store .cse12 (+ .cse17 3 |c_~#a~0.offset|) 0) .cse14 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0))))))) (not (= (select .cse10 (+ .cse17 |c_~#a~0.offset| 4)) 0))))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse20 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse20 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse23 (+ .cse20 |c_~#a~0.offset|)) (.cse25 (+ .cse20 |c_~#a~0.offset| 1)) (.cse24 (+ .cse20 2 |c_~#a~0.offset|))) (let ((.cse21 (let ((.cse26 (store .cse27 |c_~#a~0.base| (store (store (store .cse28 .cse23 v_ArrVal_901) .cse25 v_ArrVal_902) .cse24 v_ArrVal_904)))) (store .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse26 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse22 (select .cse21 |c_~#a~0.base|))) (or (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse21 |c_~#a~0.base| (store (store .cse22 (+ .cse20 3 |c_~#a~0.offset|) 0) .cse23 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) (not (= (select .cse22 .cse24) 0)) (not (= (select .cse22 .cse23) 0)) (not (= (select .cse22 .cse25) 0)))))))))) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))) (forall ((v_ArrVal_910 Int)) (= (select (select (store |c_#race| |c_~#a~0.base| (store .cse9 .cse11 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0)) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse29 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse29 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse32 (+ .cse29 |c_~#a~0.offset|)) (.cse31 (+ .cse29 |c_~#a~0.offset| 1)) (.cse33 (+ .cse29 2 |c_~#a~0.offset|))) (let ((.cse34 (let ((.cse35 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse32 v_ArrVal_901) .cse31 v_ArrVal_902) .cse33 v_ArrVal_904)))) (store .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse35 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse30 (select .cse34 |c_~#a~0.base|))) (or (not (= (select .cse30 .cse31) 0)) (not (= (select .cse30 .cse32) 0)) (not (= (select .cse30 .cse33) 0)) (forall ((v_ArrVal_910 Int)) (= 0 (select (select (store .cse34 |c_~#a~0.base| (store (store .cse30 (+ .cse29 3 |c_~#a~0.offset|) 0) .cse32 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|))))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse39 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse40 (+ .cse39 |c_~#a~0.offset|)) (.cse37 (+ .cse39 |c_~#a~0.offset| 1)) (.cse41 (+ .cse39 2 |c_~#a~0.offset|))) (let ((.cse38 (let ((.cse42 (store |c_#race| |c_~#a~0.base| (store (store (store .cse9 .cse40 v_ArrVal_901) .cse37 v_ArrVal_902) .cse41 v_ArrVal_904)))) (store .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse42 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse36 (select .cse38 |c_~#a~0.base|))) (or (not (= (select .cse36 .cse37) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse38 |c_~#a~0.base| (store (store .cse36 (+ .cse39 3 |c_~#a~0.offset|) 0) .cse40 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse36 .cse40) 0)) (not (= (select .cse36 .cse41) 0))))))) (not (= (select .cse10 (+ .cse39 |c_~#a~0.offset| 4)) 0))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse43 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse43 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse47 (+ .cse43 |c_~#a~0.offset|)) (.cse48 (+ .cse43 |c_~#a~0.offset| 1)) (.cse45 (+ .cse43 2 |c_~#a~0.offset|))) (let ((.cse46 (let ((.cse49 (store .cse27 |c_~#a~0.base| (store (store (store .cse28 .cse47 v_ArrVal_901) .cse48 v_ArrVal_902) .cse45 v_ArrVal_904)))) (store .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse49 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse44 (select .cse46 |c_~#a~0.base|))) (or (not (= (select .cse44 .cse45) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse46 |c_~#a~0.base| (store (store .cse44 (+ .cse43 3 |c_~#a~0.offset|) 0) .cse47 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8) 0)) (not (= (select .cse44 .cse47) 0)) (not (= (select .cse44 .cse48) 0)))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse50 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (not (= (select .cse10 (+ .cse50 |c_~#a~0.offset| 4)) 0)) (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse53 (+ .cse50 |c_~#a~0.offset|)) (.cse55 (+ .cse50 |c_~#a~0.offset| 1)) (.cse54 (+ .cse50 2 |c_~#a~0.offset|))) (let ((.cse51 (let ((.cse56 (store .cse27 |c_~#a~0.base| (store (store (store .cse28 .cse53 v_ArrVal_901) .cse55 v_ArrVal_902) .cse54 v_ArrVal_904)))) (store .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse56 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse52 (select .cse51 |c_~#a~0.base|))) (or (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse51 |c_~#a~0.base| (store (store .cse52 (+ .cse50 3 |c_~#a~0.offset|) 0) .cse53 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse18) 0)) (not (= (select .cse52 .cse54) 0)) (not (= (select .cse52 .cse53) 0)) (not (= (select .cse52 .cse55) 0)))))))))) (forall ((|ULTIMATE.start_main_~i~2#1| Int)) (let ((.cse60 (* |ULTIMATE.start_main_~i~2#1| 28))) (or (forall ((v_ArrVal_904 Int) (v_ArrVal_902 Int) (v_ArrVal_901 Int)) (let ((.cse61 (+ .cse60 |c_~#a~0.offset|)) (.cse62 (+ .cse60 |c_~#a~0.offset| 1)) (.cse58 (+ .cse60 2 |c_~#a~0.offset|))) (let ((.cse59 (let ((.cse63 (store .cse27 |c_~#a~0.base| (store (store (store .cse28 .cse61 v_ArrVal_901) .cse62 v_ArrVal_902) .cse58 v_ArrVal_904)))) (store .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base| (store (select .cse63 |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse8 0))))) (let ((.cse57 (select .cse59 |c_~#a~0.base|))) (or (not (= (select .cse57 .cse58) 0)) (forall ((v_ArrVal_910 Int)) (= (select (select (store .cse59 |c_~#a~0.base| (store (store .cse57 (+ .cse60 3 |c_~#a~0.offset|) 0) .cse61 v_ArrVal_910)) |c_t_funThread1of1ForFork0_~p~0#1.base|) .cse5) 0)) (not (= (select .cse57 .cse61) 0)) (not (= (select .cse57 .cse62) 0))))))) (not (= (select .cse10 (+ .cse60 |c_~#a~0.offset| 4)) 0))))))))) is different from true [2023-08-25 03:30:38,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:40,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:42,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:44,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:46,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:48,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:51,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:53,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:55,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:30:57,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:00,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:02,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:05,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:07,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:09,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:11,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:14,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:16,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:18,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:20,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:22,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:24,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:26,324 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:28,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:30,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:32,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:34,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:37,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:38,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:40,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:44,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:46,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:48,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:50,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:51,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:53,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:55,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:57,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:31:59,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:02,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:04,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:07,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:09,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:11,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:13,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:15,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:17,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:19,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:21,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:23,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:25,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:27,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:30,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:32,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:35,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:36,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:39,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:45,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:47,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:49,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:32:59,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:01,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:03,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:06,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:08,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:09,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:12,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:14,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:16,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:18,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:20,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:22,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:25,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:27,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:29,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:31,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:33,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:35,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:37,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:39,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:43,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:45,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:47,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:50,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:52,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:54,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:56,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:33:58,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:00,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:02,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:04,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:06,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:08,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:10,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:14,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:16,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:18,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:20,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:22,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-25 03:34:24,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-25 03:34:24,872 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 03:34:24,872 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-25 03:34:25,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 03:34:26,073 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-25 03:34:26,098 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2023-08-25 03:34:26,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 03:34:26,099 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-25 03:34:26,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2023-08-25 03:34:26,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2023-08-25 03:34:26,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-25 03:34:26,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2023-08-25 03:34:26,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2023-08-25 03:34:26,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2023-08-25 03:34:26,101 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 1, 1, 1] [2023-08-25 03:34:26,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-25 03:34:26,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 03:34:26,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 03:34:26,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 03:34:26 BasicIcfg [2023-08-25 03:34:26,109 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 03:34:26,110 INFO L158 Benchmark]: Toolchain (without parser) took 843832.43ms. Allocated memory was 413.1MB in the beginning and 13.6GB in the end (delta: 13.2GB). Free memory was 387.9MB in the beginning and 8.1GB in the end (delta: -7.7GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-08-25 03:34:26,110 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 413.1MB. Free memory is still 391.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 03:34:26,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 587.99ms. Allocated memory is still 413.1MB. Free memory was 387.1MB in the beginning and 359.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 03:34:26,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.91ms. Allocated memory is still 413.1MB. Free memory was 359.5MB in the beginning and 356.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 03:34:26,110 INFO L158 Benchmark]: Boogie Preprocessor took 50.27ms. Allocated memory is still 413.1MB. Free memory was 356.3MB in the beginning and 354.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 03:34:26,111 INFO L158 Benchmark]: RCFGBuilder took 425.57ms. Allocated memory is still 413.1MB. Free memory was 354.5MB in the beginning and 337.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-25 03:34:26,111 INFO L158 Benchmark]: TraceAbstraction took 842691.04ms. Allocated memory was 413.1MB in the beginning and 13.6GB in the end (delta: 13.2GB). Free memory was 337.0MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. [2023-08-25 03:34:26,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 413.1MB. Free memory is still 391.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 587.99ms. Allocated memory is still 413.1MB. Free memory was 387.1MB in the beginning and 359.5MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.91ms. Allocated memory is still 413.1MB. Free memory was 359.5MB in the beginning and 356.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.27ms. Allocated memory is still 413.1MB. Free memory was 356.3MB in the beginning and 354.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 425.57ms. Allocated memory is still 413.1MB. Free memory was 354.5MB in the beginning and 337.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 842691.04ms. Allocated memory was 413.1MB in the beginning and 13.6GB in the end (delta: 13.2GB). Free memory was 337.0MB in the beginning and 8.1GB in the end (delta: -7.8GB). Peak memory consumption was 5.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 249]: Unsoundness Warning unspecified type, defaulting to int C: short [249] - GenericResultAtLocation [Line: 741]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [741] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 101 PlacesBefore, 39 PlacesAfterwards, 101 TransitionsBefore, 36 TransitionsAfterwards, 2262 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 3 ConcurrentYvCompositions, 3 ChoiceCompositions, 75 TotalNumberOfCompositions, 8906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2718, independent: 2322, independent conditional: 0, independent unconditional: 2322, dependent: 396, dependent conditional: 0, dependent unconditional: 396, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1033, independent conditional: 0, independent unconditional: 1033, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2718, independent: 1289, independent conditional: 0, independent unconditional: 1289, dependent: 345, dependent conditional: 0, dependent unconditional: 345, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 68, Positive conditional cache size: 0, Positive unconditional cache size: 68, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 932]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 944]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - TimeoutResultAtElement [Line: 942]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 932]: Timeout (TraceAbstraction) Unable to prove that there are no data races Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 139 locations, 7 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: 842.5s, OverallIterations: 15, TraceHistogramMax: 10, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 640.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 211 mSolverCounterUnknown, 880 SdHoareTripleChecker+Valid, 552.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 880 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 550.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5967 IncrementalHoareTripleChecker+Invalid, 6726 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 144 mSDtfsCounter, 5967 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 193 SyntacticMatches, 6 SemanticMatches, 246 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 198.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8141occurred in iteration=14, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 197.7s InterpolantComputationTime, 500 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 564 ConstructedInterpolants, 25 QuantifiedInterpolants, 29308 SizeOfPredicates, 21 NumberOfNonLiveVariables, 963 ConjunctsInSsa, 213 ConjunctsInUnsatCore, 25 InterpolantComputations, 13 PerfectInterpolantSequences, 588/933 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