/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 10:48:27,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 10:48:27,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 10:48:27,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 10:48:27,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 10:48:27,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 10:48:27,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 10:48:27,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 10:48:27,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 10:48:27,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 10:48:27,667 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 10:48:27,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 10:48:27,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 10:48:27,668 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 10:48:27,669 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 10:48:27,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 10:48:27,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 10:48:27,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 10:48:27,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 10:48:27,670 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 10:48:27,670 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 10:48:27,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 10:48:27,674 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 10:48:27,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 10:48:27,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 10:48:27,678 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 10:48:27,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 10:48:27,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:48:27,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 10:48:27,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 10:48:27,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 10:48:27,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 10:48:27,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 10:48:27,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 10:48:27,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 10:48:27,681 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-26 10:48:27,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 10:48:28,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 10:48:28,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 10:48:28,010 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 10:48:28,012 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 10:48:28,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-26 10:48:29,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 10:48:29,409 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 10:48:29,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-26 10:48:29,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128e51831/5161b344c51f487880898e671869a118/FLAGbf1c9b49a [2023-08-26 10:48:29,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128e51831/5161b344c51f487880898e671869a118 [2023-08-26 10:48:29,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 10:48:29,444 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 10:48:29,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 10:48:29,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 10:48:29,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 10:48:29,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3afd5353 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29, skipping insertion in model container [2023-08-26 10:48:29,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 10:48:29,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:48:29,707 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 10:48:29,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 10:48:29,767 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:48:29,768 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 10:48:29,773 INFO L206 MainTranslator]: Completed translation [2023-08-26 10:48:29,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29 WrapperNode [2023-08-26 10:48:29,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 10:48:29,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 10:48:29,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 10:48:29,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 10:48:29,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,829 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 300 [2023-08-26 10:48:29,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 10:48:29,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 10:48:29,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 10:48:29,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 10:48:29,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,865 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 10:48:29,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 10:48:29,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 10:48:29,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 10:48:29,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (1/1) ... [2023-08-26 10:48:29,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 10:48:29,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:48:29,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 10:48:29,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 10:48:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 10:48:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 10:48:29,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 10:48:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 10:48:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 10:48:29,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 10:48:29,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 10:48:29,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 10:48:29,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 10:48:29,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 10:48:29,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 10:48:29,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 10:48:29,958 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 10:48:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-26 10:48:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 10:48:29,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 10:48:29,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 10:48:29,960 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 10:48:30,056 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 10:48:30,058 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 10:48:30,646 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 10:48:30,887 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 10:48:30,888 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-26 10:48:30,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:48:30 BoogieIcfgContainer [2023-08-26 10:48:30,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 10:48:30,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 10:48:30,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 10:48:30,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 10:48:30,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 10:48:29" (1/3) ... [2023-08-26 10:48:30,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c80f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:48:30, skipping insertion in model container [2023-08-26 10:48:30,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 10:48:29" (2/3) ... [2023-08-26 10:48:30,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c80f611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 10:48:30, skipping insertion in model container [2023-08-26 10:48:30,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 10:48:30" (3/3) ... [2023-08-26 10:48:30,897 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-26 10:48:30,913 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 10:48:30,914 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-26 10:48:30,914 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 10:48:30,999 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-26 10:48:31,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 237 transitions, 498 flow [2023-08-26 10:48:31,138 INFO L124 PetriNetUnfolderBase]: 11/234 cut-off events. [2023-08-26 10:48:31,138 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:48:31,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 234 events. 11/234 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 346 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 189. Up to 2 conditions per place. [2023-08-26 10:48:31,145 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 237 transitions, 498 flow [2023-08-26 10:48:31,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 223 transitions, 464 flow [2023-08-26 10:48:31,159 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 10:48:31,167 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 223 transitions, 464 flow [2023-08-26 10:48:31,170 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 223 transitions, 464 flow [2023-08-26 10:48:31,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 223 transitions, 464 flow [2023-08-26 10:48:31,209 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2023-08-26 10:48:31,210 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 10:48:31,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 223 events. 11/223 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 189. Up to 2 conditions per place. [2023-08-26 10:48:31,216 INFO L119 LiptonReduction]: Number of co-enabled transitions 6192 [2023-08-26 10:48:38,417 INFO L134 LiptonReduction]: Checked pairs total: 23802 [2023-08-26 10:48:38,418 INFO L136 LiptonReduction]: Total number of compositions: 210 [2023-08-26 10:48:38,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 10:48:38,435 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;@26ab1b90, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 10:48:38,435 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-08-26 10:48:38,437 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 10:48:38,437 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 10:48:38,437 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 10:48:38,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:38,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 10:48:38,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:38,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:38,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1203, now seen corresponding path program 1 times [2023-08-26 10:48:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:38,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857915638] [2023-08-26 10:48:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:38,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:38,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857915638] [2023-08-26 10:48:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857915638] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 10:48:38,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410967827] [2023-08-26 10:48:38,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 10:48:38,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 10:48:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 10:48:38,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 447 [2023-08-26 10:48:38,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 182 flow. Second operand has 2 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:38,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 447 [2023-08-26 10:48:38,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:38,791 INFO L124 PetriNetUnfolderBase]: 390/894 cut-off events. [2023-08-26 10:48:38,791 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-26 10:48:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1584 conditions, 894 events. 390/894 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4851 event pairs, 317 based on Foata normal form. 0/757 useless extension candidates. Maximal degree in co-relation 1316. Up to 603 conditions per place. [2023-08-26 10:48:38,800 INFO L140 encePairwiseOnDemand]: 408/447 looper letters, 27 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-26 10:48:38,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 158 flow [2023-08-26 10:48:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 10:48:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 10:48:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2023-08-26 10:48:38,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49217002237136465 [2023-08-26 10:48:38,822 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2023-08-26 10:48:38,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2023-08-26 10:48:38,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:38,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2023-08-26 10:48:38,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 220.0) internal successors, (440), 2 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:38,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:38,838 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:38,840 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 182 flow. Second operand 2 states and 440 transitions. [2023-08-26 10:48:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 158 flow [2023-08-26 10:48:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-26 10:48:38,846 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 92 flow [2023-08-26 10:48:38,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=92, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-26 10:48:38,852 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -43 predicate places. [2023-08-26 10:48:38,853 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 92 flow [2023-08-26 10:48:38,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 187.5) internal successors, (375), 2 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:38,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:38,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:38,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 10:48:38,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:38,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1975060709, now seen corresponding path program 1 times [2023-08-26 10:48:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520348189] [2023-08-26 10:48:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:38,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:38,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520348189] [2023-08-26 10:48:38,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520348189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:38,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:48:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342424913] [2023-08-26 10:48:38,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:38,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:48:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:38,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:48:38,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:48:38,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 447 [2023-08-26 10:48:39,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:39,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 447 [2023-08-26 10:48:39,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:39,167 INFO L124 PetriNetUnfolderBase]: 660/1267 cut-off events. [2023-08-26 10:48:39,167 INFO L125 PetriNetUnfolderBase]: For 30/110 co-relation queries the response was YES. [2023-08-26 10:48:39,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2344 conditions, 1267 events. 660/1267 cut-off events. For 30/110 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 6275 event pairs, 159 based on Foata normal form. 4/1085 useless extension candidates. Maximal degree in co-relation 2341. Up to 712 conditions per place. [2023-08-26 10:48:39,174 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 46 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-26 10:48:39,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 231 flow [2023-08-26 10:48:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:48:39,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:48:39,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-08-26 10:48:39,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436241610738255 [2023-08-26 10:48:39,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-08-26 10:48:39,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-08-26 10:48:39,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:39,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-08-26 10:48:39,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,182 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,183 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 92 flow. Second operand 3 states and 585 transitions. [2023-08-26 10:48:39,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 231 flow [2023-08-26 10:48:39,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 231 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 10:48:39,185 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 105 flow [2023-08-26 10:48:39,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-26 10:48:39,186 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -42 predicate places. [2023-08-26 10:48:39,186 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 105 flow [2023-08-26 10:48:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:39,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:39,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 10:48:39,187 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:39,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1572512489, now seen corresponding path program 1 times [2023-08-26 10:48:39,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:39,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599500408] [2023-08-26 10:48:39,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:39,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:39,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:39,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599500408] [2023-08-26 10:48:39,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599500408] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:39,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:39,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:48:39,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515248327] [2023-08-26 10:48:39,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:39,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:48:39,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:39,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:48:39,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:48:39,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 447 [2023-08-26 10:48:39,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:39,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:39,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 447 [2023-08-26 10:48:39,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:40,130 INFO L124 PetriNetUnfolderBase]: 1497/2287 cut-off events. [2023-08-26 10:48:40,130 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2023-08-26 10:48:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5042 conditions, 2287 events. 1497/2287 cut-off events. For 431/431 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 9847 event pairs, 196 based on Foata normal form. 0/2264 useless extension candidates. Maximal degree in co-relation 5038. Up to 947 conditions per place. [2023-08-26 10:48:40,141 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 90 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-26 10:48:40,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 455 flow [2023-08-26 10:48:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:48:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:48:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1027 transitions. [2023-08-26 10:48:40,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292319164802385 [2023-08-26 10:48:40,144 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1027 transitions. [2023-08-26 10:48:40,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1027 transitions. [2023-08-26 10:48:40,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:40,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1027 transitions. [2023-08-26 10:48:40,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.16666666666666) internal successors, (1027), 6 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,152 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,152 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 105 flow. Second operand 6 states and 1027 transitions. [2023-08-26 10:48:40,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 455 flow [2023-08-26 10:48:40,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:48:40,155 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 108 flow [2023-08-26 10:48:40,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 10:48:40,156 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2023-08-26 10:48:40,156 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 108 flow [2023-08-26 10:48:40,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.0) internal successors, (954), 6 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:40,157 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:40,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 10:48:40,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:40,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1656528520, now seen corresponding path program 1 times [2023-08-26 10:48:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:40,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050535105] [2023-08-26 10:48:40,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:40,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:40,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:40,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050535105] [2023-08-26 10:48:40,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050535105] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:40,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:40,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:48:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884484466] [2023-08-26 10:48:40,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:40,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:48:40,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:48:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:48:40,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 447 [2023-08-26 10:48:40,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:40,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 447 [2023-08-26 10:48:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:40,306 INFO L124 PetriNetUnfolderBase]: 606/1194 cut-off events. [2023-08-26 10:48:40,306 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-26 10:48:40,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2490 conditions, 1194 events. 606/1194 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5914 event pairs, 447 based on Foata normal form. 0/1157 useless extension candidates. Maximal degree in co-relation 2485. Up to 938 conditions per place. [2023-08-26 10:48:40,313 INFO L140 encePairwiseOnDemand]: 445/447 looper letters, 29 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 10:48:40,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 166 flow [2023-08-26 10:48:40,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:48:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:48:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-08-26 10:48:40,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198359433258762 [2023-08-26 10:48:40,315 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-08-26 10:48:40,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-08-26 10:48:40,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:40,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-08-26 10:48:40,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 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-26 10:48:40,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,320 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,320 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 108 flow. Second operand 3 states and 563 transitions. [2023-08-26 10:48:40,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 166 flow [2023-08-26 10:48:40,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 159 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:48:40,323 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 101 flow [2023-08-26 10:48:40,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 10:48:40,324 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -42 predicate places. [2023-08-26 10:48:40,324 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 101 flow [2023-08-26 10:48:40,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:40,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:40,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 10:48:40,325 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:40,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash -684552344, now seen corresponding path program 1 times [2023-08-26 10:48:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:40,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796576879] [2023-08-26 10:48:40,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:40,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796576879] [2023-08-26 10:48:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796576879] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:40,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:40,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:48:40,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561924696] [2023-08-26 10:48:40,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:40,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:48:40,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:40,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:48:40,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:48:40,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 447 [2023-08-26 10:48:40,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:40,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 447 [2023-08-26 10:48:40,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:40,563 INFO L124 PetriNetUnfolderBase]: 464/831 cut-off events. [2023-08-26 10:48:40,564 INFO L125 PetriNetUnfolderBase]: For 77/139 co-relation queries the response was YES. [2023-08-26 10:48:40,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1774 conditions, 831 events. 464/831 cut-off events. For 77/139 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 3495 event pairs, 18 based on Foata normal form. 82/894 useless extension candidates. Maximal degree in co-relation 1769. Up to 282 conditions per place. [2023-08-26 10:48:40,569 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 62 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2023-08-26 10:48:40,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 337 flow [2023-08-26 10:48:40,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:48:40,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:48:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 978 transitions. [2023-08-26 10:48:40,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375838926174497 [2023-08-26 10:48:40,572 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 978 transitions. [2023-08-26 10:48:40,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 978 transitions. [2023-08-26 10:48:40,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:40,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 978 transitions. [2023-08-26 10:48:40,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,580 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 101 flow. Second operand 5 states and 978 transitions. [2023-08-26 10:48:40,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 337 flow [2023-08-26 10:48:40,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 10:48:40,582 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 128 flow [2023-08-26 10:48:40,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-26 10:48:40,583 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -37 predicate places. [2023-08-26 10:48:40,583 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 128 flow [2023-08-26 10:48:40,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:40,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:40,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 10:48:40,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:40,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 351198688, now seen corresponding path program 1 times [2023-08-26 10:48:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575175507] [2023-08-26 10:48:40,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:40,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575175507] [2023-08-26 10:48:40,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575175507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:40,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:40,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 10:48:40,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981109993] [2023-08-26 10:48:40,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:40,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 10:48:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:40,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 10:48:40,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 10:48:40,902 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 447 [2023-08-26 10:48:40,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 128 flow. Second operand has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:40,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:40,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 447 [2023-08-26 10:48:40,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:41,215 INFO L124 PetriNetUnfolderBase]: 1324/2040 cut-off events. [2023-08-26 10:48:41,215 INFO L125 PetriNetUnfolderBase]: For 1184/1184 co-relation queries the response was YES. [2023-08-26 10:48:41,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5291 conditions, 2040 events. 1324/2040 cut-off events. For 1184/1184 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 8707 event pairs, 847 based on Foata normal form. 0/2009 useless extension candidates. Maximal degree in co-relation 5283. Up to 1875 conditions per place. [2023-08-26 10:48:41,228 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 68 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-26 10:48:41,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 358 flow [2023-08-26 10:48:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:48:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:48:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1006 transitions. [2023-08-26 10:48:41,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3750932140193885 [2023-08-26 10:48:41,231 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1006 transitions. [2023-08-26 10:48:41,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1006 transitions. [2023-08-26 10:48:41,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:41,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1006 transitions. [2023-08-26 10:48:41,234 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 167.66666666666666) internal successors, (1006), 6 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,238 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,238 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 128 flow. Second operand 6 states and 1006 transitions. [2023-08-26 10:48:41,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 358 flow [2023-08-26 10:48:41,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:48:41,241 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 131 flow [2023-08-26 10:48:41,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=131, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 10:48:41,242 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -34 predicate places. [2023-08-26 10:48:41,242 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 131 flow [2023-08-26 10:48:41,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 160.5) internal successors, (963), 6 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:41,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:41,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 10:48:41,243 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:41,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1634481756, now seen corresponding path program 1 times [2023-08-26 10:48:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394172365] [2023-08-26 10:48:41,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:41,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394172365] [2023-08-26 10:48:41,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394172365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:41,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:41,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:48:41,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147222149] [2023-08-26 10:48:41,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:48:41,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:41,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:48:41,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:48:41,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 447 [2023-08-26 10:48:41,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:41,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 447 [2023-08-26 10:48:41,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:41,539 INFO L124 PetriNetUnfolderBase]: 547/1049 cut-off events. [2023-08-26 10:48:41,539 INFO L125 PetriNetUnfolderBase]: For 421/544 co-relation queries the response was YES. [2023-08-26 10:48:41,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2554 conditions, 1049 events. 547/1049 cut-off events. For 421/544 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5013 event pairs, 67 based on Foata normal form. 48/1088 useless extension candidates. Maximal degree in co-relation 2546. Up to 382 conditions per place. [2023-08-26 10:48:41,546 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 60 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2023-08-26 10:48:41,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 385 flow [2023-08-26 10:48:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:48:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:48:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 973 transitions. [2023-08-26 10:48:41,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43534675615212526 [2023-08-26 10:48:41,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 973 transitions. [2023-08-26 10:48:41,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 973 transitions. [2023-08-26 10:48:41,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:41,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 973 transitions. [2023-08-26 10:48:41,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.6) internal successors, (973), 5 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,558 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,558 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 131 flow. Second operand 5 states and 973 transitions. [2023-08-26 10:48:41,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 385 flow [2023-08-26 10:48:41,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 10:48:41,561 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 168 flow [2023-08-26 10:48:41,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=168, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 10:48:41,562 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2023-08-26 10:48:41,562 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 168 flow [2023-08-26 10:48:41,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 187.75) internal successors, (751), 4 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:41,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:41,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 10:48:41,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:41,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash 171786144, now seen corresponding path program 2 times [2023-08-26 10:48:41,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624797715] [2023-08-26 10:48:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:41,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624797715] [2023-08-26 10:48:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624797715] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:48:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973066272] [2023-08-26 10:48:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:41,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:48:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:48:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:48:41,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 447 [2023-08-26 10:48:41,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 168 flow. Second operand has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:41,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 447 [2023-08-26 10:48:41,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:42,056 INFO L124 PetriNetUnfolderBase]: 797/1468 cut-off events. [2023-08-26 10:48:42,057 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2023-08-26 10:48:42,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 1468 events. 797/1468 cut-off events. For 962/962 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 7431 event pairs, 75 based on Foata normal form. 56/1507 useless extension candidates. Maximal degree in co-relation 3944. Up to 498 conditions per place. [2023-08-26 10:48:42,066 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 72 selfloop transitions, 7 changer transitions 15/105 dead transitions. [2023-08-26 10:48:42,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 577 flow [2023-08-26 10:48:42,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:48:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:48:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1168 transitions. [2023-08-26 10:48:42,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354958985831469 [2023-08-26 10:48:42,070 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1168 transitions. [2023-08-26 10:48:42,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1168 transitions. [2023-08-26 10:48:42,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:42,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1168 transitions. [2023-08-26 10:48:42,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 194.66666666666666) internal successors, (1168), 6 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,078 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,078 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 168 flow. Second operand 6 states and 1168 transitions. [2023-08-26 10:48:42,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 577 flow [2023-08-26 10:48:42,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:48:42,082 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 185 flow [2023-08-26 10:48:42,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=185, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-08-26 10:48:42,085 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -25 predicate places. [2023-08-26 10:48:42,085 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 185 flow [2023-08-26 10:48:42,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 185.8) internal successors, (929), 5 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:42,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:42,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 10:48:42,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:42,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -77705371, now seen corresponding path program 1 times [2023-08-26 10:48:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657966347] [2023-08-26 10:48:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:42,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657966347] [2023-08-26 10:48:42,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657966347] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:42,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:42,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 10:48:42,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594564269] [2023-08-26 10:48:42,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:42,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 10:48:42,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:42,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 10:48:42,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 10:48:42,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 447 [2023-08-26 10:48:42,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:42,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 447 [2023-08-26 10:48:42,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:42,292 INFO L124 PetriNetUnfolderBase]: 516/1036 cut-off events. [2023-08-26 10:48:42,292 INFO L125 PetriNetUnfolderBase]: For 1561/1561 co-relation queries the response was YES. [2023-08-26 10:48:42,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 1036 events. 516/1036 cut-off events. For 1561/1561 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4566 event pairs, 191 based on Foata normal form. 22/1043 useless extension candidates. Maximal degree in co-relation 2973. Up to 763 conditions per place. [2023-08-26 10:48:42,300 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-26 10:48:42,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 281 flow [2023-08-26 10:48:42,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 10:48:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 10:48:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-08-26 10:48:42,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317673378076063 [2023-08-26 10:48:42,303 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-08-26 10:48:42,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-08-26 10:48:42,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:42,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-08-26 10:48:42,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,307 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 447.0) internal successors, (1788), 4 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,307 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 185 flow. Second operand 3 states and 579 transitions. [2023-08-26 10:48:42,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 281 flow [2023-08-26 10:48:42,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 254 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-26 10:48:42,311 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 164 flow [2023-08-26 10:48:42,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-26 10:48:42,312 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -32 predicate places. [2023-08-26 10:48:42,312 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 164 flow [2023-08-26 10:48:42,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:42,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:42,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 10:48:42,313 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:42,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1556726080, now seen corresponding path program 1 times [2023-08-26 10:48:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848910284] [2023-08-26 10:48:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:48:42,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:42,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848910284] [2023-08-26 10:48:42,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848910284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:48:42,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:48:42,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 10:48:42,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473560195] [2023-08-26 10:48:42,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:48:42,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 10:48:42,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 10:48:42,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 10:48:42,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 447 [2023-08-26 10:48:42,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 164 flow. Second operand has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:42,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 447 [2023-08-26 10:48:42,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:42,684 INFO L124 PetriNetUnfolderBase]: 551/1145 cut-off events. [2023-08-26 10:48:42,684 INFO L125 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2023-08-26 10:48:42,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063 conditions, 1145 events. 551/1145 cut-off events. For 889/889 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 5260 event pairs, 366 based on Foata normal form. 8/1137 useless extension candidates. Maximal degree in co-relation 3052. Up to 855 conditions per place. [2023-08-26 10:48:42,691 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 33 selfloop transitions, 2 changer transitions 15/61 dead transitions. [2023-08-26 10:48:42,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 309 flow [2023-08-26 10:48:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 10:48:42,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 10:48:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2023-08-26 10:48:42,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821029082774049 [2023-08-26 10:48:42,694 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2023-08-26 10:48:42,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2023-08-26 10:48:42,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:48:42,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2023-08-26 10:48:42,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.8) internal successors, (854), 5 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 447.0) internal successors, (2682), 6 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,700 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 164 flow. Second operand 5 states and 854 transitions. [2023-08-26 10:48:42,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 309 flow [2023-08-26 10:48:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 10:48:42,703 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 178 flow [2023-08-26 10:48:42,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-08-26 10:48:42,703 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -26 predicate places. [2023-08-26 10:48:42,703 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 178 flow [2023-08-26 10:48:42,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 167.2) internal successors, (836), 5 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:42,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:48:42,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:48:42,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 10:48:42,704 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:48:42,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:48:42,705 INFO L85 PathProgramCache]: Analyzing trace with hash 303461183, now seen corresponding path program 1 times [2023-08-26 10:48:42,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:48:42,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098203626] [2023-08-26 10:48:42,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:42,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:48:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:43,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:48:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098203626] [2023-08-26 10:48:43,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098203626] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:48:43,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173301849] [2023-08-26 10:48:43,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:48:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:48:43,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:48:43,779 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:48:43,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 10:48:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:48:43,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-26 10:48:43,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:48:44,119 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-26 10:48:44,184 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 10:48:44,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 10:48:44,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 6 treesize of output 5 [2023-08-26 10:48:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:48:44,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:48:45,611 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~back~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1)))))))) is different from false [2023-08-26 10:48:45,803 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 c_~back~0) (let ((.cse1 (+ (* c_~back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ (* c_~front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (<= 0 (+ (select .cse0 .cse2) c_~sum~0))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse3 .cse1) 1)) (<= (+ (select .cse3 .cse2) c_~sum~0) 1)))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~front~0 0)) is different from false [2023-08-26 10:48:45,832 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:45,833 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-08-26 10:48:45,852 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:45,853 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 1308 treesize of output 1252 [2023-08-26 10:48:45,885 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:45,885 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 202 [2023-08-26 10:48:45,907 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:45,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 190 [2023-08-26 10:48:45,929 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:45,930 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 165 [2023-08-26 10:48:46,507 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:48:46,507 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-08-26 10:48:46,520 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:48:46,521 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 644 treesize of output 616 [2023-08-26 10:48:46,557 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:48:46,557 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 276 [2023-08-26 10:48:46,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:48:46,577 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 193 [2023-08-26 10:48:46,595 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 10:48:46,596 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 260 treesize of output 216 [2023-08-26 10:48:46,710 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-26 10:48:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 10:48:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173301849] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:48:46,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:48:46,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2023-08-26 10:48:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129586607] [2023-08-26 10:48:46,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:48:46,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 10:48:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:48:46,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 10:48:46,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=825, Unknown=20, NotChecked=122, Total=1122 [2023-08-26 10:48:46,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 447 [2023-08-26 10:48:46,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 178 flow. Second operand has 34 states, 34 states have (on average 111.23529411764706) internal successors, (3782), 34 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:48:46,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:48:46,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 447 [2023-08-26 10:48:46,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:48:47,152 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~back~0 4)) (.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse13)) (.cse2 (+ c_~queue~0.offset .cse14)) (.cse6 (= (mod c_~v_assert~0 256) 0)) (.cse4 (<= c_~n~0 c_~back~0)) (.cse5 (< c_~front~0 0))) (and (<= c_~v_assert~0 1) (or (and (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (not (= (select .cse3 .cse2) 1)) (<= 0 (+ c_~sum~0 (select .cse3 .cse1))))))) .cse4 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse5) (or .cse6 .cse4 .cse5 (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse7 .cse1)) 1) (not (= (select .cse7 .cse2) 1))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse8 .cse1))) (not (= (select .cse8 .cse2) 1))))))) (or .cse6 .cse4 (let ((.cse10 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse10) 1)) (<= 0 (+ (select .cse9 .cse11) c_~sum~0))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_434) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse12 .cse10) 1)) (<= (+ (select .cse12 .cse11) c_~sum~0) 1)))))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or .cse6 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= c_~back~0 c_~front~0)) .cse5) (<= c_~sum~0 1)))) is different from false [2023-08-26 10:48:47,314 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~n~0 c_~back~0)) (.cse1 (< c_~front~0 0)) (.cse2 (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse5 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse3 .cse4)) 1) (not (= (select .cse3 .cse5) 1))))) (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse6 .cse4))) (not (= (select .cse6 .cse5) 1))))))))) (and (or .cse0 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse1 .cse2) (or (= (mod c_~v_assert~0 256) 0) .cse0 .cse1 .cse2))) is different from false [2023-08-26 10:48:47,928 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse3 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (and (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse9 .cse3)) 1) (not (= (select .cse9 .cse4) 1))))) (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (not (= (select .cse10 .cse4) 1)) (<= 0 (+ c_~sum~0 (select .cse10 .cse3)))))))) (.cse6 (<= c_~n~0 c_~back~0)) (.cse7 (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0)) (.cse8 (< c_~front~0 0))) (and (or (let ((.cse1 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or .cse0 .cse1) (or (not .cse1) (and (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse2 .cse3)) 1) (not (= (+ (select .cse2 .cse4) 1) 0))))) (forall ((v_ArrVal_436 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_436) c_~queue~0.base))) (or (not (= (+ (select .cse5 .cse4) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse5 .cse3)))))))))) .cse6 .cse7 .cse8) (or .cse0 .cse6 .cse7 .cse8) (< 0 (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256))))) is different from false [2023-08-26 10:49:07,853 WARN L234 SmtUtils]: Spent 6.15s on a formula simplification. DAG size of input: 64 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:49:16,137 WARN L234 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 61 DAG size of output: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:49:34,203 WARN L234 SmtUtils]: Spent 8.31s on a formula simplification. DAG size of input: 64 DAG size of output: 62 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:49:41,249 WARN L234 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 66 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:49:51,575 WARN L234 SmtUtils]: Spent 10.24s on a formula simplification. DAG size of input: 66 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:50:04,145 WARN L234 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:50:05,918 INFO L124 PetriNetUnfolderBase]: 13819/23092 cut-off events. [2023-08-26 10:50:05,918 INFO L125 PetriNetUnfolderBase]: For 24799/24799 co-relation queries the response was YES. [2023-08-26 10:50:06,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69246 conditions, 23092 events. 13819/23092 cut-off events. For 24799/24799 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 166803 event pairs, 1159 based on Foata normal form. 984/23948 useless extension candidates. Maximal degree in co-relation 69232. Up to 4878 conditions per place. [2023-08-26 10:50:06,069 INFO L140 encePairwiseOnDemand]: 430/447 looper letters, 958 selfloop transitions, 286 changer transitions 147/1394 dead transitions. [2023-08-26 10:50:06,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1394 transitions, 7778 flow [2023-08-26 10:50:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-08-26 10:50:06,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2023-08-26 10:50:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 14191 transitions. [2023-08-26 10:50:06,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26904409813066393 [2023-08-26 10:50:06,103 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 14191 transitions. [2023-08-26 10:50:06,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 14191 transitions. [2023-08-26 10:50:06,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:06,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 14191 transitions. [2023-08-26 10:50:06,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 119 states, 118 states have (on average 120.26271186440678) internal successors, (14191), 118 states have internal predecessors, (14191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:06,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 119 states, 119 states have (on average 447.0) internal successors, (53193), 119 states have internal predecessors, (53193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:06,224 INFO L81 ComplementDD]: Finished complementDD. Result has 119 states, 119 states have (on average 447.0) internal successors, (53193), 119 states have internal predecessors, (53193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:06,224 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 178 flow. Second operand 118 states and 14191 transitions. [2023-08-26 10:50:06,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1394 transitions, 7778 flow [2023-08-26 10:50:06,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1394 transitions, 7502 flow, removed 137 selfloop flow, removed 3 redundant places. [2023-08-26 10:50:06,279 INFO L231 Difference]: Finished difference. Result has 243 places, 379 transitions, 3233 flow [2023-08-26 10:50:06,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=3233, PETRI_PLACES=243, PETRI_TRANSITIONS=379} [2023-08-26 10:50:06,280 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 155 predicate places. [2023-08-26 10:50:06,281 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 379 transitions, 3233 flow [2023-08-26 10:50:06,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 111.23529411764706) internal successors, (3782), 34 states have internal predecessors, (3782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:06,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:06,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:06,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 10:50:06,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-26 10:50:06,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:06,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1231415281, now seen corresponding path program 2 times [2023-08-26 10:50:06,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:06,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843529046] [2023-08-26 10:50:06,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:06,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843529046] [2023-08-26 10:50:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843529046] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774940663] [2023-08-26 10:50:07,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:50:07,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:07,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:07,915 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:50:07,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 10:50:08,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:50:08,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:50:08,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-26 10:50:08,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:08,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:50:08,413 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-26 10:50:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:08,544 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:08,803 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_555 (Array Int Int))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_555) c_~queue~0.base) .cse0) c_~sum~0) 1)) (forall ((v_ArrVal_555 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_555) c_~queue~0.base) .cse0) c_~sum~0)))))) is different from false [2023-08-26 10:50:08,835 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:08,836 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 110 treesize of output 86 [2023-08-26 10:50:08,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-08-26 10:50:08,852 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-08-26 10:50:09,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:09,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774940663] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:09,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:09,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2023-08-26 10:50:09,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938297702] [2023-08-26 10:50:09,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 10:50:09,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:09,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 10:50:09,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=664, Unknown=1, NotChecked=52, Total=812 [2023-08-26 10:50:09,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 447 [2023-08-26 10:50:09,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 379 transitions, 3233 flow. Second operand has 29 states, 29 states have (on average 129.48275862068965) internal successors, (3755), 29 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:09,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:09,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 447 [2023-08-26 10:50:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:15,452 INFO L124 PetriNetUnfolderBase]: 3939/7359 cut-off events. [2023-08-26 10:50:15,452 INFO L125 PetriNetUnfolderBase]: For 145412/145509 co-relation queries the response was YES. [2023-08-26 10:50:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40900 conditions, 7359 events. 3939/7359 cut-off events. For 145412/145509 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 50417 event pairs, 457 based on Foata normal form. 297/7596 useless extension candidates. Maximal degree in co-relation 40820. Up to 2133 conditions per place. [2023-08-26 10:50:15,532 INFO L140 encePairwiseOnDemand]: 428/447 looper letters, 326 selfloop transitions, 182 changer transitions 164/683 dead transitions. [2023-08-26 10:50:15,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 683 transitions, 7829 flow [2023-08-26 10:50:15,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-26 10:50:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-26 10:50:15,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5223 transitions. [2023-08-26 10:50:15,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.299604198933058 [2023-08-26 10:50:15,539 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 5223 transitions. [2023-08-26 10:50:15,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 5223 transitions. [2023-08-26 10:50:15,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:15,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 5223 transitions. [2023-08-26 10:50:15,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 133.92307692307693) internal successors, (5223), 39 states have internal predecessors, (5223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:15,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 447.0) internal successors, (17880), 40 states have internal predecessors, (17880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:15,568 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 447.0) internal successors, (17880), 40 states have internal predecessors, (17880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:15,568 INFO L175 Difference]: Start difference. First operand has 243 places, 379 transitions, 3233 flow. Second operand 39 states and 5223 transitions. [2023-08-26 10:50:15,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 683 transitions, 7829 flow [2023-08-26 10:50:16,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 683 transitions, 6977 flow, removed 389 selfloop flow, removed 19 redundant places. [2023-08-26 10:50:16,093 INFO L231 Difference]: Finished difference. Result has 259 places, 322 transitions, 2992 flow [2023-08-26 10:50:16,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2461, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=2992, PETRI_PLACES=259, PETRI_TRANSITIONS=322} [2023-08-26 10:50:16,093 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 171 predicate places. [2023-08-26 10:50:16,094 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 322 transitions, 2992 flow [2023-08-26 10:50:16,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 129.48275862068965) internal successors, (3755), 29 states have internal predecessors, (3755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:16,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:16,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:16,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 10:50:16,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-26 10:50:16,303 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:16,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:16,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1440320516, now seen corresponding path program 3 times [2023-08-26 10:50:16,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:16,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028909663] [2023-08-26 10:50:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:16,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:18,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:18,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028909663] [2023-08-26 10:50:18,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028909663] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:18,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784269128] [2023-08-26 10:50:18,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:50:18,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:18,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:18,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:50:18,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 10:50:18,227 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 10:50:18,227 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:50:18,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 10:50:18,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:18,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:18,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:18,643 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:18,643 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 68 treesize of output 44 [2023-08-26 10:50:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:50:19,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784269128] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:19,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 27 [2023-08-26 10:50:19,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995567646] [2023-08-26 10:50:19,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:19,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-26 10:50:19,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:19,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-26 10:50:19,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2023-08-26 10:50:19,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-26 10:50:19,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 322 transitions, 2992 flow. Second operand has 28 states, 28 states have (on average 139.5) internal successors, (3906), 28 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:19,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:19,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-26 10:50:19,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:22,519 INFO L124 PetriNetUnfolderBase]: 4943/9222 cut-off events. [2023-08-26 10:50:22,519 INFO L125 PetriNetUnfolderBase]: For 180235/180310 co-relation queries the response was YES. [2023-08-26 10:50:22,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58390 conditions, 9222 events. 4943/9222 cut-off events. For 180235/180310 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 66025 event pairs, 528 based on Foata normal form. 137/9313 useless extension candidates. Maximal degree in co-relation 58314. Up to 2000 conditions per place. [2023-08-26 10:50:22,621 INFO L140 encePairwiseOnDemand]: 434/447 looper letters, 449 selfloop transitions, 236 changer transitions 36/732 dead transitions. [2023-08-26 10:50:22,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 732 transitions, 9654 flow [2023-08-26 10:50:22,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-26 10:50:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-26 10:50:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4765 transitions. [2023-08-26 10:50:22,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.323028947190021 [2023-08-26 10:50:22,628 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4765 transitions. [2023-08-26 10:50:22,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4765 transitions. [2023-08-26 10:50:22,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:22,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4765 transitions. [2023-08-26 10:50:22,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 144.3939393939394) internal successors, (4765), 33 states have internal predecessors, (4765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:22,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 447.0) internal successors, (15198), 34 states have internal predecessors, (15198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:22,746 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 447.0) internal successors, (15198), 34 states have internal predecessors, (15198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:22,746 INFO L175 Difference]: Start difference. First operand has 259 places, 322 transitions, 2992 flow. Second operand 33 states and 4765 transitions. [2023-08-26 10:50:22,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 732 transitions, 9654 flow [2023-08-26 10:50:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 732 transitions, 8561 flow, removed 341 selfloop flow, removed 26 redundant places. [2023-08-26 10:50:23,126 INFO L231 Difference]: Finished difference. Result has 255 places, 434 transitions, 4692 flow [2023-08-26 10:50:23,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4692, PETRI_PLACES=255, PETRI_TRANSITIONS=434} [2023-08-26 10:50:23,127 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 167 predicate places. [2023-08-26 10:50:23,127 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 434 transitions, 4692 flow [2023-08-26 10:50:23,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 139.5) internal successors, (3906), 28 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:23,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:23,128 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:23,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 10:50:23,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:23,334 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:23,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:23,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1442815562, now seen corresponding path program 4 times [2023-08-26 10:50:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:23,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936304742] [2023-08-26 10:50:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:25,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936304742] [2023-08-26 10:50:25,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936304742] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:25,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424615113] [2023-08-26 10:50:25,464 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 10:50:25,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:25,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:50:25,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 10:50:25,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 10:50:25,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:50:25,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-26 10:50:25,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:26,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:50:26,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-26 10:50:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:50:26,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:26,483 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:26,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 110 treesize of output 86 [2023-08-26 10:50:26,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2023-08-26 10:50:26,494 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2023-08-26 10:50:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:50:26,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424615113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:26,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:26,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 10] total 32 [2023-08-26 10:50:26,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380489713] [2023-08-26 10:50:26,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:26,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-26 10:50:26,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:26,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-26 10:50:26,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=930, Unknown=9, NotChecked=0, Total=1056 [2023-08-26 10:50:26,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 447 [2023-08-26 10:50:26,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 434 transitions, 4692 flow. Second operand has 33 states, 33 states have (on average 111.3030303030303) internal successors, (3673), 33 states have internal predecessors, (3673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:26,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:26,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 447 [2023-08-26 10:50:26,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:34,988 INFO L124 PetriNetUnfolderBase]: 13477/22381 cut-off events. [2023-08-26 10:50:34,989 INFO L125 PetriNetUnfolderBase]: For 303190/303307 co-relation queries the response was YES. [2023-08-26 10:50:35,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132006 conditions, 22381 events. 13477/22381 cut-off events. For 303190/303307 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 161348 event pairs, 1553 based on Foata normal form. 304/22548 useless extension candidates. Maximal degree in co-relation 131932. Up to 7095 conditions per place. [2023-08-26 10:50:35,282 INFO L140 encePairwiseOnDemand]: 433/447 looper letters, 480 selfloop transitions, 251 changer transitions 43/777 dead transitions. [2023-08-26 10:50:35,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 777 transitions, 9725 flow [2023-08-26 10:50:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-26 10:50:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-26 10:50:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3461 transitions. [2023-08-26 10:50:35,290 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26699066574095504 [2023-08-26 10:50:35,290 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3461 transitions. [2023-08-26 10:50:35,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3461 transitions. [2023-08-26 10:50:35,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:35,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3461 transitions. [2023-08-26 10:50:35,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 119.34482758620689) internal successors, (3461), 29 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:35,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 447.0) internal successors, (13410), 30 states have internal predecessors, (13410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:35,307 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 447.0) internal successors, (13410), 30 states have internal predecessors, (13410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:35,307 INFO L175 Difference]: Start difference. First operand has 255 places, 434 transitions, 4692 flow. Second operand 29 states and 3461 transitions. [2023-08-26 10:50:35,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 777 transitions, 9725 flow [2023-08-26 10:50:37,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 777 transitions, 9354 flow, removed 142 selfloop flow, removed 5 redundant places. [2023-08-26 10:50:37,192 INFO L231 Difference]: Finished difference. Result has 284 places, 460 transitions, 5474 flow [2023-08-26 10:50:37,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=4395, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5474, PETRI_PLACES=284, PETRI_TRANSITIONS=460} [2023-08-26 10:50:37,193 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 196 predicate places. [2023-08-26 10:50:37,193 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 460 transitions, 5474 flow [2023-08-26 10:50:37,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 111.3030303030303) internal successors, (3673), 33 states have internal predecessors, (3673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:37,194 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:37,194 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:37,200 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-26 10:50:37,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:37,395 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:37,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:37,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1468917098, now seen corresponding path program 5 times [2023-08-26 10:50:37,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:37,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939147341] [2023-08-26 10:50:37,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:37,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939147341] [2023-08-26 10:50:37,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939147341] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:37,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653155062] [2023-08-26 10:50:37,525 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 10:50:37,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:37,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-26 10:50:37,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 10:50:38,055 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-26 10:50:38,055 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:50:38,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-26 10:50:38,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:38,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:38,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:38,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653155062] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:38,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:38,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 10:50:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191480401] [2023-08-26 10:50:38,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:38,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 10:50:38,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 10:50:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-26 10:50:38,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 447 [2023-08-26 10:50:38,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 460 transitions, 5474 flow. Second operand has 11 states, 11 states have (on average 165.45454545454547) internal successors, (1820), 11 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:38,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:38,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 447 [2023-08-26 10:50:38,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:39,617 INFO L124 PetriNetUnfolderBase]: 3478/6913 cut-off events. [2023-08-26 10:50:39,617 INFO L125 PetriNetUnfolderBase]: For 134396/134502 co-relation queries the response was YES. [2023-08-26 10:50:39,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46236 conditions, 6913 events. 3478/6913 cut-off events. For 134396/134502 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 50089 event pairs, 1494 based on Foata normal form. 369/7185 useless extension candidates. Maximal degree in co-relation 46157. Up to 3276 conditions per place. [2023-08-26 10:50:39,684 INFO L140 encePairwiseOnDemand]: 443/447 looper letters, 234 selfloop transitions, 3 changer transitions 132/380 dead transitions. [2023-08-26 10:50:39,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 380 transitions, 5366 flow [2023-08-26 10:50:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 10:50:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 10:50:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1026 transitions. [2023-08-26 10:50:39,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825503355704698 [2023-08-26 10:50:39,687 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1026 transitions. [2023-08-26 10:50:39,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1026 transitions. [2023-08-26 10:50:39,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:39,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1026 transitions. [2023-08-26 10:50:39,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:39,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:39,691 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 447.0) internal successors, (3129), 7 states have internal predecessors, (3129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:39,691 INFO L175 Difference]: Start difference. First operand has 284 places, 460 transitions, 5474 flow. Second operand 6 states and 1026 transitions. [2023-08-26 10:50:39,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 380 transitions, 5366 flow [2023-08-26 10:50:40,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 380 transitions, 5015 flow, removed 68 selfloop flow, removed 27 redundant places. [2023-08-26 10:50:40,052 INFO L231 Difference]: Finished difference. Result has 245 places, 248 transitions, 2807 flow [2023-08-26 10:50:40,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=4013, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2807, PETRI_PLACES=245, PETRI_TRANSITIONS=248} [2023-08-26 10:50:40,052 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 157 predicate places. [2023-08-26 10:50:40,052 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 248 transitions, 2807 flow [2023-08-26 10:50:40,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 165.45454545454547) internal successors, (1820), 11 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:40,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:40,053 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:40,058 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-26 10:50:40,253 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,SelfDestructingSolverStorable14 [2023-08-26 10:50:40,253 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:40,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -82820269, now seen corresponding path program 6 times [2023-08-26 10:50:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:40,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350824190] [2023-08-26 10:50:40,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:40,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:50:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350824190] [2023-08-26 10:50:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350824190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 10:50:40,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 10:50:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 10:50:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985032411] [2023-08-26 10:50:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 10:50:40,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 10:50:40,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:40,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 10:50:40,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 10:50:40,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 447 [2023-08-26 10:50:40,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 248 transitions, 2807 flow. Second operand has 4 states, 4 states have (on average 188.25) internal successors, (753), 4 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:40,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:40,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 447 [2023-08-26 10:50:40,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:50:41,576 INFO L124 PetriNetUnfolderBase]: 3629/7396 cut-off events. [2023-08-26 10:50:41,576 INFO L125 PetriNetUnfolderBase]: For 125732/125759 co-relation queries the response was YES. [2023-08-26 10:50:41,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47006 conditions, 7396 events. 3629/7396 cut-off events. For 125732/125759 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 51727 event pairs, 850 based on Foata normal form. 199/7508 useless extension candidates. Maximal degree in co-relation 46933. Up to 2854 conditions per place. [2023-08-26 10:50:41,691 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 348 selfloop transitions, 87 changer transitions 0/446 dead transitions. [2023-08-26 10:50:41,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 446 transitions, 6151 flow [2023-08-26 10:50:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 10:50:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 10:50:41,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2023-08-26 10:50:41,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423937360178971 [2023-08-26 10:50:41,693 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2023-08-26 10:50:41,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2023-08-26 10:50:41,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:50:41,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2023-08-26 10:50:41,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:41,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 447.0) internal successors, (2235), 5 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:41,697 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 447.0) internal successors, (2235), 5 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:41,697 INFO L175 Difference]: Start difference. First operand has 245 places, 248 transitions, 2807 flow. Second operand 4 states and 791 transitions. [2023-08-26 10:50:41,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 446 transitions, 6151 flow [2023-08-26 10:50:42,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 446 transitions, 5881 flow, removed 76 selfloop flow, removed 25 redundant places. [2023-08-26 10:50:42,086 INFO L231 Difference]: Finished difference. Result has 178 places, 319 transitions, 4296 flow [2023-08-26 10:50:42,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2659, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4296, PETRI_PLACES=178, PETRI_TRANSITIONS=319} [2023-08-26 10:50:42,087 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 90 predicate places. [2023-08-26 10:50:42,087 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 319 transitions, 4296 flow [2023-08-26 10:50:42,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 188.25) internal successors, (753), 4 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:42,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:50:42,088 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:50:42,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 10:50:42,088 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:50:42,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:50:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash 182920890, now seen corresponding path program 7 times [2023-08-26 10:50:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:50:42,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902660002] [2023-08-26 10:50:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:50:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:50:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:50:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902660002] [2023-08-26 10:50:43,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902660002] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:50:43,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647396036] [2023-08-26 10:50:43,493 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-26 10:50:43,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:50:43,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:50:43,494 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:50:43,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 10:50:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:50:43,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-26 10:50:43,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:50:44,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:44,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:50:45,010 INFO L322 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-08-26 10:50:45,011 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 254 treesize of output 200 [2023-08-26 10:50:45,032 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:50:45,032 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 135 [2023-08-26 10:50:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:50:46,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647396036] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:50:46,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:50:46,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 38 [2023-08-26 10:50:46,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879198670] [2023-08-26 10:50:46,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:50:46,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-26 10:50:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:50:46,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-26 10:50:46,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1228, Unknown=0, NotChecked=0, Total=1482 [2023-08-26 10:50:46,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-26 10:50:46,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 319 transitions, 4296 flow. Second operand has 39 states, 39 states have (on average 139.35897435897436) internal successors, (5435), 39 states have internal predecessors, (5435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:50:46,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:50:46,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-26 10:50:46,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:11,209 INFO L124 PetriNetUnfolderBase]: 18701/36188 cut-off events. [2023-08-26 10:51:11,209 INFO L125 PetriNetUnfolderBase]: For 377507/377695 co-relation queries the response was YES. [2023-08-26 10:51:11,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217117 conditions, 36188 events. 18701/36188 cut-off events. For 377507/377695 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 315861 event pairs, 1356 based on Foata normal form. 946/36890 useless extension candidates. Maximal degree in co-relation 217063. Up to 9379 conditions per place. [2023-08-26 10:51:11,637 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 1179 selfloop transitions, 1217 changer transitions 275/2682 dead transitions. [2023-08-26 10:51:11,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 2682 transitions, 38235 flow [2023-08-26 10:51:11,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2023-08-26 10:51:11,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2023-08-26 10:51:11,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 27451 transitions. [2023-08-26 10:51:11,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3232191216295773 [2023-08-26 10:51:11,669 INFO L72 ComplementDD]: Start complementDD. Operand 190 states and 27451 transitions. [2023-08-26 10:51:11,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 190 states and 27451 transitions. [2023-08-26 10:51:11,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:11,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 190 states and 27451 transitions. [2023-08-26 10:51:11,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 191 states, 190 states have (on average 144.47894736842105) internal successors, (27451), 190 states have internal predecessors, (27451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:11,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 191 states, 191 states have (on average 447.0) internal successors, (85377), 191 states have internal predecessors, (85377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:11,800 INFO L81 ComplementDD]: Finished complementDD. Result has 191 states, 191 states have (on average 447.0) internal successors, (85377), 191 states have internal predecessors, (85377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:11,800 INFO L175 Difference]: Start difference. First operand has 178 places, 319 transitions, 4296 flow. Second operand 190 states and 27451 transitions. [2023-08-26 10:51:11,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 2682 transitions, 38235 flow [2023-08-26 10:51:13,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 2682 transitions, 38067 flow, removed 84 selfloop flow, removed 0 redundant places. [2023-08-26 10:51:13,210 INFO L231 Difference]: Finished difference. Result has 433 places, 1463 transitions, 25333 flow [2023-08-26 10:51:13,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=4222, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=190, PETRI_FLOW=25333, PETRI_PLACES=433, PETRI_TRANSITIONS=1463} [2023-08-26 10:51:13,211 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 345 predicate places. [2023-08-26 10:51:13,211 INFO L495 AbstractCegarLoop]: Abstraction has has 433 places, 1463 transitions, 25333 flow [2023-08-26 10:51:13,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 139.35897435897436) internal successors, (5435), 39 states have internal predecessors, (5435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:13,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:13,212 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:51:13,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 10:51:13,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 10:51:13,418 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:51:13,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 464926794, now seen corresponding path program 8 times [2023-08-26 10:51:13,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:13,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139331872] [2023-08-26 10:51:13,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:13,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:51:14,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139331872] [2023-08-26 10:51:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139331872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:51:14,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537741448] [2023-08-26 10:51:14,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 10:51:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:51:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:51:14,713 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:51:14,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 10:51:14,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 10:51:14,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:51:14,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-26 10:51:14,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:51:15,128 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 10:51:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 10:51:15,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:51:15,846 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-26 10:51:15,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 254 treesize of output 208 [2023-08-26 10:51:15,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:51:15,859 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 135 [2023-08-26 10:51:16,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-26 10:51:16,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537741448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:51:16,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:51:16,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 31 [2023-08-26 10:51:16,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241499410] [2023-08-26 10:51:16,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:51:16,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-26 10:51:16,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:51:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-26 10:51:16,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2023-08-26 10:51:16,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-26 10:51:16,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 1463 transitions, 25333 flow. Second operand has 32 states, 32 states have (on average 139.96875) internal successors, (4479), 32 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:16,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:51:16,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-26 10:51:16,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:51:43,793 INFO L124 PetriNetUnfolderBase]: 26326/51650 cut-off events. [2023-08-26 10:51:43,793 INFO L125 PetriNetUnfolderBase]: For 2553798/2554638 co-relation queries the response was YES. [2023-08-26 10:51:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419005 conditions, 51650 events. 26326/51650 cut-off events. For 2553798/2554638 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 468009 event pairs, 4088 based on Foata normal form. 1089/52557 useless extension candidates. Maximal degree in co-relation 418884. Up to 12812 conditions per place. [2023-08-26 10:51:45,234 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 1270 selfloop transitions, 1516 changer transitions 603/3400 dead transitions. [2023-08-26 10:51:45,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 3400 transitions, 67097 flow [2023-08-26 10:51:45,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-08-26 10:51:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2023-08-26 10:51:45,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 15155 transitions. [2023-08-26 10:51:45,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32289336316181955 [2023-08-26 10:51:45,252 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 15155 transitions. [2023-08-26 10:51:45,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 15155 transitions. [2023-08-26 10:51:45,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 10:51:45,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 15155 transitions. [2023-08-26 10:51:45,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 144.33333333333334) internal successors, (15155), 105 states have internal predecessors, (15155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:45,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 447.0) internal successors, (47382), 106 states have internal predecessors, (47382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:45,327 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 447.0) internal successors, (47382), 106 states have internal predecessors, (47382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:45,327 INFO L175 Difference]: Start difference. First operand has 433 places, 1463 transitions, 25333 flow. Second operand 105 states and 15155 transitions. [2023-08-26 10:51:45,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 3400 transitions, 67097 flow [2023-08-26 10:51:57,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 3400 transitions, 55550 flow, removed 4682 selfloop flow, removed 31 redundant places. [2023-08-26 10:51:57,900 INFO L231 Difference]: Finished difference. Result has 528 places, 2102 transitions, 37376 flow [2023-08-26 10:51:57,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=19380, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=746, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=37376, PETRI_PLACES=528, PETRI_TRANSITIONS=2102} [2023-08-26 10:51:57,902 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 440 predicate places. [2023-08-26 10:51:57,902 INFO L495 AbstractCegarLoop]: Abstraction has has 528 places, 2102 transitions, 37376 flow [2023-08-26 10:51:57,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 139.96875) internal successors, (4479), 32 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:51:57,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 10:51:57,903 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 10:51:57,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 10:51:58,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:51:58,104 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONASSERT === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2023-08-26 10:51:58,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 10:51:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash -949160128, now seen corresponding path program 9 times [2023-08-26 10:51:58,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 10:51:58,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353671113] [2023-08-26 10:51:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 10:51:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 10:51:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 10:51:59,629 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:51:59,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 10:51:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353671113] [2023-08-26 10:51:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353671113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 10:51:59,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107107959] [2023-08-26 10:51:59,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 10:51:59,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 10:51:59,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 10:51:59,631 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 10:51:59,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 10:52:00,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 10:52:00,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 10:52:00,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-26 10:52:00,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 10:52:00,378 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-26 10:52:00,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 10:52:00,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 10:52:00,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 10:52:00,937 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 33 treesize of output 33 [2023-08-26 10:52:00,986 INFO L322 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2023-08-26 10:52:00,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 17 [2023-08-26 10:52:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 10:52:01,052 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 10:52:01,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:52:01,360 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 167 [2023-08-26 10:52:01,401 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2023-08-26 10:52:01,450 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) is different from false [2023-08-26 10:52:04,626 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:52:04,626 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 167 [2023-08-26 10:52:07,927 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:52:07,928 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 89 [2023-08-26 10:52:07,985 INFO L322 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2023-08-26 10:52:07,986 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15042 treesize of output 13498 [2023-08-26 10:52:08,023 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 10:52:08,025 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 10:52:08,042 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:52:08,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 229 treesize of output 224 [2023-08-26 10:52:08,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 154 [2023-08-26 10:52:08,111 INFO L322 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2023-08-26 10:52:08,111 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 185 [2023-08-26 10:52:09,722 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-26 10:52:09,723 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 89 [2023-08-26 10:52:09,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-26 10:52:09,750 INFO L322 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2023-08-26 10:52:09,751 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 610 treesize of output 537 [2023-08-26 10:52:09,781 INFO L322 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2023-08-26 10:52:09,782 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 229 treesize of output 187 [2023-08-26 10:52:09,818 INFO L322 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2023-08-26 10:52:09,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 135 [2023-08-26 10:52:10,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2023-08-26 10:52:10,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107107959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 10:52:10,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 10:52:10,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 44 [2023-08-26 10:52:10,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001962381] [2023-08-26 10:52:10,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 10:52:10,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-26 10:52:10,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 10:52:10,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-26 10:52:10,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1529, Unknown=15, NotChecked=166, Total=1980 [2023-08-26 10:52:10,226 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 447 [2023-08-26 10:52:10,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 2102 transitions, 37376 flow. Second operand has 45 states, 45 states have (on average 111.17777777777778) internal successors, (5003), 45 states have internal predecessors, (5003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 10:52:10,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 10:52:10,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 447 [2023-08-26 10:52:10,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 10:52:24,564 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (or (let ((.cse9 (* c_~back~0 4))) (let ((.cse3 (+ c_~front~0 1)) (.cse4 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse6 (+ c_~back~0 2)) (.cse1 (+ c_~queue~0.offset .cse9)) (.cse2 (+ c_~queue~0.offset .cse9 4))) (and (forall ((v_ArrVal_1472 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse0 (select .cse5 c_~queue~0.base))) (or (not (= (select .cse0 .cse1) 1)) (not (= (+ 1 (select .cse0 .cse2)) 0)) (forall ((v_~front~0_269 Int)) (or (< v_~front~0_269 .cse3) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select .cse0 .cse4) (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))))) (<= .cse6 v_~front~0_269))))))) (forall ((v_ArrVal_1472 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse7 (select .cse8 c_~queue~0.base))) (or (forall ((v_~front~0_269 Int)) (or (< v_~front~0_269 .cse3) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select .cse7 .cse4) (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))) 1)) (<= .cse6 v_~front~0_269))) (not (= (select .cse7 .cse1) 1)) (not (= (+ 1 (select .cse7 .cse2)) 0))))))))) (= (mod c_~v_assert~0 256) 0) (<= c_~n~0 (+ c_~back~0 1)) (< c_~front~0 0)) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0)) is different from false [2023-08-26 10:52:42,256 WARN L234 SmtUtils]: Spent 5.63s on a formula simplification. DAG size of input: 122 DAG size of output: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:49,753 WARN L234 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 124 DAG size of output: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:52:50,673 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) (<= 1 c_~v_assert~0)) is different from false [2023-08-26 10:53:04,198 WARN L234 SmtUtils]: Spent 8.74s on a formula simplification. DAG size of input: 151 DAG size of output: 142 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:53:14,925 WARN L234 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 139 DAG size of output: 130 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:53:20,113 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-26 10:53:21,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:53:23,131 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-26 10:53:23,135 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 c_~v_assert~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-26 10:53:28,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:53:41,741 WARN L234 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 151 DAG size of output: 142 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:53:45,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-26 10:54:25,291 WARN L234 SmtUtils]: Spent 6.60s on a formula simplification. DAG size of input: 100 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:54:28,555 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) (<= c_~sum~0 1)) is different from false [2023-08-26 10:55:00,444 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 32 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:55:08,679 WARN L234 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 135 DAG size of output: 133 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:55:42,522 WARN L234 SmtUtils]: Spent 10.48s on a formula simplification. DAG size of input: 94 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 10:55:55,593 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse13 (* c_~back~0 4))) (let ((.cse10 (select .cse12 (+ c_~queue~0.offset .cse13))) (.cse11 (+ c_~back~0 1)) (.cse7 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (let ((.cse15 (+ c_~front~0 1)) (.cse14 (select .cse12 .cse7)) (.cse16 (+ c_~back~0 2))) (and (forall ((v_~front~0_269 Int)) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))))) (< v_~front~0_269 .cse15) (<= .cse16 v_~front~0_269))) (forall ((v_~front~0_269 Int)) (or (< v_~front~0_269 .cse15) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))) 1)) (<= .cse16 v_~front~0_269)))))) (.cse2 (not (= (+ (select .cse12 (+ c_~queue~0.offset .cse13 4)) 1) 0))) (.cse3 (<= c_~n~0 .cse11)) (.cse4 (< c_~front~0 0)) (.cse5 (not (= .cse10 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (or .cse0 .cse3 .cse4 (let ((.cse6 (< c_~back~0 c_~front~0))) (and (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or .cse6 (<= c_~sum~0 1)) (or .cse6 (= c_~back~0 c_~front~0)) (or .cse6 (<= 0 c_~sum~0)))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse7)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse7))))) (<= c_~n~0 c_~back~0) (let ((.cse8 (<= .cse11 c_~front~0)) (.cse9 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or .cse8 (not .cse9) (not (= (+ .cse10 1) 0))) (or .cse8 .cse9 .cse5)))) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse1 .cse2 .cse3 .cse4 .cse5))))) is different from false [2023-08-26 10:56:01,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_~queue~0.base)) (.cse13 (* c_~back~0 4))) (let ((.cse10 (select .cse12 (+ c_~queue~0.offset .cse13))) (.cse11 (+ c_~back~0 1)) (.cse7 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (= (mod c_~v_assert~0 256) 0)) (.cse1 (let ((.cse15 (+ c_~front~0 1)) (.cse14 (select .cse12 .cse7)) (.cse16 (+ c_~back~0 2))) (and (forall ((v_~front~0_269 Int)) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))))) (< v_~front~0_269 .cse15) (<= .cse16 v_~front~0_269))) (forall ((v_~front~0_269 Int)) (or (< v_~front~0_269 .cse15) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 .cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))) 1)) (<= .cse16 v_~front~0_269)))))) (.cse2 (not (= (+ (select .cse12 (+ c_~queue~0.offset .cse13 4)) 1) 0))) (.cse3 (<= c_~n~0 .cse11)) (.cse4 (< c_~front~0 0)) (.cse5 (not (= .cse10 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse4 (let ((.cse6 (< c_~back~0 c_~front~0))) (and (or .cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or .cse6 (<= c_~sum~0 1)) (or .cse6 (= c_~back~0 c_~front~0)) (or .cse6 (<= 0 c_~sum~0)))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse7)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse7))))) (<= c_~n~0 c_~back~0) (let ((.cse8 (<= .cse11 c_~front~0)) (.cse9 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0))) (and (or .cse8 (not .cse9) (not (= (+ .cse10 1) 0))) (or .cse8 .cse9 .cse5)))) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) .cse1 .cse2 .cse3 .cse4 .cse5))))) is different from false [2023-08-26 10:56:13,640 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (or (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0))))) (<= c_~back~0 c_~front~0)) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= c_~v_assert~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (<= 1 c_~v_assert~0) (or (<= c_~n~0 c_~back~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (let ((.cse4 (select |c_#memory_int| c_~queue~0.base))) (let ((.cse1 (let ((.cse6 (+ c_~front~0 1)) (.cse7 (+ c_~back~0 1)) (.cse5 (select .cse4 .cse0))) (and (forall ((v_~front~0_269 Int)) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))))) (< v_~front~0_269 .cse6) (<= .cse7 v_~front~0_269))) (forall ((v_~front~0_269 Int)) (or (< v_~front~0_269 .cse6) (<= .cse7 v_~front~0_269) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 .cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) (+ (* v_~front~0_269 4) c_~queue~0.offset))) 1))))))) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select .cse4 (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 .cse2 (not (= .cse3 1))) (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0)))))) (< c_~front~0 0)))) is different from false [2023-08-26 10:56:56,699 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (< 0 (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256)) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-26 10:56:56,798 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread1Thread1of1ForFork1_~cond~0#1|) (<= |c_thread1Thread1of1ForFork1_~cond~0#1| 1) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (<= c_~n~0 c_~back~0) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false [2023-08-26 10:57:29,136 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1)))))) (< 0 (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256))) is different from false [2023-08-26 10:57:37,487 WARN L839 $PredicateComparison]: unable to prove that (and (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (or (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base) .cse0)))))) (let ((.cse1 (<= (+ c_~back~0 1) c_~front~0)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse3 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or .cse1 (not .cse2) (not (= (+ .cse3 1) 0))) (or .cse1 .cse2 (not (= .cse3 1))))))) is different from false