/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:16:17,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:16:17,371 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 21:16:17,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:16:17,376 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:16:17,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:16:17,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:16:17,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:16:17,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:16:17,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:16:17,411 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:16:17,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:16:17,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:16:17,412 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:16:17,412 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:16:17,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:16:17,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:16:17,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:16:17,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:16:17,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:16:17,413 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:16:17,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:16:17,414 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:16:17,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:16:17,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:16:17,415 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:16:17,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:16:17,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:16:17,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:16:17,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:16:17,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:16:17,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:16:17,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:16:17,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:16:17,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:16:17,418 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:16:17,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:16:17,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:16:17,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:16:17,745 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:16:17,745 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:16:17,746 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-25 21:16:18,900 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:16:19,100 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:16:19,100 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-08-25 21:16:19,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb431d49/1a7ba20a5a9e4aabaee0ba6a18927ef6/FLAG98facfcb7 [2023-08-25 21:16:19,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfb431d49/1a7ba20a5a9e4aabaee0ba6a18927ef6 [2023-08-25 21:16:19,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:16:19,122 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:16:19,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:16:19,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:16:19,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:16:19,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bfcabe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19, skipping insertion in model container [2023-08-25 21:16:19,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,157 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:16:19,368 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:16:19,379 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:16:19,425 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:16:19,435 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:16:19,436 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:16:19,441 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:16:19,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19 WrapperNode [2023-08-25 21:16:19,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:16:19,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:16:19,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:16:19,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:16:19,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,511 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 300 [2023-08-25 21:16:19,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:16:19,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:16:19,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:16:19,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:16:19,524 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,563 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,567 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,568 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:16:19,573 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:16:19,573 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:16:19,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:16:19,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (1/1) ... [2023-08-25 21:16:19,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:16:19,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:16:19,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:16:19,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:16:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:16:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:16:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:16:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:16:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:16:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:16:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:16:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:16:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 21:16:19,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 21:16:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:16:19,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 21:16:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 21:16:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:16:19,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:16:19,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:16:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:16:19,650 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:16:19,770 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:16:19,772 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:16:20,127 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:16:20,442 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:16:20,442 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-25 21:16:20,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:16:20 BoogieIcfgContainer [2023-08-25 21:16:20,445 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:16:20,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:16:20,448 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:16:20,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:16:20,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:16:19" (1/3) ... [2023-08-25 21:16:20,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:16:20, skipping insertion in model container [2023-08-25 21:16:20,451 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:16:19" (2/3) ... [2023-08-25 21:16:20,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ff4e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:16:20, skipping insertion in model container [2023-08-25 21:16:20,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:16:20" (3/3) ... [2023-08-25 21:16:20,454 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-08-25 21:16:20,468 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:16:20,468 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-08-25 21:16:20,468 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:16:20,541 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 21:16:20,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 236 places, 237 transitions, 498 flow [2023-08-25 21:16:20,669 INFO L124 PetriNetUnfolderBase]: 11/234 cut-off events. [2023-08-25 21:16:20,669 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:16:20,678 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-25 21:16:20,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 236 places, 237 transitions, 498 flow [2023-08-25 21:16:20,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 223 transitions, 464 flow [2023-08-25 21:16:20,686 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:16:20,694 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 222 places, 223 transitions, 464 flow [2023-08-25 21:16:20,696 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 222 places, 223 transitions, 464 flow [2023-08-25 21:16:20,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 223 transitions, 464 flow [2023-08-25 21:16:20,761 INFO L124 PetriNetUnfolderBase]: 11/223 cut-off events. [2023-08-25 21:16:20,761 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:16:20,764 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-25 21:16:20,768 INFO L119 LiptonReduction]: Number of co-enabled transitions 6192 [2023-08-25 21:16:27,938 INFO L134 LiptonReduction]: Checked pairs total: 23802 [2023-08-25 21:16:27,938 INFO L136 LiptonReduction]: Total number of compositions: 210 [2023-08-25 21:16:27,950 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:16:27,955 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;@2f38dbf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:16:27,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2023-08-25 21:16:27,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:16:27,957 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:16:27,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:16:27,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:27,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:16:27,958 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-25 21:16:27,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:27,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1203, now seen corresponding path program 1 times [2023-08-25 21:16:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:27,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581677662] [2023-08-25 21:16:27,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:27,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:28,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:28,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581677662] [2023-08-25 21:16:28,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581677662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:28,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:28,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:16:28,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768946153] [2023-08-25 21:16:28,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:28,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:16:28,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:28,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:16:28,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:16:28,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 447 [2023-08-25 21:16:28,074 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-25 21:16:28,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:28,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 447 [2023-08-25 21:16:28,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:28,268 INFO L124 PetriNetUnfolderBase]: 390/894 cut-off events. [2023-08-25 21:16:28,268 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-08-25 21:16:28,272 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-25 21:16:28,277 INFO L140 encePairwiseOnDemand]: 408/447 looper letters, 27 selfloop transitions, 0 changer transitions 0/43 dead transitions. [2023-08-25 21:16:28,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 158 flow [2023-08-25 21:16:28,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:16:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:16:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 440 transitions. [2023-08-25 21:16:28,295 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49217002237136465 [2023-08-25 21:16:28,296 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 440 transitions. [2023-08-25 21:16:28,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 440 transitions. [2023-08-25 21:16:28,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:28,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 440 transitions. [2023-08-25 21:16:28,305 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-25 21:16:28,309 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-25 21:16:28,310 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-25 21:16:28,312 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 182 flow. Second operand 2 states and 440 transitions. [2023-08-25 21:16:28,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 158 flow [2023-08-25 21:16:28,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 146 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:16:28,318 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 92 flow [2023-08-25 21:16:28,319 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-25 21:16:28,324 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -43 predicate places. [2023-08-25 21:16:28,325 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 92 flow [2023-08-25 21:16:28,325 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-25 21:16:28,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:28,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:28,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:16:28,326 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-25 21:16:28,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:28,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1975060709, now seen corresponding path program 1 times [2023-08-25 21:16:28,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:28,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789625335] [2023-08-25 21:16:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:28,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:28,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:28,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789625335] [2023-08-25 21:16:28,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789625335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:28,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:28,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:16:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180225430] [2023-08-25 21:16:28,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:16:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:28,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:16:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:16:28,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 447 [2023-08-25 21:16:28,456 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-25 21:16:28,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:28,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 447 [2023-08-25 21:16:28,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:28,680 INFO L124 PetriNetUnfolderBase]: 660/1267 cut-off events. [2023-08-25 21:16:28,680 INFO L125 PetriNetUnfolderBase]: For 30/110 co-relation queries the response was YES. [2023-08-25 21:16:28,681 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-25 21:16:28,686 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 46 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2023-08-25 21:16:28,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 61 transitions, 231 flow [2023-08-25 21:16:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:16:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:16:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2023-08-25 21:16:28,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.436241610738255 [2023-08-25 21:16:28,689 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 585 transitions. [2023-08-25 21:16:28,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 585 transitions. [2023-08-25 21:16:28,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:28,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 585 transitions. [2023-08-25 21:16:28,691 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-25 21:16:28,694 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-25 21:16:28,694 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-25 21:16:28,695 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 92 flow. Second operand 3 states and 585 transitions. [2023-08-25 21:16:28,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 61 transitions, 231 flow [2023-08-25 21:16:28,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 231 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:16:28,697 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 105 flow [2023-08-25 21:16:28,697 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-25 21:16:28,697 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -42 predicate places. [2023-08-25 21:16:28,698 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 105 flow [2023-08-25 21:16:28,698 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-25 21:16:28,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:28,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:28,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:16:28,699 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-25 21:16:28,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1572512489, now seen corresponding path program 1 times [2023-08-25 21:16:28,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:28,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135262208] [2023-08-25 21:16:28,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:28,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:29,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:29,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135262208] [2023-08-25 21:16:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135262208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:16:29,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516418897] [2023-08-25 21:16:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:29,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:16:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:16:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:16:29,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 447 [2023-08-25 21:16:29,134 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-25 21:16:29,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:29,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 447 [2023-08-25 21:16:29,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:29,562 INFO L124 PetriNetUnfolderBase]: 1497/2287 cut-off events. [2023-08-25 21:16:29,562 INFO L125 PetriNetUnfolderBase]: For 431/431 co-relation queries the response was YES. [2023-08-25 21:16:29,565 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-25 21:16:29,574 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 90 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2023-08-25 21:16:29,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 98 transitions, 455 flow [2023-08-25 21:16:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1027 transitions. [2023-08-25 21:16:29,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38292319164802385 [2023-08-25 21:16:29,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1027 transitions. [2023-08-25 21:16:29,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1027 transitions. [2023-08-25 21:16:29,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:29,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1027 transitions. [2023-08-25 21:16:29,580 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-25 21:16:29,585 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-25 21:16:29,586 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-25 21:16:29,586 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 105 flow. Second operand 6 states and 1027 transitions. [2023-08-25 21:16:29,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 98 transitions, 455 flow [2023-08-25 21:16:29,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 98 transitions, 440 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:16:29,591 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 108 flow [2023-08-25 21:16:29,592 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-25 21:16:29,593 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -39 predicate places. [2023-08-25 21:16:29,593 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 108 flow [2023-08-25 21:16:29,594 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-25 21:16:29,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:29,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:29,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:16:29,598 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-25 21:16:29,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1656528520, now seen corresponding path program 1 times [2023-08-25 21:16:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183780033] [2023-08-25 21:16:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:29,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183780033] [2023-08-25 21:16:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183780033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:29,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:16:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716416555] [2023-08-25 21:16:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:29,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:16:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:16:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:16:29,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 447 [2023-08-25 21:16:29,646 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-25 21:16:29,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:29,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 447 [2023-08-25 21:16:29,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:29,792 INFO L124 PetriNetUnfolderBase]: 606/1194 cut-off events. [2023-08-25 21:16:29,793 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-25 21:16:29,794 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-25 21:16:29,798 INFO L140 encePairwiseOnDemand]: 445/447 looper letters, 29 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-25 21:16:29,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 41 transitions, 166 flow [2023-08-25 21:16:29,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:16:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:16:29,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2023-08-25 21:16:29,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198359433258762 [2023-08-25 21:16:29,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 563 transitions. [2023-08-25 21:16:29,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions. [2023-08-25 21:16:29,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:29,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions. [2023-08-25 21:16:29,803 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-25 21:16:29,805 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-25 21:16:29,806 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-25 21:16:29,807 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 108 flow. Second operand 3 states and 563 transitions. [2023-08-25 21:16:29,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 41 transitions, 166 flow [2023-08-25 21:16:29,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 159 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:16:29,809 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 101 flow [2023-08-25 21:16:29,809 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-25 21:16:29,810 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -42 predicate places. [2023-08-25 21:16:29,810 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 101 flow [2023-08-25 21:16:29,811 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-25 21:16:29,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:29,811 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-25 21:16:29,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:16:29,811 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-25 21:16:29,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -684552344, now seen corresponding path program 1 times [2023-08-25 21:16:29,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:29,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122932968] [2023-08-25 21:16:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:29,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:29,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:29,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122932968] [2023-08-25 21:16:29,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122932968] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:29,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:29,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:16:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467952994] [2023-08-25 21:16:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:29,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:16:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:29,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:16:29,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:16:29,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 447 [2023-08-25 21:16:29,908 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-25 21:16:29,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:29,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 447 [2023-08-25 21:16:29,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:30,089 INFO L124 PetriNetUnfolderBase]: 464/831 cut-off events. [2023-08-25 21:16:30,089 INFO L125 PetriNetUnfolderBase]: For 77/139 co-relation queries the response was YES. [2023-08-25 21:16:30,091 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-25 21:16:30,094 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 62 selfloop transitions, 5 changer transitions 0/79 dead transitions. [2023-08-25 21:16:30,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 337 flow [2023-08-25 21:16:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:16:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:16:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 978 transitions. [2023-08-25 21:16:30,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375838926174497 [2023-08-25 21:16:30,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 978 transitions. [2023-08-25 21:16:30,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 978 transitions. [2023-08-25 21:16:30,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:30,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 978 transitions. [2023-08-25 21:16:30,101 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-25 21:16:30,105 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-25 21:16:30,106 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-25 21:16:30,106 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 101 flow. Second operand 5 states and 978 transitions. [2023-08-25 21:16:30,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 337 flow [2023-08-25 21:16:30,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 79 transitions, 333 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:16:30,108 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 128 flow [2023-08-25 21:16:30,108 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-25 21:16:30,109 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -37 predicate places. [2023-08-25 21:16:30,109 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 128 flow [2023-08-25 21:16:30,110 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-25 21:16:30,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:30,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:16:30,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:16:30,110 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-25 21:16:30,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 351198688, now seen corresponding path program 1 times [2023-08-25 21:16:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643625425] [2023-08-25 21:16:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643625425] [2023-08-25 21:16:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643625425] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:16:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36640821] [2023-08-25 21:16:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:30,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:16:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:16:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:16:30,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 447 [2023-08-25 21:16:30,373 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-25 21:16:30,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:30,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 447 [2023-08-25 21:16:30,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:30,678 INFO L124 PetriNetUnfolderBase]: 1324/2040 cut-off events. [2023-08-25 21:16:30,679 INFO L125 PetriNetUnfolderBase]: For 1184/1184 co-relation queries the response was YES. [2023-08-25 21:16:30,682 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-25 21:16:30,690 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 68 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2023-08-25 21:16:30,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 358 flow [2023-08-25 21:16:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:30,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:30,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1006 transitions. [2023-08-25 21:16:30,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3750932140193885 [2023-08-25 21:16:30,694 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1006 transitions. [2023-08-25 21:16:30,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1006 transitions. [2023-08-25 21:16:30,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:30,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1006 transitions. [2023-08-25 21:16:30,697 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-25 21:16:30,700 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-25 21:16:30,700 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-25 21:16:30,701 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 128 flow. Second operand 6 states and 1006 transitions. [2023-08-25 21:16:30,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 358 flow [2023-08-25 21:16:30,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:16:30,703 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 131 flow [2023-08-25 21:16:30,704 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-25 21:16:30,704 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -34 predicate places. [2023-08-25 21:16:30,704 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 131 flow [2023-08-25 21:16:30,705 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-25 21:16:30,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:30,705 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-25 21:16:30,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:16:30,705 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-25 21:16:30,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1634481756, now seen corresponding path program 1 times [2023-08-25 21:16:30,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:30,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345020839] [2023-08-25 21:16:30,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:30,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:30,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:30,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:30,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345020839] [2023-08-25 21:16:30,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345020839] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:30,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:30,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:16:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078029207] [2023-08-25 21:16:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:30,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:16:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:16:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:16:30,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 447 [2023-08-25 21:16:30,783 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-25 21:16:30,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:30,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 447 [2023-08-25 21:16:30,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:30,969 INFO L124 PetriNetUnfolderBase]: 547/1049 cut-off events. [2023-08-25 21:16:30,969 INFO L125 PetriNetUnfolderBase]: For 421/544 co-relation queries the response was YES. [2023-08-25 21:16:30,971 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-25 21:16:30,975 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 60 selfloop transitions, 7 changer transitions 0/78 dead transitions. [2023-08-25 21:16:30,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 78 transitions, 385 flow [2023-08-25 21:16:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:16:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:16:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 973 transitions. [2023-08-25 21:16:30,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43534675615212526 [2023-08-25 21:16:30,978 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 973 transitions. [2023-08-25 21:16:30,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 973 transitions. [2023-08-25 21:16:30,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:30,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 973 transitions. [2023-08-25 21:16:30,980 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-25 21:16:30,983 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-25 21:16:30,984 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-25 21:16:30,984 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 131 flow. Second operand 5 states and 973 transitions. [2023-08-25 21:16:30,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 78 transitions, 385 flow [2023-08-25 21:16:30,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 376 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-25 21:16:30,991 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 168 flow [2023-08-25 21:16:30,991 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-25 21:16:30,991 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -31 predicate places. [2023-08-25 21:16:30,991 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 168 flow [2023-08-25 21:16:30,996 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-25 21:16:30,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:30,996 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-25 21:16:30,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 21:16:30,996 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-25 21:16:30,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:30,997 INFO L85 PathProgramCache]: Analyzing trace with hash 171786144, now seen corresponding path program 2 times [2023-08-25 21:16:30,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:30,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943986379] [2023-08-25 21:16:30,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:30,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943986379] [2023-08-25 21:16:31,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943986379] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:31,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:31,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:16:31,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337057612] [2023-08-25 21:16:31,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:31,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:16:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:31,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:16:31,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:16:31,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 447 [2023-08-25 21:16:31,233 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-25 21:16:31,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:31,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 447 [2023-08-25 21:16:31,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:31,485 INFO L124 PetriNetUnfolderBase]: 797/1468 cut-off events. [2023-08-25 21:16:31,485 INFO L125 PetriNetUnfolderBase]: For 962/962 co-relation queries the response was YES. [2023-08-25 21:16:31,489 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-25 21:16:31,493 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 72 selfloop transitions, 7 changer transitions 15/105 dead transitions. [2023-08-25 21:16:31,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 577 flow [2023-08-25 21:16:31,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:16:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:16:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1168 transitions. [2023-08-25 21:16:31,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4354958985831469 [2023-08-25 21:16:31,497 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1168 transitions. [2023-08-25 21:16:31,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1168 transitions. [2023-08-25 21:16:31,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:31,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1168 transitions. [2023-08-25 21:16:31,500 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-25 21:16:31,503 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-25 21:16:31,503 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-25 21:16:31,504 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 168 flow. Second operand 6 states and 1168 transitions. [2023-08-25 21:16:31,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 577 flow [2023-08-25 21:16:31,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:16:31,507 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 185 flow [2023-08-25 21:16:31,507 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-25 21:16:31,508 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -25 predicate places. [2023-08-25 21:16:31,508 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 185 flow [2023-08-25 21:16:31,508 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-25 21:16:31,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:31,509 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-25 21:16:31,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 21:16:31,509 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-25 21:16:31,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash -77705371, now seen corresponding path program 1 times [2023-08-25 21:16:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878621489] [2023-08-25 21:16:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:16:31,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:31,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878621489] [2023-08-25 21:16:31,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878621489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:31,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:31,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:16:31,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389562213] [2023-08-25 21:16:31,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:31,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:16:31,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:31,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:16:31,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:16:31,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 447 [2023-08-25 21:16:31,556 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-25 21:16:31,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:31,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 447 [2023-08-25 21:16:31,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:31,691 INFO L124 PetriNetUnfolderBase]: 516/1036 cut-off events. [2023-08-25 21:16:31,691 INFO L125 PetriNetUnfolderBase]: For 1561/1561 co-relation queries the response was YES. [2023-08-25 21:16:31,694 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-25 21:16:31,698 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 39 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-25 21:16:31,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 52 transitions, 281 flow [2023-08-25 21:16:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:16:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:16:31,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2023-08-25 21:16:31,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4317673378076063 [2023-08-25 21:16:31,701 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2023-08-25 21:16:31,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2023-08-25 21:16:31,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:31,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2023-08-25 21:16:31,702 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-25 21:16:31,704 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-25 21:16:31,705 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-25 21:16:31,705 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 185 flow. Second operand 3 states and 579 transitions. [2023-08-25 21:16:31,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 52 transitions, 281 flow [2023-08-25 21:16:31,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 52 transitions, 254 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-25 21:16:31,708 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 164 flow [2023-08-25 21:16:31,708 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-25 21:16:31,709 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -32 predicate places. [2023-08-25 21:16:31,709 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 164 flow [2023-08-25 21:16:31,709 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-25 21:16:31,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:31,709 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-25 21:16:31,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:16:31,710 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-25 21:16:31,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1556726080, now seen corresponding path program 1 times [2023-08-25 21:16:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396867058] [2023-08-25 21:16:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:31,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:31,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:16:31,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:31,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396867058] [2023-08-25 21:16:31,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396867058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:16:31,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:16:31,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 21:16:31,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269436547] [2023-08-25 21:16:31,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:16:31,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 21:16:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:31,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 21:16:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-25 21:16:31,850 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 447 [2023-08-25 21:16:31,851 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-25 21:16:31,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:31,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 447 [2023-08-25 21:16:31,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:32,044 INFO L124 PetriNetUnfolderBase]: 551/1145 cut-off events. [2023-08-25 21:16:32,044 INFO L125 PetriNetUnfolderBase]: For 889/889 co-relation queries the response was YES. [2023-08-25 21:16:32,047 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-25 21:16:32,051 INFO L140 encePairwiseOnDemand]: 442/447 looper letters, 33 selfloop transitions, 2 changer transitions 15/61 dead transitions. [2023-08-25 21:16:32,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 309 flow [2023-08-25 21:16:32,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 21:16:32,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 21:16:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2023-08-25 21:16:32,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821029082774049 [2023-08-25 21:16:32,055 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2023-08-25 21:16:32,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2023-08-25 21:16:32,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:16:32,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2023-08-25 21:16:32,057 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-25 21:16:32,060 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-25 21:16:32,060 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-25 21:16:32,060 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 164 flow. Second operand 5 states and 854 transitions. [2023-08-25 21:16:32,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 309 flow [2023-08-25 21:16:32,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:16:32,065 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 178 flow [2023-08-25 21:16:32,066 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-25 21:16:32,067 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, -26 predicate places. [2023-08-25 21:16:32,067 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 178 flow [2023-08-25 21:16:32,067 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-25 21:16:32,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:16:32,068 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-25 21:16:32,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:16:32,068 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-25 21:16:32,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:16:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash 303461183, now seen corresponding path program 1 times [2023-08-25 21:16:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:16:32,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508693249] [2023-08-25 21:16:32,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:16:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:33,054 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-25 21:16:33,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:16:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508693249] [2023-08-25 21:16:33,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508693249] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:16:33,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323976109] [2023-08-25 21:16:33,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:16:33,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:16:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:16:33,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:16:33,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:16:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:16:33,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-25 21:16:33,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:16:33,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-25 21:16:33,385 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:16:33,469 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:16:33,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:16:33,761 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-25 21:16:33,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:16:34,625 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-25 21:16:34,823 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-25 21:16:34,850 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:34,850 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-25 21:16:34,866 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:34,868 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-25 21:16:34,897 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:34,898 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-25 21:16:34,937 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:34,937 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-25 21:16:34,955 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:34,955 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-25 21:16:35,475 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:16:35,475 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-25 21:16:35,488 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:16:35,488 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-25 21:16:35,522 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:16:35,522 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-25 21:16:35,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:16:35,541 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-25 21:16:35,558 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-25 21:16:35,559 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-25 21:16:35,665 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-25 21:16:35,808 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-25 21:16:35,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323976109] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:16:35,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:16:35,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 33 [2023-08-25 21:16:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705379358] [2023-08-25 21:16:35,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:16:35,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-25 21:16:35,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:16:35,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-25 21:16:35,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=825, Unknown=20, NotChecked=122, Total=1122 [2023-08-25 21:16:35,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 447 [2023-08-25 21:16:35,817 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-25 21:16:35,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:16:35,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 447 [2023-08-25 21:16:35,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:16:36,037 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-25 21:16:36,197 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-25 21:16:36,776 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-25 21:16:48,034 WARN L234 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 77 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:17:01,895 WARN L234 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-25 21:17:10,594 WARN L234 SmtUtils]: Spent 8.24s 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-25 21:17:16,832 WARN L234 SmtUtils]: Spent 6.19s 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-25 21:17:37,265 WARN L234 SmtUtils]: Spent 10.50s 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-25 21:17:46,335 WARN L234 SmtUtils]: Spent 8.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-25 21:17:59,392 WARN L234 SmtUtils]: Spent 8.37s 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-25 21:18:01,256 INFO L124 PetriNetUnfolderBase]: 13819/23092 cut-off events. [2023-08-25 21:18:01,256 INFO L125 PetriNetUnfolderBase]: For 24799/24799 co-relation queries the response was YES. [2023-08-25 21:18:01,351 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-25 21:18:01,441 INFO L140 encePairwiseOnDemand]: 430/447 looper letters, 958 selfloop transitions, 286 changer transitions 147/1394 dead transitions. [2023-08-25 21:18:01,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1394 transitions, 7778 flow [2023-08-25 21:18:01,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2023-08-25 21:18:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2023-08-25 21:18:01,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 14191 transitions. [2023-08-25 21:18:01,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26904409813066393 [2023-08-25 21:18:01,482 INFO L72 ComplementDD]: Start complementDD. Operand 118 states and 14191 transitions. [2023-08-25 21:18:01,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 14191 transitions. [2023-08-25 21:18:01,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:01,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 14191 transitions. [2023-08-25 21:18:01,533 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-25 21:18:01,603 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-25 21:18:01,618 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-25 21:18:01,618 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 178 flow. Second operand 118 states and 14191 transitions. [2023-08-25 21:18:01,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1394 transitions, 7778 flow [2023-08-25 21:18:01,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 1394 transitions, 7502 flow, removed 137 selfloop flow, removed 3 redundant places. [2023-08-25 21:18:01,664 INFO L231 Difference]: Finished difference. Result has 243 places, 379 transitions, 3233 flow [2023-08-25 21:18:01,665 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-25 21:18:01,665 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 155 predicate places. [2023-08-25 21:18:01,665 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 379 transitions, 3233 flow [2023-08-25 21:18:01,666 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-25 21:18:01,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:01,667 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-25 21:18:01,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 21:18:01,874 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-25 21:18:01,874 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-25 21:18:01,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:01,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1231415281, now seen corresponding path program 2 times [2023-08-25 21:18:01,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:01,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68265071] [2023-08-25 21:18:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:01,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:03,240 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-25 21:18:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:03,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68265071] [2023-08-25 21:18:03,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68265071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:03,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933913729] [2023-08-25 21:18:03,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:18:03,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:03,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:03,242 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:03,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:18:03,443 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:18:03,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:18:03,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-25 21:18:03,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:03,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:03,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-25 21:18:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:18:03,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:18:04,255 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:18:04,256 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-25 21:18:04,262 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-25 21:18:04,268 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-25 21:18:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:18:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933913729] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:18:04,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:18:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2023-08-25 21:18:04,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059527933] [2023-08-25 21:18:04,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:18:04,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-25 21:18:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-25 21:18:04,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=712, Unknown=4, NotChecked=0, Total=812 [2023-08-25 21:18:04,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 447 [2023-08-25 21:18:04,877 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-25 21:18:04,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:04,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 447 [2023-08-25 21:18:04,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:17,706 INFO L124 PetriNetUnfolderBase]: 3922/7285 cut-off events. [2023-08-25 21:18:17,706 INFO L125 PetriNetUnfolderBase]: For 145104/145201 co-relation queries the response was YES. [2023-08-25 21:18:17,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40701 conditions, 7285 events. 3922/7285 cut-off events. For 145104/145201 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 49641 event pairs, 451 based on Foata normal form. 297/7521 useless extension candidates. Maximal degree in co-relation 40621. Up to 2133 conditions per place. [2023-08-25 21:18:17,789 INFO L140 encePairwiseOnDemand]: 432/447 looper letters, 327 selfloop transitions, 163 changer transitions 164/665 dead transitions. [2023-08-25 21:18:17,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 665 transitions, 7668 flow [2023-08-25 21:18:17,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-08-25 21:18:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-08-25 21:18:17,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4698 transitions. [2023-08-25 21:18:17,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.300287631831256 [2023-08-25 21:18:17,797 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 4698 transitions. [2023-08-25 21:18:17,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 4698 transitions. [2023-08-25 21:18:17,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:17,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4698 transitions. [2023-08-25 21:18:17,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 134.22857142857143) internal successors, (4698), 35 states have internal predecessors, (4698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:17,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 447.0) internal successors, (16092), 36 states have internal predecessors, (16092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:17,821 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 447.0) internal successors, (16092), 36 states have internal predecessors, (16092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:17,821 INFO L175 Difference]: Start difference. First operand has 243 places, 379 transitions, 3233 flow. Second operand 35 states and 4698 transitions. [2023-08-25 21:18:17,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 665 transitions, 7668 flow [2023-08-25 21:18:18,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 665 transitions, 6820 flow, removed 387 selfloop flow, removed 19 redundant places. [2023-08-25 21:18:18,225 INFO L231 Difference]: Finished difference. Result has 252 places, 303 transitions, 2775 flow [2023-08-25 21:18:18,225 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=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2775, PETRI_PLACES=252, PETRI_TRANSITIONS=303} [2023-08-25 21:18:18,226 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 164 predicate places. [2023-08-25 21:18:18,226 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 303 transitions, 2775 flow [2023-08-25 21:18:18,227 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-25 21:18:18,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:18,227 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-25 21:18:18,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 21:18:18,428 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-25 21:18:18,428 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-25 21:18:18,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1440320516, now seen corresponding path program 3 times [2023-08-25 21:18:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:18,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920479473] [2023-08-25 21:18:18,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:18,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:20,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:18:20,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920479473] [2023-08-25 21:18:20,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920479473] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:20,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782744411] [2023-08-25 21:18:20,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:18:20,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:20,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:20,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:20,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:18:20,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 21:18:20,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:18:20,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-25 21:18:20,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:20,644 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-25 21:18:20,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:18:20,819 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:18:20,820 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-25 21:18:21,240 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-25 21:18:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782744411] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:18:21,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:18:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 27 [2023-08-25 21:18:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440241437] [2023-08-25 21:18:21,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:18:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-25 21:18:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-25 21:18:21,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2023-08-25 21:18:21,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-25 21:18:21,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 303 transitions, 2775 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-25 21:18:21,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:21,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-25 21:18:21,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:24,438 INFO L124 PetriNetUnfolderBase]: 4894/9076 cut-off events. [2023-08-25 21:18:24,438 INFO L125 PetriNetUnfolderBase]: For 161546/161621 co-relation queries the response was YES. [2023-08-25 21:18:24,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51797 conditions, 9076 events. 4894/9076 cut-off events. For 161546/161621 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 64631 event pairs, 510 based on Foata normal form. 135/9164 useless extension candidates. Maximal degree in co-relation 51724. Up to 1997 conditions per place. [2023-08-25 21:18:24,617 INFO L140 encePairwiseOnDemand]: 434/447 looper letters, 431 selfloop transitions, 228 changer transitions 36/706 dead transitions. [2023-08-25 21:18:24,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 706 transitions, 8920 flow [2023-08-25 21:18:24,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-25 21:18:24,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-25 21:18:24,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4765 transitions. [2023-08-25 21:18:24,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.323028947190021 [2023-08-25 21:18:24,625 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4765 transitions. [2023-08-25 21:18:24,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4765 transitions. [2023-08-25 21:18:24,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:24,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4765 transitions. [2023-08-25 21:18:24,634 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-25 21:18:24,646 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-25 21:18:24,649 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-25 21:18:24,649 INFO L175 Difference]: Start difference. First operand has 252 places, 303 transitions, 2775 flow. Second operand 33 states and 4765 transitions. [2023-08-25 21:18:24,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 706 transitions, 8920 flow [2023-08-25 21:18:24,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 706 transitions, 7908 flow, removed 302 selfloop flow, removed 27 redundant places. [2023-08-25 21:18:24,972 INFO L231 Difference]: Finished difference. Result has 247 places, 411 transitions, 4445 flow [2023-08-25 21:18:24,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2431, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=4445, PETRI_PLACES=247, PETRI_TRANSITIONS=411} [2023-08-25 21:18:24,972 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 159 predicate places. [2023-08-25 21:18:24,973 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 411 transitions, 4445 flow [2023-08-25 21:18:24,974 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-25 21:18:24,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:24,974 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-25 21:18:24,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-25 21:18:25,180 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-25 21:18:25,181 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-25 21:18:25,181 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash -18280400, now seen corresponding path program 4 times [2023-08-25 21:18:25,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:25,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071385019] [2023-08-25 21:18:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:26,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:18:26,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071385019] [2023-08-25 21:18:26,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071385019] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:26,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065479721] [2023-08-25 21:18:26,697 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 21:18:26,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:26,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:26,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:26,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 21:18:26,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 21:18:26,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:18:26,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-25 21:18:26,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:27,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:18:27,264 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-25 21:18:27,398 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-25 21:18:27,398 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:18:27,646 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_818) c_~queue~0.base) .cse0)))) (forall ((v_ArrVal_818 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_818) c_~queue~0.base) .cse0)) 1)))) is different from false [2023-08-25 21:18:27,692 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:18:27,693 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-25 21:18:27,698 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-25 21:18:27,703 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-25 21:18:28,263 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-25 21:18:28,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065479721] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:18:28,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:18:28,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 31 [2023-08-25 21:18:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688448414] [2023-08-25 21:18:28,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:18:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-25 21:18:28,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-25 21:18:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=825, Unknown=1, NotChecked=58, Total=992 [2023-08-25 21:18:28,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 447 [2023-08-25 21:18:28,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 411 transitions, 4445 flow. Second operand has 32 states, 32 states have (on average 129.3125) internal successors, (4138), 32 states have internal predecessors, (4138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:28,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:28,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 447 [2023-08-25 21:18:28,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:32,134 INFO L124 PetriNetUnfolderBase]: 5075/9275 cut-off events. [2023-08-25 21:18:32,134 INFO L125 PetriNetUnfolderBase]: For 138910/138993 co-relation queries the response was YES. [2023-08-25 21:18:32,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54887 conditions, 9275 events. 5075/9275 cut-off events. For 138910/138993 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 65357 event pairs, 558 based on Foata normal form. 139/9353 useless extension candidates. Maximal degree in co-relation 54816. Up to 2967 conditions per place. [2023-08-25 21:18:32,234 INFO L140 encePairwiseOnDemand]: 434/447 looper letters, 348 selfloop transitions, 250 changer transitions 43/652 dead transitions. [2023-08-25 21:18:32,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 652 transitions, 8587 flow [2023-08-25 21:18:32,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-25 21:18:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-25 21:18:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4029 transitions. [2023-08-25 21:18:32,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3004474272930649 [2023-08-25 21:18:32,241 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4029 transitions. [2023-08-25 21:18:32,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4029 transitions. [2023-08-25 21:18:32,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:32,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4029 transitions. [2023-08-25 21:18:32,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 134.3) internal successors, (4029), 30 states have internal predecessors, (4029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:32,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 447.0) internal successors, (13857), 31 states have internal predecessors, (13857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:32,258 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 447.0) internal successors, (13857), 31 states have internal predecessors, (13857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:32,258 INFO L175 Difference]: Start difference. First operand has 247 places, 411 transitions, 4445 flow. Second operand 30 states and 4029 transitions. [2023-08-25 21:18:32,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 652 transitions, 8587 flow [2023-08-25 21:18:32,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 652 transitions, 8194 flow, removed 146 selfloop flow, removed 6 redundant places. [2023-08-25 21:18:32,825 INFO L231 Difference]: Finished difference. Result has 272 places, 426 transitions, 5070 flow [2023-08-25 21:18:32,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=4136, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5070, PETRI_PLACES=272, PETRI_TRANSITIONS=426} [2023-08-25 21:18:32,825 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 184 predicate places. [2023-08-25 21:18:32,825 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 426 transitions, 5070 flow [2023-08-25 21:18:32,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 129.3125) internal successors, (4138), 32 states have internal predecessors, (4138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:32,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:32,826 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-25 21:18:32,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 21:18:33,026 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-25 21:18:33,027 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-25 21:18:33,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:33,027 INFO L85 PathProgramCache]: Analyzing trace with hash -146389612, now seen corresponding path program 5 times [2023-08-25 21:18:33,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:33,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245401806] [2023-08-25 21:18:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:33,142 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-25 21:18:33,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245401806] [2023-08-25 21:18:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245401806] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392470629] [2023-08-25 21:18:33,142 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-25 21:18:33,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:33,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:33,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:33,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 21:18:33,477 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-25 21:18:33,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:18:33,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-25 21:18:33,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:33,549 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-25 21:18:33,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:18:33,604 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-25 21:18:33,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392470629] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:18:33,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:18:33,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-25 21:18:33,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430733862] [2023-08-25 21:18:33,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:18:33,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 21:18:33,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:33,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 21:18:33,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-08-25 21:18:33,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 447 [2023-08-25 21:18:33,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 426 transitions, 5070 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-25 21:18:33,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:33,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 447 [2023-08-25 21:18:33,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:34,802 INFO L124 PetriNetUnfolderBase]: 3406/6800 cut-off events. [2023-08-25 21:18:34,802 INFO L125 PetriNetUnfolderBase]: For 108210/108387 co-relation queries the response was YES. [2023-08-25 21:18:34,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39425 conditions, 6800 events. 3406/6800 cut-off events. For 108210/108387 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 49773 event pairs, 1518 based on Foata normal form. 362/7060 useless extension candidates. Maximal degree in co-relation 39353. Up to 3162 conditions per place. [2023-08-25 21:18:34,865 INFO L140 encePairwiseOnDemand]: 443/447 looper letters, 206 selfloop transitions, 3 changer transitions 127/347 dead transitions. [2023-08-25 21:18:34,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 347 transitions, 4850 flow [2023-08-25 21:18:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:18:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:18:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1026 transitions. [2023-08-25 21:18:34,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3825503355704698 [2023-08-25 21:18:34,868 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1026 transitions. [2023-08-25 21:18:34,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1026 transitions. [2023-08-25 21:18:34,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:34,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1026 transitions. [2023-08-25 21:18:34,869 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-25 21:18:34,871 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-25 21:18:34,871 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-25 21:18:34,871 INFO L175 Difference]: Start difference. First operand has 272 places, 426 transitions, 5070 flow. Second operand 6 states and 1026 transitions. [2023-08-25 21:18:34,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 347 transitions, 4850 flow [2023-08-25 21:18:35,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 347 transitions, 4543 flow, removed 46 selfloop flow, removed 31 redundant places. [2023-08-25 21:18:35,199 INFO L231 Difference]: Finished difference. Result has 229 places, 220 transitions, 2519 flow [2023-08-25 21:18:35,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=3655, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2519, PETRI_PLACES=229, PETRI_TRANSITIONS=220} [2023-08-25 21:18:35,199 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 141 predicate places. [2023-08-25 21:18:35,199 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 220 transitions, 2519 flow [2023-08-25 21:18:35,200 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-25 21:18:35,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:35,200 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-25 21:18:35,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 21:18:35,406 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-25 21:18:35,406 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-25 21:18:35,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:35,407 INFO L85 PathProgramCache]: Analyzing trace with hash 758189435, now seen corresponding path program 6 times [2023-08-25 21:18:35,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:35,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849532763] [2023-08-25 21:18:35,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:35,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:35,524 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-25 21:18:35,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:35,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849532763] [2023-08-25 21:18:35,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849532763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:18:35,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:18:35,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:18:35,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743735554] [2023-08-25 21:18:35,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:18:35,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:18:35,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:35,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:18:35,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:18:35,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 447 [2023-08-25 21:18:35,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 220 transitions, 2519 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-25 21:18:35,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:35,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 447 [2023-08-25 21:18:35,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:36,689 INFO L124 PetriNetUnfolderBase]: 3524/7091 cut-off events. [2023-08-25 21:18:36,690 INFO L125 PetriNetUnfolderBase]: For 98345/98372 co-relation queries the response was YES. [2023-08-25 21:18:36,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39625 conditions, 7091 events. 3524/7091 cut-off events. For 98345/98372 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 48631 event pairs, 862 based on Foata normal form. 199/7194 useless extension candidates. Maximal degree in co-relation 39558. Up to 2756 conditions per place. [2023-08-25 21:18:36,758 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 308 selfloop transitions, 87 changer transitions 0/406 dead transitions. [2023-08-25 21:18:36,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 406 transitions, 5603 flow [2023-08-25 21:18:36,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:18:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:18:36,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2023-08-25 21:18:36,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4423937360178971 [2023-08-25 21:18:36,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2023-08-25 21:18:36,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2023-08-25 21:18:36,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:36,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2023-08-25 21:18:36,761 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-25 21:18:36,763 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-25 21:18:36,763 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-25 21:18:36,763 INFO L175 Difference]: Start difference. First operand has 229 places, 220 transitions, 2519 flow. Second operand 4 states and 791 transitions. [2023-08-25 21:18:36,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 406 transitions, 5603 flow [2023-08-25 21:18:37,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 406 transitions, 5343 flow, removed 67 selfloop flow, removed 26 redundant places. [2023-08-25 21:18:37,016 INFO L231 Difference]: Finished difference. Result has 163 places, 291 transitions, 4013 flow [2023-08-25 21:18:37,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2372, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4013, PETRI_PLACES=163, PETRI_TRANSITIONS=291} [2023-08-25 21:18:37,017 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 75 predicate places. [2023-08-25 21:18:37,017 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 291 transitions, 4013 flow [2023-08-25 21:18:37,017 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-25 21:18:37,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:18:37,017 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-25 21:18:37,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 21:18:37,018 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-25 21:18:37,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:18:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -877240838, now seen corresponding path program 7 times [2023-08-25 21:18:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:18:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617554205] [2023-08-25 21:18:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:18:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:18:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:38,416 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-25 21:18:38,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:18:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617554205] [2023-08-25 21:18:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617554205] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:18:38,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020406970] [2023-08-25 21:18:38,417 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-25 21:18:38,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:18:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:18:38,418 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:18:38,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-25 21:18:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:18:38,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-25 21:18:38,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:18:39,238 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-25 21:18:39,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:18:39,843 INFO L322 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-08-25 21:18:39,843 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-25 21:18:39,859 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:18:39,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-25 21:18:40,712 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-25 21:18:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020406970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:18:40,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:18:40,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 38 [2023-08-25 21:18:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058326128] [2023-08-25 21:18:40,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:18:40,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-25 21:18:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:18:40,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-25 21:18:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1229, Unknown=0, NotChecked=0, Total=1482 [2023-08-25 21:18:40,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-25 21:18:40,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 291 transitions, 4013 flow. Second operand has 39 states, 39 states have (on average 139.25641025641025) internal successors, (5431), 39 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:40,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:18:40,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-25 21:18:40,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:18:58,144 INFO L124 PetriNetUnfolderBase]: 19492/38581 cut-off events. [2023-08-25 21:18:58,144 INFO L125 PetriNetUnfolderBase]: For 302930/303071 co-relation queries the response was YES. [2023-08-25 21:18:58,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195577 conditions, 38581 events. 19492/38581 cut-off events. For 302930/303071 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 348663 event pairs, 1088 based on Foata normal form. 481/38830 useless extension candidates. Maximal degree in co-relation 195529. Up to 8981 conditions per place. [2023-08-25 21:18:58,557 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 886 selfloop transitions, 969 changer transitions 594/2460 dead transitions. [2023-08-25 21:18:58,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 2460 transitions, 33609 flow [2023-08-25 21:18:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-08-25 21:18:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-08-25 21:18:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 18470 transitions. [2023-08-25 21:18:58,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32535362609875107 [2023-08-25 21:18:58,583 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 18470 transitions. [2023-08-25 21:18:58,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 18470 transitions. [2023-08-25 21:18:58,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:18:58,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 18470 transitions. [2023-08-25 21:18:58,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 145.43307086614172) internal successors, (18470), 127 states have internal predecessors, (18470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:58,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 447.0) internal successors, (57216), 128 states have internal predecessors, (57216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:58,672 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 447.0) internal successors, (57216), 128 states have internal predecessors, (57216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:18:58,672 INFO L175 Difference]: Start difference. First operand has 163 places, 291 transitions, 4013 flow. Second operand 127 states and 18470 transitions. [2023-08-25 21:18:58,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 2460 transitions, 33609 flow [2023-08-25 21:19:00,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 2460 transitions, 33461 flow, removed 74 selfloop flow, removed 0 redundant places. [2023-08-25 21:19:00,370 INFO L231 Difference]: Finished difference. Result has 346 places, 1209 transitions, 21750 flow [2023-08-25 21:19:00,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=3939, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=21750, PETRI_PLACES=346, PETRI_TRANSITIONS=1209} [2023-08-25 21:19:00,370 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 258 predicate places. [2023-08-25 21:19:00,371 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 1209 transitions, 21750 flow [2023-08-25 21:19:00,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 139.25641025641025) internal successors, (5431), 39 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:00,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:00,372 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-25 21:19:00,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-25 21:19:00,577 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-25 21:19:00,578 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-25 21:19:00,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:00,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1490561710, now seen corresponding path program 8 times [2023-08-25 21:19:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:00,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327117254] [2023-08-25 21:19:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:00,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:02,121 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-25 21:19:02,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:02,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327117254] [2023-08-25 21:19:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327117254] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:02,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063638657] [2023-08-25 21:19:02,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 21:19:02,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:02,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:02,123 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:19:02,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-25 21:19:02,373 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 21:19:02,373 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:19:02,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-25 21:19:02,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:02,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:19:02,978 INFO L322 Elim1Store]: treesize reduction 32, result has 17.9 percent of original size [2023-08-25 21:19:02,979 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 49 treesize of output 20 [2023-08-25 21:19:03,038 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-25 21:19:03,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:19:03,743 INFO L322 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-08-25 21:19:03,743 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-25 21:19:03,759 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:19:03,759 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-25 21:19:04,812 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-25 21:19:04,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063638657] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:19:04,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:19:04,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 38 [2023-08-25 21:19:04,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562090290] [2023-08-25 21:19:04,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:19:04,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-08-25 21:19:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:04,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-08-25 21:19:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1280, Unknown=0, NotChecked=0, Total=1482 [2023-08-25 21:19:04,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 447 [2023-08-25 21:19:04,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 1209 transitions, 21750 flow. Second operand has 39 states, 39 states have (on average 139.30769230769232) internal successors, (5433), 39 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:04,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:04,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 447 [2023-08-25 21:19:04,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:36,158 INFO L124 PetriNetUnfolderBase]: 32550/61744 cut-off events. [2023-08-25 21:19:36,158 INFO L125 PetriNetUnfolderBase]: For 2707416/2710641 co-relation queries the response was YES. [2023-08-25 21:19:37,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 524133 conditions, 61744 events. 32550/61744 cut-off events. For 2707416/2710641 co-relation queries the response was YES. Maximal size of possible extension queue 1269. Compared 558015 event pairs, 3261 based on Foata normal form. 1306/62679 useless extension candidates. Maximal degree in co-relation 524027. Up to 16324 conditions per place. [2023-08-25 21:19:37,502 INFO L140 encePairwiseOnDemand]: 432/447 looper letters, 1379 selfloop transitions, 2096 changer transitions 701/4187 dead transitions. [2023-08-25 21:19:37,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 4187 transitions, 81382 flow [2023-08-25 21:19:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2023-08-25 21:19:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2023-08-25 21:19:37,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 16672 transitions. [2023-08-25 21:19:37,519 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3243264273903317 [2023-08-25 21:19:37,519 INFO L72 ComplementDD]: Start complementDD. Operand 115 states and 16672 transitions. [2023-08-25 21:19:37,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 16672 transitions. [2023-08-25 21:19:37,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:37,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 115 states and 16672 transitions. [2023-08-25 21:19:37,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 116 states, 115 states have (on average 144.97391304347826) internal successors, (16672), 115 states have internal predecessors, (16672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:37,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 116 states, 116 states have (on average 447.0) internal successors, (51852), 116 states have internal predecessors, (51852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:37,587 INFO L81 ComplementDD]: Finished complementDD. Result has 116 states, 116 states have (on average 447.0) internal successors, (51852), 116 states have internal predecessors, (51852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:37,588 INFO L175 Difference]: Start difference. First operand has 346 places, 1209 transitions, 21750 flow. Second operand 115 states and 16672 transitions. [2023-08-25 21:19:37,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 4187 transitions, 81382 flow [2023-08-25 21:19:56,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 4187 transitions, 68808 flow, removed 5425 selfloop flow, removed 31 redundant places. [2023-08-25 21:19:56,892 INFO L231 Difference]: Finished difference. Result has 468 places, 2684 transitions, 49956 flow [2023-08-25 21:19:56,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=18194, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=764, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=49956, PETRI_PLACES=468, PETRI_TRANSITIONS=2684} [2023-08-25 21:19:56,894 INFO L281 CegarLoopForPetriNet]: 88 programPoint places, 380 predicate places. [2023-08-25 21:19:56,894 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 2684 transitions, 49956 flow [2023-08-25 21:19:56,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 139.30769230769232) internal successors, (5433), 39 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:56,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:56,895 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-25 21:19:56,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-25 21:19:57,104 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-25 21:19:57,105 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-25 21:19:57,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1798455038, now seen corresponding path program 9 times [2023-08-25 21:19:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109005190] [2023-08-25 21:19:57,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:58,853 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-25 21:19:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109005190] [2023-08-25 21:19:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109005190] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257634499] [2023-08-25 21:19:58,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:19:58,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:58,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:58,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:19:58,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-25 21:19:59,355 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-25 21:19:59,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:19:59,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-25 21:19:59,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:59,461 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-25 21:19:59,527 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:19:59,635 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:19:59,807 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-25 21:20:00,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:20:00,075 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-25 21:20:00,307 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-25 21:20:00,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:20:00,577 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~front~0 1))) (or (<= c_~back~0 .cse0) (let ((.cse5 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse5 4)) (.cse3 (+ c_~queue~0.offset .cse5))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse4 .cse2) (select .cse4 .cse3))) 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0) (<= c_~n~0 .cse0))) is different from false [2023-08-25 21:20:00,682 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1))) is different from false [2023-08-25 21:20:00,726 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0)) is different from false [2023-08-25 21:20:01,007 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:20:01,008 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-25 21:20:01,119 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse5 (select |c_#memory_int| c_~queue~0.base)) (.cse6 (* c_~back~0 4)) (.cse7 (+ c_~back~0 1))) (let ((.cse1 (<= .cse7 c_~front~0)) (.cse0 (select .cse5 (+ c_~queue~0.offset .cse6 4))) (.cse3 (<= c_~n~0 .cse7)) (.cse2 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse4 (select .cse5 (+ c_~queue~0.offset .cse6)))) (and (or (not (= .cse0 1)) .cse1 (not .cse2) .cse3 (not (= (+ .cse4 1) 0))) (or .cse1 (not (= (+ .cse0 1) 0)) .cse3 .cse2 (not (= .cse4 1)))))) (let ((.cse12 (* c_~front~0 4))) (let ((.cse9 (+ c_~queue~0.offset .cse12 4)) (.cse10 (+ c_~queue~0.offset .cse12))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse9) (select .cse8 .cse10))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse11 .cse9) (select .cse11 .cse10))) 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0)) is different from false [2023-08-25 21:20:01,861 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~back~0 1))) (or (= (mod c_~v_assert~0 256) 0) (<= .cse0 c_~front~0) (<= c_~n~0 .cse0) (let ((.cse11 (* c_~back~0 4)) (.cse12 (* c_~front~0 4))) (let ((.cse2 (+ c_~queue~0.offset .cse12 4)) (.cse3 (+ c_~queue~0.offset .cse12)) (.cse6 (+ c_~queue~0.offset .cse11)) (.cse7 (+ c_~queue~0.offset .cse11 4))) (and (forall ((v_ArrVal_1472 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse5 (select .cse4 c_~queue~0.base))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse1 .cse2) (select .cse1 .cse3))) 1)) (not (= (select .cse5 .cse6) 1)) (not (= (+ 1 (select .cse5 .cse7)) 0)))))) (forall ((v_ArrVal_1472 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse10 (select .cse9 c_~queue~0.base))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse8 .cse2) (select .cse8 .cse3))))) (not (= (select .cse10 .cse6) 1)) (not (= (+ 1 (select .cse10 .cse7)) 0))))))))) (< c_~front~0 0))) is different from false [2023-08-25 21:20:01,961 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~back~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse3 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse2 .cse3) c_~sum~0 (select .cse2 .cse4))))) (not (= (+ (select .cse0 .cse6) 1) 0)))))) (forall ((v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse7 .cse3) c_~sum~0 (select .cse7 .cse4))) 1)) (not (= (select .cse9 .cse1) 1)) (not (= (+ (select .cse9 .cse6) 1) 0))))))))) (<= .cse12 c_~front~0) (<= c_~n~0 .cse12) (< |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-25 21:20:01,991 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:20:01,992 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 129 treesize of output 93 [2023-08-25 21:20:02,028 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-25 21:20:02,029 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 618 treesize of output 593 [2023-08-25 21:20:02,075 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-25 21:20:02,075 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 348 treesize of output 322 [2023-08-25 21:20:02,089 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 183 treesize of output 131 [2023-08-25 21:20:02,139 INFO L322 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-08-25 21:20:02,140 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 185 treesize of output 185 [2023-08-25 21:20:03,957 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:20:03,957 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 129 treesize of output 93 [2023-08-25 21:20:03,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:20:03,986 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-25 21:20:03,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 562 treesize of output 502 [2023-08-25 21:20:04,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:20:04,003 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-25 21:20:04,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-25 21:20:04,005 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 154 [2023-08-25 21:20:04,031 INFO L322 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-08-25 21:20:04,032 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 179 treesize of output 135 [2023-08-25 21:20:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2023-08-25 21:20:04,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257634499] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:20:04,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:20:04,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 43 [2023-08-25 21:20:04,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135718792] [2023-08-25 21:20:04,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:20:04,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-08-25 21:20:04,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-08-25 21:20:04,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1191, Unknown=10, NotChecked=462, Total=1892 [2023-08-25 21:20:04,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 447 [2023-08-25 21:20:04,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 2684 transitions, 49956 flow. Second operand has 44 states, 44 states have (on average 111.45454545454545) internal successors, (4904), 44 states have internal predecessors, (4904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:04,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:04,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 447 [2023-08-25 21:20:04,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:05,861 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~sum~0 0) (<= c_~v_assert~0 1) (<= 1 c_~v_assert~0) (<= 0 c_~sum~0) (let ((.cse12 (+ c_~back~0 1))) (or (= (mod c_~v_assert~0 256) 0) (let ((.cse10 (* c_~back~0 4)) (.cse11 (* c_~front~0 4))) (let ((.cse3 (+ .cse11 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse1 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse0 .cse1) 1)) (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse2 (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse2 .cse3) c_~sum~0 (select .cse2 .cse4))))) (not (= (+ (select .cse0 .cse6) 1) 0)))))) (forall ((v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1472))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse7 (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (+ (select .cse7 .cse3) c_~sum~0 (select .cse7 .cse4))) 1)) (not (= (select .cse9 .cse1) 1)) (not (= (+ (select .cse9 .cse6) 1) 0))))))))) (<= .cse12 c_~front~0) (<= c_~n~0 .cse12) (< |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-25 21:20:08,962 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_~v_assert~0) (<= 0 c_~sum~0) (or (let ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0))) is different from false [2023-08-25 21:20:09,876 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 ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) (<= c_~n~0 c_~back~0) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0))) is different from false [2023-08-25 21:20:13,510 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 ((.cse4 (* c_~front~0 4))) (let ((.cse1 (+ c_~queue~0.offset .cse4 4)) (.cse2 (+ c_~queue~0.offset .cse4))) (and (forall ((v_ArrVal_1475 (Array Int Int))) (<= 0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse0 .cse1) (select .cse0 .cse2))))) (forall ((v_ArrVal_1475 (Array Int Int))) (<= (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1475) c_~queue~0.base))) (+ c_~sum~0 (select .cse3 .cse1) (select .cse3 .cse2))) 1))))) (let ((.cse6 (<= c_~back~0 c_~front~0)) (.cse5 (= (mod |c_thread2Thread1of1ForFork2_~b~0#1| 256) 0)) (.cse7 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) (and (or (not .cse5) .cse6 (not (= (+ .cse7 1) 0))) (or .cse6 .cse5 (not (= .cse7 1))))) (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (< c_~front~0 0) (<= c_~n~0 (+ c_~front~0 1)))) is different from false [2023-08-25 21:22:12,992 INFO L124 PetriNetUnfolderBase]: 113992/195728 cut-off events. [2023-08-25 21:22:12,993 INFO L125 PetriNetUnfolderBase]: For 11525533/11536274 co-relation queries the response was YES. [2023-08-25 21:22:19,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724429 conditions, 195728 events. 113992/195728 cut-off events. For 11525533/11536274 co-relation queries the response was YES. Maximal size of possible extension queue 3654. Compared 1849000 event pairs, 17290 based on Foata normal form. 5233/199859 useless extension candidates. Maximal degree in co-relation 1724285. Up to 52000 conditions per place. [2023-08-25 21:22:21,189 INFO L140 encePairwiseOnDemand]: 430/447 looper letters, 2089 selfloop transitions, 2577 changer transitions 970/5639 dead transitions. [2023-08-25 21:22:21,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 5639 transitions, 109616 flow [2023-08-25 21:22:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2023-08-25 21:22:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2023-08-25 21:22:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 13682 transitions. [2023-08-25 21:22:21,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26849562384708975 [2023-08-25 21:22:21,229 INFO L72 ComplementDD]: Start complementDD. Operand 114 states and 13682 transitions. [2023-08-25 21:22:21,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 13682 transitions. [2023-08-25 21:22:21,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:22:21,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 114 states and 13682 transitions. [2023-08-25 21:22:21,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 115 states, 114 states have (on average 120.01754385964912) internal successors, (13682), 114 states have internal predecessors, (13682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:21,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 115 states, 115 states have (on average 447.0) internal successors, (51405), 115 states have internal predecessors, (51405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:21,378 INFO L81 ComplementDD]: Finished complementDD. Result has 115 states, 115 states have (on average 447.0) internal successors, (51405), 115 states have internal predecessors, (51405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:21,378 INFO L175 Difference]: Start difference. First operand has 468 places, 2684 transitions, 49956 flow. Second operand 114 states and 13682 transitions. [2023-08-25 21:22:21,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 5639 transitions, 109616 flow