/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 00:47:25,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 00:47:25,792 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 00:47:25,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 00:47:25,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 00:47:25,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 00:47:25,839 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 00:47:25,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 00:47:25,840 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 00:47:25,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 00:47:25,844 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 00:47:25,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 00:47:25,845 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 00:47:25,846 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 00:47:25,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 00:47:25,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 00:47:25,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 00:47:25,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 00:47:25,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 00:47:25,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 00:47:25,848 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 00:47:25,848 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 00:47:25,848 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 00:47:25,849 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 00:47:25,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 00:47:25,849 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 00:47:25,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 00:47:25,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 00:47:25,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 00:47:25,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 00:47:25,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 00:47:25,851 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 00:47:25,851 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 00:47:25,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 00:47:25,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 00:47:25,852 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 00:47:26,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 00:47:26,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 00:47:26,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 00:47:26,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 00:47:26,207 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 00:47:26,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-25 00:47:27,376 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 00:47:27,616 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 00:47:27,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-25 00:47:27,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a89787e/3fdda7cb250b4dba99527a47cdec9dd6/FLAG80223b072 [2023-08-25 00:47:27,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a89787e/3fdda7cb250b4dba99527a47cdec9dd6 [2023-08-25 00:47:27,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 00:47:27,662 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 00:47:27,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 00:47:27,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 00:47:27,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 00:47:27,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:47:27" (1/1) ... [2023-08-25 00:47:27,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8e6da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:27, skipping insertion in model container [2023-08-25 00:47:27,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 12:47:27" (1/1) ... [2023-08-25 00:47:27,737 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 00:47:28,131 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 00:47:28,147 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 00:47:28,176 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-25 00:47:28,178 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-25 00:47:28,231 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 00:47:28,269 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 00:47:28,269 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 00:47:28,275 INFO L206 MainTranslator]: Completed translation [2023-08-25 00:47:28,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28 WrapperNode [2023-08-25 00:47:28,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 00:47:28,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 00:47:28,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 00:47:28,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 00:47:28,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,343 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 489 [2023-08-25 00:47:28,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 00:47:28,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 00:47:28,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 00:47:28,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 00:47:28,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,361 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 00:47:28,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 00:47:28,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 00:47:28,400 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 00:47:28,400 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (1/1) ... [2023-08-25 00:47:28,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 00:47:28,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 00:47:28,427 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 00:47:28,458 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 00:47:28,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 00:47:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 00:47:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 00:47:28,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 00:47:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 00:47:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-25 00:47:28,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-25 00:47:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-25 00:47:28,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-25 00:47:28,473 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-25 00:47:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-25 00:47:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 00:47:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 00:47:28,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 00:47:28,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 00:47:28,477 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 00:47:28,664 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 00:47:28,665 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 00:47:29,635 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 00:48:24,009 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 00:48:24,009 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-25 00:48:24,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:48:24 BoogieIcfgContainer [2023-08-25 00:48:24,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 00:48:24,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 00:48:24,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 00:48:24,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 00:48:24,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 12:47:27" (1/3) ... [2023-08-25 00:48:24,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb06268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:48:24, skipping insertion in model container [2023-08-25 00:48:24,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 12:47:28" (2/3) ... [2023-08-25 00:48:24,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb06268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 12:48:24, skipping insertion in model container [2023-08-25 00:48:24,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 12:48:24" (3/3) ... [2023-08-25 00:48:24,021 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-25 00:48:24,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 00:48:24,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 219 error locations. [2023-08-25 00:48:24,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 00:48:30,706 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 00:48:30,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 340 places, 333 transitions, 681 flow [2023-08-25 00:48:33,375 INFO L124 PetriNetUnfolderBase]: 3/330 cut-off events. [2023-08-25 00:48:33,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 00:48:33,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 330 events. 3/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 1747 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2023-08-25 00:48:33,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 340 places, 333 transitions, 681 flow [2023-08-25 00:48:33,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 337 places, 330 transitions, 669 flow [2023-08-25 00:48:33,407 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 00:48:33,413 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 337 places, 330 transitions, 669 flow [2023-08-25 00:48:33,416 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 337 places, 330 transitions, 669 flow [2023-08-25 00:48:33,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 330 transitions, 669 flow [2023-08-25 00:48:35,520 INFO L124 PetriNetUnfolderBase]: 3/330 cut-off events. [2023-08-25 00:48:35,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 00:48:35,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 330 events. 3/330 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 1749 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 293. Up to 2 conditions per place. [2023-08-25 00:48:35,545 INFO L119 LiptonReduction]: Number of co-enabled transitions 58076 [2023-08-25 00:48:49,595 INFO L134 LiptonReduction]: Checked pairs total: 536980 [2023-08-25 00:48:49,596 INFO L136 LiptonReduction]: Total number of compositions: 183 [2023-08-25 00:48:49,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 00:48:49,610 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;@5fe934dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 00:48:49,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 404 error locations. [2023-08-25 00:48:49,612 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 00:48:49,612 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-25 00:48:49,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 00:48:49,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:48:49,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-25 00:48:49,614 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONDATA_RACE === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:48:49,618 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:48:49,618 INFO L85 PathProgramCache]: Analyzing trace with hash 6120923, now seen corresponding path program 1 times [2023-08-25 00:48:49,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:48:49,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832764749] [2023-08-25 00:48:49,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:48:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:48:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:48:49,973 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 00:48:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:48:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832764749] [2023-08-25 00:48:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832764749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:48:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:48:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 00:48:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541501470] [2023-08-25 00:48:49,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:48:49,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 00:48:49,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:48:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 00:48:50,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 00:48:50,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 516 [2023-08-25 00:48:50,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 240 transitions, 489 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:48:50,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:48:50,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 516 [2023-08-25 00:48:50,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 00:51:36,826 INFO L124 PetriNetUnfolderBase]: 1393/2050 cut-off events. [2023-08-25 00:51:36,827 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-25 00:51:36,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4163 conditions, 2050 events. 1393/2050 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8427 event pairs, 1393 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 4152. Up to 2051 conditions per place. [2023-08-25 00:51:36,837 INFO L140 encePairwiseOnDemand]: 298/516 looper letters, 22 selfloop transitions, 0 changer transitions 0/22 dead transitions. [2023-08-25 00:51:36,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 97 flow [2023-08-25 00:51:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 00:51:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 00:51:36,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 432 transitions. [2023-08-25 00:51:36,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186046511627907 [2023-08-25 00:51:36,851 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 432 transitions. [2023-08-25 00:51:36,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 432 transitions. [2023-08-25 00:51:36,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 00:51:36,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 432 transitions. [2023-08-25 00:51:36,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.0) internal successors, (432), 2 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:51:36,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:51:36,863 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:51:36,864 INFO L175 Difference]: Start difference. First operand has 249 places, 240 transitions, 489 flow. Second operand 2 states and 432 transitions. [2023-08-25 00:51:36,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 97 flow [2023-08-25 00:51:36,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-25 00:51:36,868 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 50 flow [2023-08-25 00:51:36,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-25 00:51:36,873 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -219 predicate places. [2023-08-25 00:51:36,873 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 50 flow [2023-08-25 00:51:36,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:51:36,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:51:36,873 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 00:51:36,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 00:51:36,874 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err8ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:51:36,874 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:51:36,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1587523600, now seen corresponding path program 1 times [2023-08-25 00:51:36,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:51:36,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775194449] [2023-08-25 00:51:36,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:51:36,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:51:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:51:37,261 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 00:51:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:51:37,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775194449] [2023-08-25 00:51:37,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775194449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:51:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:51:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 00:51:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701733799] [2023-08-25 00:51:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:51:37,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 00:51:37,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:51:37,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 00:51:37,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 00:51:37,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 516 [2023-08-25 00:51:37,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:51:37,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:51:37,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 516 [2023-08-25 00:51:37,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 00:53:55,567 INFO L124 PetriNetUnfolderBase]: 1144/1693 cut-off events. [2023-08-25 00:53:55,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 00:53:55,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3439 conditions, 1693 events. 1144/1693 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7417 event pairs, 148 based on Foata normal form. 0/1593 useless extension candidates. Maximal degree in co-relation 3436. Up to 1429 conditions per place. [2023-08-25 00:53:55,573 INFO L140 encePairwiseOnDemand]: 513/516 looper letters, 30 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-08-25 00:53:55,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 34 transitions, 144 flow [2023-08-25 00:53:55,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 00:53:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 00:53:55,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-25 00:53:55,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20671834625322996 [2023-08-25 00:53:55,581 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-25 00:53:55,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-25 00:53:55,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 00:53:55,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-25 00:53:55,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:53:55,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:53:55,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:53:55,589 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 50 flow. Second operand 3 states and 320 transitions. [2023-08-25 00:53:55,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 34 transitions, 144 flow [2023-08-25 00:53:55,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 144 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 00:53:55,590 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 50 flow [2023-08-25 00:53:55,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-25 00:53:55,591 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -218 predicate places. [2023-08-25 00:53:55,592 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 50 flow [2023-08-25 00:53:55,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:53:55,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:53:55,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 00:53:55,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 00:53:55,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:53:55,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:53:55,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1222857447, now seen corresponding path program 1 times [2023-08-25 00:53:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:53:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747483702] [2023-08-25 00:53:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:53:55,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:53:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:53:55,937 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 00:53:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:53:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747483702] [2023-08-25 00:53:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747483702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:53:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:53:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 00:53:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242348558] [2023-08-25 00:53:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:53:55,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 00:53:55,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:53:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 00:53:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 00:53:55,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 516 [2023-08-25 00:53:55,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:53:55,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:53:55,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 516 [2023-08-25 00:53:55,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 00:55:48,855 INFO L124 PetriNetUnfolderBase]: 844/1268 cut-off events. [2023-08-25 00:55:48,856 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-25 00:55:48,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2674 conditions, 1268 events. 844/1268 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5428 event pairs, 154 based on Foata normal form. 25/1293 useless extension candidates. Maximal degree in co-relation 2670. Up to 1077 conditions per place. [2023-08-25 00:55:48,864 INFO L140 encePairwiseOnDemand]: 513/516 looper letters, 32 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-25 00:55:48,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 152 flow [2023-08-25 00:55:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 00:55:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 00:55:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 320 transitions. [2023-08-25 00:55:48,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20671834625322996 [2023-08-25 00:55:48,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 320 transitions. [2023-08-25 00:55:48,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 320 transitions. [2023-08-25 00:55:48,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 00:55:48,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 320 transitions. [2023-08-25 00:55:48,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:55:48,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:55:48,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 516.0) internal successors, (2064), 4 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:55:48,871 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 50 flow. Second operand 3 states and 320 transitions. [2023-08-25 00:55:48,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 152 flow [2023-08-25 00:55:48,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 00:55:48,873 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 54 flow [2023-08-25 00:55:48,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-25 00:55:48,873 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -218 predicate places. [2023-08-25 00:55:48,873 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 54 flow [2023-08-25 00:55:48,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:55:48,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:55:48,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 00:55:48,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 00:55:48,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:55:48,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:55:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 746128388, now seen corresponding path program 1 times [2023-08-25 00:55:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:55:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808460037] [2023-08-25 00:55:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:55:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:55:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:55:49,153 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 00:55:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:55:49,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808460037] [2023-08-25 00:55:49,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808460037] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:55:49,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:55:49,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 00:55:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953418919] [2023-08-25 00:55:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:55:49,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 00:55:49,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:55:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 00:55:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 00:55:49,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 516 [2023-08-25 00:55:49,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:55:49,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:55:49,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 516 [2023-08-25 00:55:49,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 00:58:18,006 INFO L124 PetriNetUnfolderBase]: 1013/1542 cut-off events. [2023-08-25 00:58:18,007 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2023-08-25 00:58:18,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 1542 events. 1013/1542 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6302 event pairs, 305 based on Foata normal form. 75/1617 useless extension candidates. Maximal degree in co-relation 3354. Up to 565 conditions per place. [2023-08-25 00:58:18,011 INFO L140 encePairwiseOnDemand]: 512/516 looper letters, 31 selfloop transitions, 3 changer transitions 5/39 dead transitions. [2023-08-25 00:58:18,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 173 flow [2023-08-25 00:58:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 00:58:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 00:58:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-08-25 00:58:18,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20203488372093023 [2023-08-25 00:58:18,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-08-25 00:58:18,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-08-25 00:58:18,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 00:58:18,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-08-25 00:58:18,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:58:18,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:58:18,019 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:58:18,019 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 54 flow. Second operand 4 states and 417 transitions. [2023-08-25 00:58:18,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 173 flow [2023-08-25 00:58:18,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 00:58:18,020 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 64 flow [2023-08-25 00:58:18,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-25 00:58:18,021 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -215 predicate places. [2023-08-25 00:58:18,021 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 64 flow [2023-08-25 00:58:18,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:58:18,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:58:18,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 00:58:18,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 00:58:18,022 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:58:18,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:58:18,022 INFO L85 PathProgramCache]: Analyzing trace with hash -322633400, now seen corresponding path program 1 times [2023-08-25 00:58:18,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:58:18,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067984808] [2023-08-25 00:58:18,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:58:18,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:58:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:58:18,287 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 00:58:18,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:58:18,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067984808] [2023-08-25 00:58:18,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067984808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:58:18,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:58:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 00:58:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331718221] [2023-08-25 00:58:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:58:18,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 00:58:18,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:58:18,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 00:58:18,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 00:58:18,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 516 [2023-08-25 00:58:18,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:58:18,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:58:18,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 516 [2023-08-25 00:58:18,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 00:59:41,628 INFO L124 PetriNetUnfolderBase]: 647/1014 cut-off events. [2023-08-25 00:59:41,629 INFO L125 PetriNetUnfolderBase]: For 485/485 co-relation queries the response was YES. [2023-08-25 00:59:41,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2395 conditions, 1014 events. 647/1014 cut-off events. For 485/485 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4262 event pairs, 221 based on Foata normal form. 45/1059 useless extension candidates. Maximal degree in co-relation 2388. Up to 409 conditions per place. [2023-08-25 00:59:41,631 INFO L140 encePairwiseOnDemand]: 512/516 looper letters, 25 selfloop transitions, 3 changer transitions 13/41 dead transitions. [2023-08-25 00:59:41,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 41 transitions, 206 flow [2023-08-25 00:59:41,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 00:59:41,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 00:59:41,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-08-25 00:59:41,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20300387596899225 [2023-08-25 00:59:41,633 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-08-25 00:59:41,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-08-25 00:59:41,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 00:59:41,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-08-25 00:59:41,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:59:41,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:59:41,640 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 516.0) internal successors, (2580), 5 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:59:41,640 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 64 flow. Second operand 4 states and 419 transitions. [2023-08-25 00:59:41,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 41 transitions, 206 flow [2023-08-25 00:59:41,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 180 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-25 00:59:41,644 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 64 flow [2023-08-25 00:59:41,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-25 00:59:41,644 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -215 predicate places. [2023-08-25 00:59:41,645 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 64 flow [2023-08-25 00:59:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:59:41,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 00:59:41,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 00:59:41,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 00:59:41,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 00:59:41,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 00:59:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2040485477, now seen corresponding path program 1 times [2023-08-25 00:59:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 00:59:41,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529597026] [2023-08-25 00:59:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 00:59:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 00:59:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 00:59:42,026 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 00:59:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 00:59:42,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529597026] [2023-08-25 00:59:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529597026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 00:59:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 00:59:42,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 00:59:42,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804428548] [2023-08-25 00:59:42,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 00:59:42,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 00:59:42,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 00:59:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 00:59:42,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 00:59:42,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 516 [2023-08-25 00:59:42,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 00:59:42,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 00:59:42,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 516 [2023-08-25 00:59:42,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 01:00:16,283 INFO L124 PetriNetUnfolderBase]: 225/397 cut-off events. [2023-08-25 01:00:16,283 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-08-25 01:00:16,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932 conditions, 397 events. 225/397 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1494 event pairs, 45 based on Foata normal form. 44/441 useless extension candidates. Maximal degree in co-relation 925. Up to 247 conditions per place. [2023-08-25 01:00:16,284 INFO L140 encePairwiseOnDemand]: 510/516 looper letters, 27 selfloop transitions, 4 changer transitions 21/52 dead transitions. [2023-08-25 01:00:16,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 52 transitions, 253 flow [2023-08-25 01:00:16,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-25 01:00:16,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-25 01:00:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-25 01:00:16,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19728682170542636 [2023-08-25 01:00:16,286 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-25 01:00:16,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-25 01:00:16,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 01:00:16,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-25 01:00:16,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:16,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 516.0) internal successors, (3096), 6 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:16,290 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 516.0) internal successors, (3096), 6 states have internal predecessors, (3096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:16,290 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 64 flow. Second operand 5 states and 509 transitions. [2023-08-25 01:00:16,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 52 transitions, 253 flow [2023-08-25 01:00:16,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 52 transitions, 232 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-25 01:00:16,292 INFO L231 Difference]: Finished difference. Result has 37 places, 23 transitions, 88 flow [2023-08-25 01:00:16,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=23} [2023-08-25 01:00:16,293 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -212 predicate places. [2023-08-25 01:00:16,293 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 88 flow [2023-08-25 01:00:16,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:16,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 01:00:16,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 01:00:16,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 01:00:16,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 01:00:16,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 01:00:16,294 INFO L85 PathProgramCache]: Analyzing trace with hash 926430483, now seen corresponding path program 1 times [2023-08-25 01:00:16,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 01:00:16,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297333017] [2023-08-25 01:00:16,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 01:00:16,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 01:00:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 01:00:16,773 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 01:00:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 01:00:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297333017] [2023-08-25 01:00:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297333017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 01:00:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 01:00:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-25 01:00:16,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666253116] [2023-08-25 01:00:16,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 01:00:16,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-25 01:00:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 01:00:16,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-25 01:00:16,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 01:00:16,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 516 [2023-08-25 01:00:16,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:16,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 01:00:16,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 516 [2023-08-25 01:00:16,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 01:00:35,227 INFO L124 PetriNetUnfolderBase]: 105/211 cut-off events. [2023-08-25 01:00:35,227 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2023-08-25 01:00:35,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 211 events. 105/211 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 674 event pairs, 20 based on Foata normal form. 26/237 useless extension candidates. Maximal degree in co-relation 634. Up to 90 conditions per place. [2023-08-25 01:00:35,228 INFO L140 encePairwiseOnDemand]: 510/516 looper letters, 31 selfloop transitions, 7 changer transitions 17/55 dead transitions. [2023-08-25 01:00:35,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 310 flow [2023-08-25 01:00:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 01:00:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 01:00:35,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 603 transitions. [2023-08-25 01:00:35,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19476744186046513 [2023-08-25 01:00:35,230 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 603 transitions. [2023-08-25 01:00:35,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 603 transitions. [2023-08-25 01:00:35,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 01:00:35,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 603 transitions. [2023-08-25 01:00:35,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.5) internal successors, (603), 6 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:35,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:35,236 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 516.0) internal successors, (3612), 7 states have internal predecessors, (3612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:35,236 INFO L175 Difference]: Start difference. First operand has 37 places, 23 transitions, 88 flow. Second operand 6 states and 603 transitions. [2023-08-25 01:00:35,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 310 flow [2023-08-25 01:00:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 304 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-25 01:00:35,238 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 138 flow [2023-08-25 01:00:35,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-08-25 01:00:35,239 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -208 predicate places. [2023-08-25 01:00:35,239 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 138 flow [2023-08-25 01:00:35,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.2) internal successors, (471), 5 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:35,239 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 01:00:35,239 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 01:00:35,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 01:00:35,239 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 01:00:35,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 01:00:35,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2123735251, now seen corresponding path program 1 times [2023-08-25 01:00:35,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 01:00:35,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101266894] [2023-08-25 01:00:35,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 01:00:35,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 01:00:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 01:00:35,992 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 01:00:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 01:00:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101266894] [2023-08-25 01:00:35,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101266894] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 01:00:35,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 01:00:35,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 01:00:35,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886409362] [2023-08-25 01:00:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 01:00:35,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 01:00:35,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 01:00:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 01:00:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-25 01:00:35,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 516 [2023-08-25 01:00:35,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 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 01:00:35,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 01:00:35,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 516 [2023-08-25 01:00:35,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 01:00:48,272 INFO L124 PetriNetUnfolderBase]: 58/126 cut-off events. [2023-08-25 01:00:48,273 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2023-08-25 01:00:48,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 126 events. 58/126 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 17 based on Foata normal form. 8/134 useless extension candidates. Maximal degree in co-relation 423. Up to 49 conditions per place. [2023-08-25 01:00:48,273 INFO L140 encePairwiseOnDemand]: 510/516 looper letters, 28 selfloop transitions, 10 changer transitions 8/46 dead transitions. [2023-08-25 01:00:48,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 305 flow [2023-08-25 01:00:48,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 01:00:48,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 01:00:48,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-08-25 01:00:48,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18964562569213733 [2023-08-25 01:00:48,276 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-08-25 01:00:48,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-08-25 01:00:48,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 01:00:48,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-08-25 01:00:48,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:48,282 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:48,282 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 516.0) internal successors, (4128), 8 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 01:00:48,282 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 138 flow. Second operand 7 states and 685 transitions. [2023-08-25 01:00:48,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 305 flow [2023-08-25 01:00:48,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 262 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-25 01:00:48,285 INFO L231 Difference]: Finished difference. Result has 43 places, 26 transitions, 136 flow [2023-08-25 01:00:48,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=516, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=26} [2023-08-25 01:00:48,285 INFO L281 CegarLoopForPetriNet]: 249 programPoint places, -206 predicate places. [2023-08-25 01:00:48,285 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 26 transitions, 136 flow [2023-08-25 01:00:48,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.0) internal successors, (564), 6 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 01:00:48,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 01:00:48,286 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 01:00:48,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 01:00:48,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONDATA_RACE, P0Err1ASSERT_VIOLATIONDATA_RACE, P0Err2ASSERT_VIOLATIONDATA_RACE, P0Err3ASSERT_VIOLATIONDATA_RACE (and 400 more)] === [2023-08-25 01:00:48,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 01:00:48,287 INFO L85 PathProgramCache]: Analyzing trace with hash 82946870, now seen corresponding path program 1 times [2023-08-25 01:00:48,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 01:00:48,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539456340] [2023-08-25 01:00:48,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 01:00:48,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 01:00:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-08-25 01:01:24,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 01:01:24,483 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:152) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:283) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-25 01:01:24,486 INFO L158 Benchmark]: Toolchain (without parser) took 836823.90ms. Allocated memory was 369.1MB in the beginning and 11.5GB in the end (delta: 11.1GB). Free memory was 344.2MB in the beginning and 7.9GB in the end (delta: -7.5GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-25 01:01:24,486 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory was 347.3MB in the beginning and 347.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-25 01:01:24,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 611.33ms. Allocated memory is still 369.1MB. Free memory was 344.2MB in the beginning and 318.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-25 01:01:24,487 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.73ms. Allocated memory is still 369.1MB. Free memory was 318.5MB in the beginning and 314.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 01:01:24,487 INFO L158 Benchmark]: Boogie Preprocessor took 54.88ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 310.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-25 01:01:24,488 INFO L158 Benchmark]: RCFGBuilder took 55611.98ms. Allocated memory was 369.1MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 310.7MB in the beginning and 9.8GB in the end (delta: -9.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-25 01:01:24,488 INFO L158 Benchmark]: TraceAbstraction took 780469.96ms. Allocated memory was 10.3GB in the beginning and 11.5GB in the end (delta: 1.2GB). Free memory was 9.8GB in the beginning and 7.9GB in the end (delta: 1.9GB). Peak memory consumption was 4.4GB. Max. memory is 16.0GB. [2023-08-25 01:01:24,490 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 369.1MB. Free memory was 347.3MB in the beginning and 347.2MB in the end (delta: 86.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 611.33ms. Allocated memory is still 369.1MB. Free memory was 344.2MB in the beginning and 318.5MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.73ms. Allocated memory is still 369.1MB. Free memory was 318.5MB in the beginning and 314.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 54.88ms. Allocated memory is still 369.1MB. Free memory was 314.8MB in the beginning and 310.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 55611.98ms. Allocated memory was 369.1MB in the beginning and 10.3GB in the end (delta: 9.9GB). Free memory was 310.7MB in the beginning and 9.8GB in the end (delta: -9.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * TraceAbstraction took 780469.96ms. Allocated memory was 10.3GB in the beginning and 11.5GB in the end (delta: 1.2GB). Free memory was 9.8GB in the beginning and 7.9GB in the end (delta: 1.9GB). Peak memory consumption was 4.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.2s, 337 PlacesBefore, 249 PlacesAfterwards, 330 TransitionsBefore, 240 TransitionsAfterwards, 58076 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 132 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 183 TotalNumberOfCompositions, 536980 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 159772, independent: 156824, independent conditional: 0, independent unconditional: 156824, dependent: 2948, dependent conditional: 0, dependent unconditional: 2948, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 19976, independent: 19361, independent conditional: 0, independent unconditional: 19361, dependent: 615, dependent conditional: 0, dependent unconditional: 615, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 159772, independent: 137463, independent conditional: 0, independent unconditional: 137463, dependent: 2333, dependent conditional: 0, dependent unconditional: 2333, unknown: 19976, unknown conditional: 0, unknown unconditional: 19976] , Statistics on independence cache: Total cache size (in pairs): 6803, Positive cache size: 6515, Positive conditional cache size: 0, Positive unconditional cache size: 6515, Negative cache size: 288, Negative conditional cache size: 0, Negative unconditional cache size: 288, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkResolutionNode(Interpolator.java:275) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown