/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:14:23,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:14:23,845 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-SemanticLbe.epf [2023-11-17 15:14:23,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:14:23,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:14:23,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:14:23,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:14:23,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:14:23,890 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:14:23,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:14:23,891 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:14:23,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:14:23,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:14:23,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:14:23,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:14:23,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:14:23,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:14:23,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:14:23,894 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:14:23,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:14:23,894 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:14:23,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:14:23,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:14:23,896 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:14:23,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:14:23,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:23,896 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:14:23,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:14:23,897 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:14:23,897 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:14:23,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:14:23,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:14:23,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2023-11-17 15:14:24,161 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:14:24,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:14:24,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:14:24,191 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:14:24,192 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:14:24,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:25,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:14:25,830 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:14:25,831 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:25,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4437fb92b/7f66153c14d94dab8f62615b8480ba1d/FLAGde2fe9aa9 [2023-11-17 15:14:25,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4437fb92b/7f66153c14d94dab8f62615b8480ba1d [2023-11-17 15:14:25,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:14:25,866 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:14:25,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:25,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:14:25,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:14:25,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:25" (1/1) ... [2023-11-17 15:14:25,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461452d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:25, skipping insertion in model container [2023-11-17 15:14:25,873 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:14:25" (1/1) ... [2023-11-17 15:14:25,924 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:14:26,064 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:14:26,275 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:26,290 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:14:26,304 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 15:14:26,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:14:26,389 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:26,390 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 15:14:26,395 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:14:26,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26 WrapperNode [2023-11-17 15:14:26,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:14:26,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:26,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:14:26,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:14:26,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,418 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,444 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2023-11-17 15:14:26,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:14:26,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:14:26,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:14:26,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:14:26,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,465 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:14:26,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:14:26,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:14:26,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:14:26,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (1/1) ... [2023-11-17 15:14:26,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:14:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:14:26,524 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-11-17 15:14:26,531 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-11-17 15:14:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:14:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 15:14:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:14:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:14:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 15:14:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 15:14:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 15:14:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 15:14:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:14:26,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:14:26,555 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:14:26,680 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:14:26,682 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:14:26,995 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:14:27,117 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:14:27,117 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 15:14:27,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:27 BoogieIcfgContainer [2023-11-17 15:14:27,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:14:27,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:14:27,122 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:14:27,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:14:27,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:14:25" (1/3) ... [2023-11-17 15:14:27,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:27, skipping insertion in model container [2023-11-17 15:14:27,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:14:26" (2/3) ... [2023-11-17 15:14:27,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d74c9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:14:27, skipping insertion in model container [2023-11-17 15:14:27,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:14:27" (3/3) ... [2023-11-17 15:14:27,128 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 15:14:27,144 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:14:27,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 15:14:27,145 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:14:27,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 15:14:27,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 113 transitions, 238 flow [2023-11-17 15:14:27,314 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-11-17 15:14:27,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:27,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:14:27,320 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 113 transitions, 238 flow [2023-11-17 15:14:27,323 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 110 transitions, 229 flow [2023-11-17 15:14:27,326 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:14:27,337 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 110 transitions, 229 flow [2023-11-17 15:14:27,339 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 110 transitions, 229 flow [2023-11-17 15:14:27,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 110 transitions, 229 flow [2023-11-17 15:14:27,363 INFO L124 PetriNetUnfolderBase]: 3/110 cut-off events. [2023-11-17 15:14:27,363 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:27,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 3/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-11-17 15:14:27,366 INFO L119 LiptonReduction]: Number of co-enabled transitions 2316 [2023-11-17 15:14:31,017 INFO L134 LiptonReduction]: Checked pairs total: 5554 [2023-11-17 15:14:31,018 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-11-17 15:14:31,070 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:14:31,080 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=LoopHeads, 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;@50fec7a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:14:31,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 15:14:31,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:14:31,085 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-17 15:14:31,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 15:14:31,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:31,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 15:14:31,086 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:31,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 490324, now seen corresponding path program 1 times [2023-11-17 15:14:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898788862] [2023-11-17 15:14:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:31,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:31,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:31,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898788862] [2023-11-17 15:14:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898788862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:31,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:31,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:14:31,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855814298] [2023-11-17 15:14:31,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:31,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:31,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 212 [2023-11-17 15:14:31,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:31,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:31,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 212 [2023-11-17 15:14:31,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:32,068 INFO L124 PetriNetUnfolderBase]: 1079/1634 cut-off events. [2023-11-17 15:14:32,068 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 15:14:32,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 1634 events. 1079/1634 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7389 event pairs, 481 based on Foata normal form. 0/1549 useless extension candidates. Maximal degree in co-relation 3270. Up to 1297 conditions per place. [2023-11-17 15:14:32,089 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 33 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-17 15:14:32,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 169 flow [2023-11-17 15:14:32,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-11-17 15:14:32,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251572327044025 [2023-11-17 15:14:32,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-11-17 15:14:32,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-11-17 15:14:32,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:32,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-11-17 15:14:32,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,129 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 334 transitions. [2023-11-17 15:14:32,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 169 flow [2023-11-17 15:14:32,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 15:14:32,139 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 56 flow [2023-11-17 15:14:32,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 15:14:32,147 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-11-17 15:14:32,147 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 56 flow [2023-11-17 15:14:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:32,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:32,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:14:32,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:32,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:32,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1883613161, now seen corresponding path program 1 times [2023-11-17 15:14:32,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:32,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109655020] [2023-11-17 15:14:32,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:32,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109655020] [2023-11-17 15:14:32,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109655020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:32,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:32,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:32,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132673916] [2023-11-17 15:14:32,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:32,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:32,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:32,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:32,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:32,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:33,076 INFO L124 PetriNetUnfolderBase]: 3262/4867 cut-off events. [2023-11-17 15:14:33,077 INFO L125 PetriNetUnfolderBase]: For 279/279 co-relation queries the response was YES. [2023-11-17 15:14:33,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10086 conditions, 4867 events. 3262/4867 cut-off events. For 279/279 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 25217 event pairs, 950 based on Foata normal form. 258/5125 useless extension candidates. Maximal degree in co-relation 10076. Up to 2242 conditions per place. [2023-11-17 15:14:33,097 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 34 selfloop transitions, 7 changer transitions 27/68 dead transitions. [2023-11-17 15:14:33,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 68 transitions, 290 flow [2023-11-17 15:14:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 500 transitions. [2023-11-17 15:14:33,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2023-11-17 15:14:33,100 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 500 transitions. [2023-11-17 15:14:33,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 500 transitions. [2023-11-17 15:14:33,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:33,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 500 transitions. [2023-11-17 15:14:33,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.0) internal successors, (500), 5 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:33,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:33,107 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:33,107 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 56 flow. Second operand 5 states and 500 transitions. [2023-11-17 15:14:33,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 68 transitions, 290 flow [2023-11-17 15:14:33,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 68 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:33,110 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 122 flow [2023-11-17 15:14:33,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-11-17 15:14:33,111 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2023-11-17 15:14:33,112 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 122 flow [2023-11-17 15:14:33,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:33,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:33,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:33,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:14:33,114 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:33,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:33,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1737500771, now seen corresponding path program 1 times [2023-11-17 15:14:33,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:33,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963626540] [2023-11-17 15:14:33,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:33,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963626540] [2023-11-17 15:14:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963626540] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:33,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:33,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47979756] [2023-11-17 15:14:33,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:33,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:33,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:33,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:33,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:33,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:33,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:33,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:33,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:33,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:33,966 INFO L124 PetriNetUnfolderBase]: 2840/4302 cut-off events. [2023-11-17 15:14:33,966 INFO L125 PetriNetUnfolderBase]: For 3597/3597 co-relation queries the response was YES. [2023-11-17 15:14:33,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11864 conditions, 4302 events. 2840/4302 cut-off events. For 3597/3597 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 21943 event pairs, 544 based on Foata normal form. 253/4555 useless extension candidates. Maximal degree in co-relation 11850. Up to 1679 conditions per place. [2023-11-17 15:14:33,993 INFO L140 encePairwiseOnDemand]: 204/212 looper letters, 45 selfloop transitions, 7 changer transitions 38/90 dead transitions. [2023-11-17 15:14:33,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 90 transitions, 526 flow [2023-11-17 15:14:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-11-17 15:14:33,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4615902964959569 [2023-11-17 15:14:33,996 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-11-17 15:14:33,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-11-17 15:14:33,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:33,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-11-17 15:14:33,998 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-11-17 15:14:34,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,001 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,002 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 122 flow. Second operand 7 states and 685 transitions. [2023-11-17 15:14:34,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 90 transitions, 526 flow [2023-11-17 15:14:34,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 90 transitions, 484 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:34,018 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 166 flow [2023-11-17 15:14:34,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2023-11-17 15:14:34,019 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2023-11-17 15:14:34,019 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 166 flow [2023-11-17 15:14:34,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.2) internal successors, (441), 5 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:34,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:34,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 15:14:34,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:34,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 581119475, now seen corresponding path program 1 times [2023-11-17 15:14:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:34,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613500170] [2023-11-17 15:14:34,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:34,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:34,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613500170] [2023-11-17 15:14:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613500170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632651343] [2023-11-17 15:14:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:34,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:34,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:34,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:34,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:34,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:34,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:34,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:34,768 INFO L124 PetriNetUnfolderBase]: 2593/3928 cut-off events. [2023-11-17 15:14:34,768 INFO L125 PetriNetUnfolderBase]: For 7792/7792 co-relation queries the response was YES. [2023-11-17 15:14:34,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11890 conditions, 3928 events. 2593/3928 cut-off events. For 7792/7792 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19846 event pairs, 371 based on Foata normal form. 166/4094 useless extension candidates. Maximal degree in co-relation 11870. Up to 1825 conditions per place. [2023-11-17 15:14:34,826 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 46 selfloop transitions, 15 changer transitions 29/90 dead transitions. [2023-11-17 15:14:34,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 90 transitions, 576 flow [2023-11-17 15:14:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:34,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 689 transitions. [2023-11-17 15:14:34,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2023-11-17 15:14:34,829 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 689 transitions. [2023-11-17 15:14:34,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 689 transitions. [2023-11-17 15:14:34,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:34,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 689 transitions. [2023-11-17 15:14:34,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.42857142857143) internal successors, (689), 7 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,835 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,835 INFO L175 Difference]: Start difference. First operand has 46 places, 32 transitions, 166 flow. Second operand 7 states and 689 transitions. [2023-11-17 15:14:34,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 90 transitions, 576 flow [2023-11-17 15:14:34,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 90 transitions, 560 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:34,852 INFO L231 Difference]: Finished difference. Result has 52 places, 38 transitions, 261 flow [2023-11-17 15:14:34,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2023-11-17 15:14:34,853 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2023-11-17 15:14:34,853 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 261 flow [2023-11-17 15:14:34,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:34,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:34,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:34,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:14:34,854 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:34,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:34,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1004784463, now seen corresponding path program 1 times [2023-11-17 15:14:34,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:34,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259547863] [2023-11-17 15:14:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:34,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:34,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:34,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259547863] [2023-11-17 15:14:34,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259547863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:34,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:34,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 15:14:34,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309369638] [2023-11-17 15:14:34,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:34,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:14:34,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:34,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:14:34,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:14:34,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-11-17 15:14:34,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 261 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-11-17 15:14:34,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:34,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-11-17 15:14:34,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:35,180 INFO L124 PetriNetUnfolderBase]: 870/1530 cut-off events. [2023-11-17 15:14:35,180 INFO L125 PetriNetUnfolderBase]: For 2861/2959 co-relation queries the response was YES. [2023-11-17 15:14:35,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4848 conditions, 1530 events. 870/1530 cut-off events. For 2861/2959 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8082 event pairs, 197 based on Foata normal form. 115/1633 useless extension candidates. Maximal degree in co-relation 4823. Up to 1204 conditions per place. [2023-11-17 15:14:35,192 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-11-17 15:14:35,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 448 flow [2023-11-17 15:14:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:14:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:14:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-11-17 15:14:35,194 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49842767295597484 [2023-11-17 15:14:35,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-11-17 15:14:35,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-11-17 15:14:35,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:35,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-11-17 15:14:35,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,197 INFO L175 Difference]: Start difference. First operand has 52 places, 38 transitions, 261 flow. Second operand 3 states and 317 transitions. [2023-11-17 15:14:35,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 448 flow [2023-11-17 15:14:35,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 422 flow, removed 13 selfloop flow, removed 5 redundant places. [2023-11-17 15:14:35,206 INFO L231 Difference]: Finished difference. Result has 47 places, 41 transitions, 265 flow [2023-11-17 15:14:35,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=47, PETRI_TRANSITIONS=41} [2023-11-17 15:14:35,207 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 12 predicate places. [2023-11-17 15:14:35,207 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 265 flow [2023-11-17 15:14:35,207 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-11-17 15:14:35,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:35,207 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:35,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:14:35,208 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:35,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1580486245, now seen corresponding path program 1 times [2023-11-17 15:14:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534959945] [2023-11-17 15:14:35,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534959945] [2023-11-17 15:14:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534959945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:35,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804699311] [2023-11-17 15:14:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:35,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:35,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:35,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:35,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:35,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:35,814 INFO L124 PetriNetUnfolderBase]: 1655/2791 cut-off events. [2023-11-17 15:14:35,815 INFO L125 PetriNetUnfolderBase]: For 4915/4915 co-relation queries the response was YES. [2023-11-17 15:14:35,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9733 conditions, 2791 events. 1655/2791 cut-off events. For 4915/4915 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 15413 event pairs, 352 based on Foata normal form. 87/2878 useless extension candidates. Maximal degree in co-relation 9710. Up to 1129 conditions per place. [2023-11-17 15:14:35,833 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 58 selfloop transitions, 16 changer transitions 31/105 dead transitions. [2023-11-17 15:14:35,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 105 transitions, 774 flow [2023-11-17 15:14:35,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:14:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:14:35,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 688 transitions. [2023-11-17 15:14:35,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636118598382749 [2023-11-17 15:14:35,836 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 688 transitions. [2023-11-17 15:14:35,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 688 transitions. [2023-11-17 15:14:35,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:35,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 688 transitions. [2023-11-17 15:14:35,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.28571428571429) internal successors, (688), 7 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,841 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,841 INFO L175 Difference]: Start difference. First operand has 47 places, 41 transitions, 265 flow. Second operand 7 states and 688 transitions. [2023-11-17 15:14:35,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 105 transitions, 774 flow [2023-11-17 15:14:35,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 105 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:14:35,857 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 346 flow [2023-11-17 15:14:35,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-11-17 15:14:35,858 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-11-17 15:14:35,858 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 346 flow [2023-11-17 15:14:35,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:35,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:35,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:14:35,859 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:35,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:35,859 INFO L85 PathProgramCache]: Analyzing trace with hash 2023500972, now seen corresponding path program 1 times [2023-11-17 15:14:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:35,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038077685] [2023-11-17 15:14:35,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:35,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:35,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038077685] [2023-11-17 15:14:35,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038077685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:35,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:35,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:35,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792691531] [2023-11-17 15:14:35,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:35,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:35,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:35,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:35,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:35,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:35,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 346 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:35,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:35,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:35,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:36,535 INFO L124 PetriNetUnfolderBase]: 2026/3448 cut-off events. [2023-11-17 15:14:36,535 INFO L125 PetriNetUnfolderBase]: For 10343/10343 co-relation queries the response was YES. [2023-11-17 15:14:36,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 3448 events. 2026/3448 cut-off events. For 10343/10343 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20471 event pairs, 406 based on Foata normal form. 63/3511 useless extension candidates. Maximal degree in co-relation 12359. Up to 1646 conditions per place. [2023-11-17 15:14:36,557 INFO L140 encePairwiseOnDemand]: 203/212 looper letters, 55 selfloop transitions, 15 changer transitions 19/89 dead transitions. [2023-11-17 15:14:36,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 89 transitions, 757 flow [2023-11-17 15:14:36,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:36,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:36,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 498 transitions. [2023-11-17 15:14:36,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469811320754717 [2023-11-17 15:14:36,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 498 transitions. [2023-11-17 15:14:36,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 498 transitions. [2023-11-17 15:14:36,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:36,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 498 transitions. [2023-11-17 15:14:36,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.6) internal successors, (498), 5 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,563 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 346 flow. Second operand 5 states and 498 transitions. [2023-11-17 15:14:36,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 89 transitions, 757 flow [2023-11-17 15:14:36,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 89 transitions, 739 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:36,588 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 361 flow [2023-11-17 15:14:36,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-11-17 15:14:36,589 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2023-11-17 15:14:36,589 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 361 flow [2023-11-17 15:14:36,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:36,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:36,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:14:36,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:36,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:36,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1928651728, now seen corresponding path program 2 times [2023-11-17 15:14:36,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:36,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383931094] [2023-11-17 15:14:36,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:36,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383931094] [2023-11-17 15:14:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383931094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:36,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:36,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:14:36,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051787564] [2023-11-17 15:14:36,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:36,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:14:36,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:36,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:14:36,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:14:36,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-11-17 15:14:36,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 361 flow. Second operand has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:36,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-11-17 15:14:36,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:36,948 INFO L124 PetriNetUnfolderBase]: 568/1157 cut-off events. [2023-11-17 15:14:36,948 INFO L125 PetriNetUnfolderBase]: For 2394/2418 co-relation queries the response was YES. [2023-11-17 15:14:36,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3954 conditions, 1157 events. 568/1157 cut-off events. For 2394/2418 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6715 event pairs, 148 based on Foata normal form. 149/1290 useless extension candidates. Maximal degree in co-relation 3923. Up to 418 conditions per place. [2023-11-17 15:14:36,954 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 52 selfloop transitions, 7 changer transitions 7/75 dead transitions. [2023-11-17 15:14:36,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 75 transitions, 725 flow [2023-11-17 15:14:36,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 15:14:36,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 15:14:36,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-11-17 15:14:36,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988207547169811 [2023-11-17 15:14:36,957 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-11-17 15:14:36,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-11-17 15:14:36,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:36,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-11-17 15:14:36,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,960 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,960 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 361 flow. Second operand 4 states and 423 transitions. [2023-11-17 15:14:36,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 75 transitions, 725 flow [2023-11-17 15:14:36,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 75 transitions, 692 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 15:14:36,966 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 349 flow [2023-11-17 15:14:36,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=349, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-11-17 15:14:36,967 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2023-11-17 15:14:36,967 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 349 flow [2023-11-17 15:14:36,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.5) internal successors, (390), 4 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:36,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:36,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:36,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 15:14:36,968 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:36,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:36,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1534069294, now seen corresponding path program 1 times [2023-11-17 15:14:36,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:36,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062898128] [2023-11-17 15:14:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:37,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:37,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062898128] [2023-11-17 15:14:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062898128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:37,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 15:14:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203261186] [2023-11-17 15:14:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:37,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 15:14:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:37,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 15:14:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 15:14:37,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-11-17 15:14:37,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 349 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:37,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-11-17 15:14:37,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:37,343 INFO L124 PetriNetUnfolderBase]: 388/793 cut-off events. [2023-11-17 15:14:37,343 INFO L125 PetriNetUnfolderBase]: For 2024/2031 co-relation queries the response was YES. [2023-11-17 15:14:37,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3057 conditions, 793 events. 388/793 cut-off events. For 2024/2031 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4398 event pairs, 114 based on Foata normal form. 48/826 useless extension candidates. Maximal degree in co-relation 3025. Up to 318 conditions per place. [2023-11-17 15:14:37,348 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 33 selfloop transitions, 10 changer transitions 23/69 dead transitions. [2023-11-17 15:14:37,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 69 transitions, 646 flow [2023-11-17 15:14:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:14:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:14:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2023-11-17 15:14:37,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4877358490566038 [2023-11-17 15:14:37,350 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2023-11-17 15:14:37,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2023-11-17 15:14:37,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:37,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2023-11-17 15:14:37,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,355 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 349 flow. Second operand 5 states and 517 transitions. [2023-11-17 15:14:37,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 69 transitions, 646 flow [2023-11-17 15:14:37,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 586 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-17 15:14:37,363 INFO L231 Difference]: Finished difference. Result has 57 places, 29 transitions, 188 flow [2023-11-17 15:14:37,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=57, PETRI_TRANSITIONS=29} [2023-11-17 15:14:37,364 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2023-11-17 15:14:37,364 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 29 transitions, 188 flow [2023-11-17 15:14:37,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:37,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:37,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:37,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:14:37,368 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:37,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash 752888062, now seen corresponding path program 1 times [2023-11-17 15:14:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861589627] [2023-11-17 15:14:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:14:38,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:14:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:14:38,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861589627] [2023-11-17 15:14:38,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861589627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:14:38,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:14:38,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 15:14:38,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198881061] [2023-11-17 15:14:38,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:14:38,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 15:14:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:14:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 15:14:38,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-17 15:14:38,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 212 [2023-11-17 15:14:38,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 29 transitions, 188 flow. Second operand has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:38,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:14:38,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 212 [2023-11-17 15:14:38,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:14:38,259 INFO L124 PetriNetUnfolderBase]: 111/231 cut-off events. [2023-11-17 15:14:38,260 INFO L125 PetriNetUnfolderBase]: For 435/441 co-relation queries the response was YES. [2023-11-17 15:14:38,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 231 events. 111/231 cut-off events. For 435/441 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 791 event pairs, 7 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 856. Up to 125 conditions per place. [2023-11-17 15:14:38,261 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 32 selfloop transitions, 4 changer transitions 21/60 dead transitions. [2023-11-17 15:14:38,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 480 flow [2023-11-17 15:14:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:14:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:14:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 732 transitions. [2023-11-17 15:14:38,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43160377358490565 [2023-11-17 15:14:38,265 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 732 transitions. [2023-11-17 15:14:38,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 732 transitions. [2023-11-17 15:14:38,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:14:38,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 732 transitions. [2023-11-17 15:14:38,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 91.5) internal successors, (732), 8 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:38,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:38,270 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 212.0) internal successors, (1908), 9 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:38,270 INFO L175 Difference]: Start difference. First operand has 57 places, 29 transitions, 188 flow. Second operand 8 states and 732 transitions. [2023-11-17 15:14:38,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 480 flow [2023-11-17 15:14:38,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 344 flow, removed 25 selfloop flow, removed 18 redundant places. [2023-11-17 15:14:38,273 INFO L231 Difference]: Finished difference. Result has 48 places, 29 transitions, 122 flow [2023-11-17 15:14:38,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=48, PETRI_TRANSITIONS=29} [2023-11-17 15:14:38,275 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2023-11-17 15:14:38,275 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 29 transitions, 122 flow [2023-11-17 15:14:38,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.5) internal successors, (708), 8 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:14:38,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:14:38,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:38,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 15:14:38,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-11-17 15:14:38,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:14:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -685818074, now seen corresponding path program 2 times [2023-11-17 15:14:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:14:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255634376] [2023-11-17 15:14:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:14:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:14:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:38,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 15:14:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 15:14:38,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 15:14:38,431 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 15:14:38,432 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 15:14:38,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-11-17 15:14:38,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 15:14:38,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-11-17 15:14:38,434 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-11-17 15:14:38,435 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 15:14:38,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:14:38,435 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:14:38,440 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:14:38,440 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:14:38,491 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 15:14:38,492 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 15:14:38,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 15:14:38,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:14:38 BasicIcfg [2023-11-17 15:14:38,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:14:38,520 INFO L158 Benchmark]: Toolchain (without parser) took 12653.97ms. Allocated memory was 294.6MB in the beginning and 425.7MB in the end (delta: 131.1MB). Free memory was 240.6MB in the beginning and 328.4MB in the end (delta: -87.8MB). Peak memory consumption was 44.2MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,521 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 198.2MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:14:38,521 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.85ms. Allocated memory is still 294.6MB. Free memory was 240.6MB in the beginning and 217.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,522 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.01ms. Allocated memory is still 294.6MB. Free memory was 217.1MB in the beginning and 214.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,523 INFO L158 Benchmark]: Boogie Preprocessor took 37.23ms. Allocated memory is still 294.6MB. Free memory was 214.7MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,523 INFO L158 Benchmark]: RCFGBuilder took 635.29ms. Allocated memory is still 294.6MB. Free memory was 212.6MB in the beginning and 238.9MB in the end (delta: -26.4MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,523 INFO L158 Benchmark]: TraceAbstraction took 11398.24ms. Allocated memory was 294.6MB in the beginning and 425.7MB in the end (delta: 131.1MB). Free memory was 238.4MB in the beginning and 328.4MB in the end (delta: -90.0MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. [2023-11-17 15:14:38,524 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.19ms. Allocated memory is still 198.2MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 528.85ms. Allocated memory is still 294.6MB. Free memory was 240.6MB in the beginning and 217.1MB in the end (delta: 23.5MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.01ms. Allocated memory is still 294.6MB. Free memory was 217.1MB in the beginning and 214.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.23ms. Allocated memory is still 294.6MB. Free memory was 214.7MB in the beginning and 212.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 635.29ms. Allocated memory is still 294.6MB. Free memory was 212.6MB in the beginning and 238.9MB in the end (delta: -26.4MB). Peak memory consumption was 23.0MB. Max. memory is 8.0GB. * TraceAbstraction took 11398.24ms. Allocated memory was 294.6MB in the beginning and 425.7MB in the end (delta: 131.1MB). Free memory was 238.4MB in the beginning and 328.4MB in the end (delta: -90.0MB). Peak memory consumption was 41.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 117 PlacesBefore, 35 PlacesAfterwards, 110 TransitionsBefore, 26 TransitionsAfterwards, 2316 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 5554 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3077, independent: 2920, independent conditional: 0, independent unconditional: 2920, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1616, independent: 1571, independent conditional: 0, independent unconditional: 1571, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1616, independent: 1551, independent conditional: 0, independent unconditional: 1551, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 268, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3077, independent: 1349, independent conditional: 0, independent unconditional: 1349, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1616, unknown conditional: 0, unknown unconditional: 1616] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t745; [L837] FCALL, FORK 0 pthread_create(&t745, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L838] 0 pthread_t t746; [L839] FCALL, FORK 0 pthread_create(&t746, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L840] 0 pthread_t t747; [L841] FCALL, FORK 0 pthread_create(&t747, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L747] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L747] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t745={5:0}, t746={6:0}, t747={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 288 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 34 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=7, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 698 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-17 15:14:38,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...