/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 --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:24:03,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:24:03,838 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 11:24:03,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:24:03,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:24:03,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:24:03,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:24:03,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:24:03,860 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:24:03,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:24:03,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:24:03,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:24:03,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:24:03,861 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:24:03,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:24:03,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:24:03,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:24:03,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:24:03,863 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:24:03,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:24:03,863 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:24:03,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:24:03,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:24:03,865 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:24:03,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:24:03,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:03,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:24:03,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:24:03,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:24:03,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:24:03,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:24:03,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:24:03,867 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:24:04,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:24:04,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:24:04,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:24:04,114 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:24:04,114 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:24:04,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:05,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:24:05,403 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:24:05,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:05,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd6855f8/8084bb945cd542818cee4a0ad897ddcd/FLAG5bab0b995 [2023-11-17 11:24:05,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd6855f8/8084bb945cd542818cee4a0ad897ddcd [2023-11-17 11:24:05,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:24:05,431 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:24:05,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:05,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:24:05,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:24:05,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:05,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2602f2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05, skipping insertion in model container [2023-11-17 11:24:05,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:05,488 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:24:05,640 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:24:05,835 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:05,847 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:24:05,859 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/mix008_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-17 11:24:05,915 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:24:05,951 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:05,951 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:24:05,956 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:24:05,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05 WrapperNode [2023-11-17 11:24:05,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:24:05,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:05,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:24:05,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:24:05,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:05,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,027 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-17 11:24:06,028 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:24:06,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:24:06,029 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:24:06,029 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:24:06,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,047 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,049 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,050 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:24:06,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:24:06,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:24:06,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:24:06,055 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (1/1) ... [2023-11-17 11:24:06,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:24:06,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:24:06,083 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 11:24:06,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:24:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:24:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:24:06,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:24:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:24:06,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:24:06,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:24:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:24:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:24:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:24:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:24:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:24:06,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:24:06,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:24:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:24:06,090 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 11:24:06,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:24:06,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:24:06,123 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 11:24:06,270 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:24:06,271 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:24:06,577 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:24:06,709 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:24:06,710 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:24:06,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:06 BoogieIcfgContainer [2023-11-17 11:24:06,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:24:06,713 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:24:06,713 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:24:06,715 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:24:06,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:24:05" (1/3) ... [2023-11-17 11:24:06,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d5ef23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:06, skipping insertion in model container [2023-11-17 11:24:06,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:24:05" (2/3) ... [2023-11-17 11:24:06,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d5ef23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:24:06, skipping insertion in model container [2023-11-17 11:24:06,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:24:06" (3/3) ... [2023-11-17 11:24:06,717 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-17 11:24:06,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:24:06,733 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:24:06,733 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:24:06,773 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:24:06,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 51 transitions, 118 flow [2023-11-17 11:24:06,818 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-17 11:24:06,818 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:06,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 98 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-17 11:24:06,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 51 transitions, 118 flow [2023-11-17 11:24:06,826 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 47 transitions, 106 flow [2023-11-17 11:24:06,829 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:24:06,838 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 47 transitions, 106 flow [2023-11-17 11:24:06,840 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 47 transitions, 106 flow [2023-11-17 11:24:06,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 47 transitions, 106 flow [2023-11-17 11:24:06,850 INFO L124 PetriNetUnfolderBase]: 2/47 cut-off events. [2023-11-17 11:24:06,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:06,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 47 events. 2/47 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 97 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-17 11:24:06,852 INFO L119 LiptonReduction]: Number of co-enabled transitions 1374 [2023-11-17 11:24:07,785 INFO L134 LiptonReduction]: Checked pairs total: 4747 [2023-11-17 11:24:07,785 INFO L136 LiptonReduction]: Total number of compositions: 24 [2023-11-17 11:24:07,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:24:07,809 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;@530a9bf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:24:07,809 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:24:07,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:24:07,812 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-11-17 11:24:07,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:24:07,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:07,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-17 11:24:07,813 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:07,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 396064, now seen corresponding path program 1 times [2023-11-17 11:24:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943352439] [2023-11-17 11:24:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:08,105 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 11:24:08,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943352439] [2023-11-17 11:24:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943352439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:08,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999319080] [2023-11-17 11:24:08,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:08,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:08,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:08,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:08,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2023-11-17 11:24:08,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 11:24:08,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:08,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2023-11-17 11:24:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:08,999 INFO L124 PetriNetUnfolderBase]: 4903/6763 cut-off events. [2023-11-17 11:24:08,999 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-11-17 11:24:09,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13611 conditions, 6763 events. 4903/6763 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33657 event pairs, 2535 based on Foata normal form. 0/6416 useless extension candidates. Maximal degree in co-relation 13599. Up to 5335 conditions per place. [2023-11-17 11:24:09,041 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 41 selfloop transitions, 2 changer transitions 2/50 dead transitions. [2023-11-17 11:24:09,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 50 transitions, 211 flow [2023-11-17 11:24:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2023-11-17 11:24:09,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5422222222222223 [2023-11-17 11:24:09,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 122 transitions. [2023-11-17 11:24:09,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 122 transitions. [2023-11-17 11:24:09,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:09,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 122 transitions. [2023-11-17 11:24:09,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 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 11:24:09,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:09,058 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:09,060 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 122 transitions. [2023-11-17 11:24:09,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 50 transitions, 211 flow [2023-11-17 11:24:09,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:24:09,064 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 70 flow [2023-11-17 11:24:09,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 11:24:09,068 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-17 11:24:09,069 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 70 flow [2023-11-17 11:24:09,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 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 11:24:09,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:09,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:09,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:24:09,069 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:09,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:09,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1584465038, now seen corresponding path program 1 times [2023-11-17 11:24:09,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:09,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905630376] [2023-11-17 11:24:09,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:09,211 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 11:24:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905630376] [2023-11-17 11:24:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905630376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:09,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:09,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:24:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019568739] [2023-11-17 11:24:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:09,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:09,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:09,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 75 [2023-11-17 11:24:09,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 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 11:24:09,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:09,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 75 [2023-11-17 11:24:09,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:10,035 INFO L124 PetriNetUnfolderBase]: 4279/5908 cut-off events. [2023-11-17 11:24:10,036 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2023-11-17 11:24:10,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12332 conditions, 5908 events. 4279/5908 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 29267 event pairs, 1463 based on Foata normal form. 128/5983 useless extension candidates. Maximal degree in co-relation 12322. Up to 4033 conditions per place. [2023-11-17 11:24:10,074 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 34 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2023-11-17 11:24:10,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 166 flow [2023-11-17 11:24:10,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2023-11-17 11:24:10,078 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711111111111111 [2023-11-17 11:24:10,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 106 transitions. [2023-11-17 11:24:10,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 106 transitions. [2023-11-17 11:24:10,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:10,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 106 transitions. [2023-11-17 11:24:10,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 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 11:24:10,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:10,082 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:10,082 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 70 flow. Second operand 3 states and 106 transitions. [2023-11-17 11:24:10,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 166 flow [2023-11-17 11:24:10,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 40 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:10,084 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 74 flow [2023-11-17 11:24:10,085 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2023-11-17 11:24:10,085 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-17 11:24:10,086 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 74 flow [2023-11-17 11:24:10,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 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 11:24:10,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:10,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:10,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:24:10,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:10,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2044361443, now seen corresponding path program 1 times [2023-11-17 11:24:10,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:10,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055769001] [2023-11-17 11:24:10,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:10,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:10,310 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 11:24:10,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:10,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055769001] [2023-11-17 11:24:10,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055769001] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:10,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:10,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:10,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069010840] [2023-11-17 11:24:10,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:10,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:10,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:10,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:10,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2023-11-17 11:24:10,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 11:24:10,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:10,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2023-11-17 11:24:10,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:11,985 INFO L124 PetriNetUnfolderBase]: 15235/20712 cut-off events. [2023-11-17 11:24:11,986 INFO L125 PetriNetUnfolderBase]: For 1488/1488 co-relation queries the response was YES. [2023-11-17 11:24:12,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43763 conditions, 20712 events. 15235/20712 cut-off events. For 1488/1488 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 107496 event pairs, 2939 based on Foata normal form. 536/21248 useless extension candidates. Maximal degree in co-relation 43752. Up to 10161 conditions per place. [2023-11-17 11:24:12,067 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 58 selfloop transitions, 8 changer transitions 0/66 dead transitions. [2023-11-17 11:24:12,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 66 transitions, 290 flow [2023-11-17 11:24:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2023-11-17 11:24:12,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533333333333333 [2023-11-17 11:24:12,069 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 136 transitions. [2023-11-17 11:24:12,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 136 transitions. [2023-11-17 11:24:12,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:12,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 136 transitions. [2023-11-17 11:24:12,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 0 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 11:24:12,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:12,071 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:12,071 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 74 flow. Second operand 4 states and 136 transitions. [2023-11-17 11:24:12,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 66 transitions, 290 flow [2023-11-17 11:24:12,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 66 transitions, 282 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:12,092 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 131 flow [2023-11-17 11:24:12,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-17 11:24:12,092 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2023-11-17 11:24:12,093 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 131 flow [2023-11-17 11:24:12,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 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 11:24:12,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:12,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:12,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:24:12,093 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:12,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:12,094 INFO L85 PathProgramCache]: Analyzing trace with hash 849767613, now seen corresponding path program 1 times [2023-11-17 11:24:12,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:12,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709503401] [2023-11-17 11:24:12,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:12,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:12,301 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 11:24:12,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:12,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709503401] [2023-11-17 11:24:12,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709503401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:12,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:12,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:12,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444204189] [2023-11-17 11:24:12,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:12,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:12,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:12,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:12,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:12,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2023-11-17 11:24:12,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 11:24:12,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:12,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2023-11-17 11:24:12,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:14,282 INFO L124 PetriNetUnfolderBase]: 17095/23194 cut-off events. [2023-11-17 11:24:14,282 INFO L125 PetriNetUnfolderBase]: For 10364/10364 co-relation queries the response was YES. [2023-11-17 11:24:14,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58958 conditions, 23194 events. 17095/23194 cut-off events. For 10364/10364 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 123649 event pairs, 2089 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 58944. Up to 13129 conditions per place. [2023-11-17 11:24:14,408 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 63 selfloop transitions, 17 changer transitions 0/80 dead transitions. [2023-11-17 11:24:14,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 425 flow [2023-11-17 11:24:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:14,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 143 transitions. [2023-11-17 11:24:14,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766666666666667 [2023-11-17 11:24:14,413 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 143 transitions. [2023-11-17 11:24:14,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 143 transitions. [2023-11-17 11:24:14,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:14,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 143 transitions. [2023-11-17 11:24:14,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 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 11:24:14,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:14,416 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:14,416 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 131 flow. Second operand 4 states and 143 transitions. [2023-11-17 11:24:14,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 425 flow [2023-11-17 11:24:14,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 80 transitions, 421 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:14,440 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 255 flow [2023-11-17 11:24:14,440 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-11-17 11:24:14,442 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-17 11:24:14,442 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 255 flow [2023-11-17 11:24:14,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 11:24:14,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:14,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:14,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:24:14,442 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:14,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 750336482, now seen corresponding path program 1 times [2023-11-17 11:24:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474422820] [2023-11-17 11:24:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:14,546 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 11:24:14,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:14,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474422820] [2023-11-17 11:24:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474422820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:14,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:14,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:14,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490773245] [2023-11-17 11:24:14,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:14,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:14,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2023-11-17 11:24:14,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 11:24:14,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:14,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2023-11-17 11:24:14,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:15,736 INFO L124 PetriNetUnfolderBase]: 7503/11241 cut-off events. [2023-11-17 11:24:15,737 INFO L125 PetriNetUnfolderBase]: For 11933/12405 co-relation queries the response was YES. [2023-11-17 11:24:15,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30294 conditions, 11241 events. 7503/11241 cut-off events. For 11933/12405 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 69631 event pairs, 1658 based on Foata normal form. 492/11312 useless extension candidates. Maximal degree in co-relation 30276. Up to 9019 conditions per place. [2023-11-17 11:24:15,809 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 50 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2023-11-17 11:24:15,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 70 transitions, 469 flow [2023-11-17 11:24:15,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:15,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2023-11-17 11:24:15,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4622222222222222 [2023-11-17 11:24:15,811 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 104 transitions. [2023-11-17 11:24:15,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 104 transitions. [2023-11-17 11:24:15,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:15,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 104 transitions. [2023-11-17 11:24:15,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 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 11:24:15,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:15,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:15,812 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 255 flow. Second operand 3 states and 104 transitions. [2023-11-17 11:24:15,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 70 transitions, 469 flow [2023-11-17 11:24:15,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 11:24:15,816 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 288 flow [2023-11-17 11:24:15,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-11-17 11:24:15,817 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-17 11:24:15,817 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 288 flow [2023-11-17 11:24:15,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 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 11:24:15,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:15,817 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 11:24:15,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:24:15,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:15,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:15,818 INFO L85 PathProgramCache]: Analyzing trace with hash -853037772, now seen corresponding path program 1 times [2023-11-17 11:24:15,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:15,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898957072] [2023-11-17 11:24:15,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:15,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:15,969 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 11:24:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898957072] [2023-11-17 11:24:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898957072] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:15,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:15,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:24:15,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300275827] [2023-11-17 11:24:15,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:15,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:24:15,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:15,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:24:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:24:15,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 75 [2023-11-17 11:24:15,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 11:24:15,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:15,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 75 [2023-11-17 11:24:15,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:16,822 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L845: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse8 (not .cse5)) (.cse11 (and .cse5 (= (mod v_~a$w_buff1_used~0_149 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse4 (and .cse5 .cse10))) (let ((.cse1 (or .cse11 .cse12 .cse4)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_103 (ite .cse2 v_~a$w_buff0~0_79 v_~a$w_buff1~0_72))) (.cse6 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse7 (= (mod v_~a$w_buff0_used~0_161 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse1 v_~a$w_buff0_used~0_162 (ite .cse2 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_103 v_~a$mem_tmp~0_24) (= .cse3 v_~__unbuffered_p3_EBX~0_18) (= v_~a$w_buff1~0_72 v_~a$w_buff1~0_71) (= v_~a$w_buff0~0_79 v_~a$w_buff0~0_78) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_102 (ite .cse0 v_~a$mem_tmp~0_24 .cse3)) (= v_~a$r_buff0_thd4~0_75 (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd4~0_76 (ite (and .cse8 (not .cse7)) 0 v_~a$r_buff0_thd4~0_76)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse6) .cse7)) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse11 .cse4 .cse7) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148)))))) InVars {~a~0=v_~a~0_103, ~a$w_buff1~0=v_~a$w_buff1~0_72, ~a$w_buff0~0=v_~a$w_buff0~0_79, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_102, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$w_buff1~0=v_~a$w_buff1~0_71, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_78, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_40, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][59], [30#L881true, 6#L845true, Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 19#L806true, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:16,823 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:24:16,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:24:16,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:24:16,823 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:24:17,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L809-->L816: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_104) v_~a$w_buff0_used~0_103) (= v_~a~0_56 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_57))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0)))) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= v_~a$r_buff0_thd3~0_25 (ite .cse4 0 v_~a$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96)))) InVars {~a~0=v_~a~0_57, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_104, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_56, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][49], [30#L881true, Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, 21#L829true, 7#L816true, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,101 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L845: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse8 (not .cse5)) (.cse11 (and .cse5 (= (mod v_~a$w_buff1_used~0_149 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse4 (and .cse5 .cse10))) (let ((.cse1 (or .cse11 .cse12 .cse4)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_103 (ite .cse2 v_~a$w_buff0~0_79 v_~a$w_buff1~0_72))) (.cse6 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse7 (= (mod v_~a$w_buff0_used~0_161 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse1 v_~a$w_buff0_used~0_162 (ite .cse2 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_103 v_~a$mem_tmp~0_24) (= .cse3 v_~__unbuffered_p3_EBX~0_18) (= v_~a$w_buff1~0_72 v_~a$w_buff1~0_71) (= v_~a$w_buff0~0_79 v_~a$w_buff0~0_78) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_102 (ite .cse0 v_~a$mem_tmp~0_24 .cse3)) (= v_~a$r_buff0_thd4~0_75 (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd4~0_76 (ite (and .cse8 (not .cse7)) 0 v_~a$r_buff0_thd4~0_76)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse6) .cse7)) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse11 .cse4 .cse7) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148)))))) InVars {~a~0=v_~a~0_103, ~a$w_buff1~0=v_~a$w_buff1~0_72, ~a$w_buff0~0=v_~a$w_buff0~0_79, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_102, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$w_buff1~0=v_~a$w_buff1~0_71, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_78, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_40, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][59], [30#L881true, 3#L809true, Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 6#L845true, 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,102 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,102 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-17 11:24:17,246 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L809-->L816: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_104) v_~a$w_buff0_used~0_103) (= v_~a~0_56 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_57))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0)))) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= v_~a$r_buff0_thd3~0_25 (ite .cse4 0 v_~a$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96)))) InVars {~a~0=v_~a~0_57, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_104, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_56, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][49], [Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), 7#L816true, 21#L829true, P0Thread1of1ForFork1InUse, 46#L887true, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,246 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,246 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,246 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,246 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L845: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse8 (not .cse5)) (.cse11 (and .cse5 (= (mod v_~a$w_buff1_used~0_149 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse4 (and .cse5 .cse10))) (let ((.cse1 (or .cse11 .cse12 .cse4)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_103 (ite .cse2 v_~a$w_buff0~0_79 v_~a$w_buff1~0_72))) (.cse6 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse7 (= (mod v_~a$w_buff0_used~0_161 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse1 v_~a$w_buff0_used~0_162 (ite .cse2 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_103 v_~a$mem_tmp~0_24) (= .cse3 v_~__unbuffered_p3_EBX~0_18) (= v_~a$w_buff1~0_72 v_~a$w_buff1~0_71) (= v_~a$w_buff0~0_79 v_~a$w_buff0~0_78) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_102 (ite .cse0 v_~a$mem_tmp~0_24 .cse3)) (= v_~a$r_buff0_thd4~0_75 (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd4~0_76 (ite (and .cse8 (not .cse7)) 0 v_~a$r_buff0_thd4~0_76)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse6) .cse7)) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse11 .cse4 .cse7) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148)))))) InVars {~a~0=v_~a~0_103, ~a$w_buff1~0=v_~a$w_buff1~0_72, ~a$w_buff0~0=v_~a$w_buff0~0_79, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_102, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$w_buff1~0=v_~a$w_buff1~0_71, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_78, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_40, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][59], [Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 6#L845true, 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, 46#L887true, P1Thread1of1ForFork3InUse, 19#L806true, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,247 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is not cut-off event [2023-11-17 11:24:17,247 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-17 11:24:17,247 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-17 11:24:17,247 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is not cut-off event [2023-11-17 11:24:17,247 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([417] L829-->L845: Formula: (let ((.cse10 (= (mod v_~a$r_buff1_thd4~0_66 256) 0)) (.cse5 (= 0 (mod v_~a$r_buff0_thd4~0_76 256)))) (let ((.cse8 (not .cse5)) (.cse11 (and .cse5 (= (mod v_~a$w_buff1_used~0_149 256) 0))) (.cse12 (= (mod v_~a$w_buff0_used~0_162 256) 0)) (.cse4 (and .cse5 .cse10))) (let ((.cse1 (or .cse11 .cse12 .cse4)) (.cse2 (and .cse8 (not .cse12)))) (let ((.cse3 (ite .cse1 v_~a~0_103 (ite .cse2 v_~a$w_buff0~0_79 v_~a$w_buff1~0_72))) (.cse6 (= (mod v_~a$w_buff1_used~0_148 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_40 256) 0))) (.cse7 (= (mod v_~a$w_buff0_used~0_161 256) 0))) (and (= (ite .cse0 v_~a$w_buff0_used~0_162 (ite .cse1 v_~a$w_buff0_used~0_162 (ite .cse2 0 v_~a$w_buff0_used~0_162))) v_~a$w_buff0_used~0_161) (= v_~a~0_103 v_~a$mem_tmp~0_24) (= .cse3 v_~__unbuffered_p3_EBX~0_18) (= v_~a$w_buff1~0_72 v_~a$w_buff1~0_71) (= v_~a$w_buff0~0_79 v_~a$w_buff0~0_78) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_102 (ite .cse0 v_~a$mem_tmp~0_24 .cse3)) (= v_~a$r_buff0_thd4~0_75 (ite .cse0 v_~a$r_buff0_thd4~0_76 (ite (or .cse4 (and .cse5 .cse6) .cse7) v_~a$r_buff0_thd4~0_76 (ite (and .cse8 (not .cse7)) 0 v_~a$r_buff0_thd4~0_76)))) (= (ite .cse0 v_~a$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~a$r_buff0_thd4~0_75 256) 0))) (or (and .cse9 .cse10) (and .cse9 .cse6) .cse7)) v_~a$r_buff1_thd4~0_66 0)) v_~a$r_buff1_thd4~0_65) (= (ite .cse0 v_~a$w_buff1_used~0_149 (ite (or .cse11 .cse4 .cse7) v_~a$w_buff1_used~0_149 0)) v_~a$w_buff1_used~0_148)))))) InVars {~a~0=v_~a~0_103, ~a$w_buff1~0=v_~a$w_buff1~0_72, ~a$w_buff0~0=v_~a$w_buff0~0_79, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_66, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_162, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_149, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_76} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_65, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_161, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_75, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~a~0=v_~a~0_102, ~a$mem_tmp~0=v_~a$mem_tmp~0_24, ~weak$$choice0~0=v_~weak$$choice0~0_19, ~a$w_buff1~0=v_~a$w_buff1~0_71, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_78, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_148, ~weak$$choice2~0=v_~weak$$choice2~0_40, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet4, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork2_#t~nondet3][59], [3#L809true, Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 6#L845true, 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, 46#L887true, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,248 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,248 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,248 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,248 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-17 11:24:17,486 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L809-->L816: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_104) v_~a$w_buff0_used~0_103) (= v_~a~0_56 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_57))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0)))) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= v_~a$r_buff0_thd3~0_25 (ite .cse4 0 v_~a$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96)))) InVars {~a~0=v_~a~0_57, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_104, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_56, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][49], [Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, 7#L816true, 46#L887true, 22#L852true, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,487 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-17 11:24:17,487 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-17 11:24:17,487 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-17 11:24:17,487 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-17 11:24:17,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([411] L809-->L816: Formula: (let ((.cse2 (not (= (mod v_~a$w_buff0_used~0_103 256) 0))) (.cse3 (not (= (mod v_~a$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~a$r_buff0_thd3~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~a$w_buff0_used~0_104 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~a$w_buff1_used~0_97 256) 0)))) (.cse4 (and .cse2 .cse5))) (and (= (ite .cse0 0 v_~a$w_buff0_used~0_104) v_~a$w_buff0_used~0_103) (= v_~a~0_56 (ite .cse0 v_~a$w_buff0~0_36 (ite .cse1 v_~a$w_buff1~0_33 v_~a~0_57))) (= (ite (or (and (not (= (mod v_~a$r_buff0_thd3~0_25 256) 0)) .cse2) (and .cse3 (not (= (mod v_~a$w_buff1_used~0_96 256) 0)))) 0 v_~a$r_buff1_thd3~0_20) v_~a$r_buff1_thd3~0_19) (= v_~a$r_buff0_thd3~0_25 (ite .cse4 0 v_~a$r_buff0_thd3~0_26)) (= (ite (or .cse1 .cse4) 0 v_~a$w_buff1_used~0_97) v_~a$w_buff1_used~0_96)))) InVars {~a~0=v_~a~0_57, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_20, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_104, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_26, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_97} OutVars{~a~0=v_~a~0_56, ~a$w_buff1~0=v_~a$w_buff1~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_36, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_19, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_103, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_25, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_96} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd3~0, ~a$w_buff1_used~0][49], [Black: 71#(<= ~__unbuffered_p3_EAX~0 0), 97#(= ~x~0 1), Black: 77#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 76#(<= ~__unbuffered_p2_EAX~0 0), 74#true, 90#true, 49#L786true, Black: 85#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 84#(= ~x~0 0), P0Thread1of1ForFork1InUse, 7#L816true, 46#L887true, 11#P3EXITtrue, P1Thread1of1ForFork3InUse, 82#true, P2Thread1of1ForFork0InUse, Black: 92#(= ~__unbuffered_cnt~0 0), P3Thread1of1ForFork2InUse, 23#P0EXITtrue]) [2023-11-17 11:24:17,576 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-17 11:24:17,576 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-17 11:24:17,576 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-17 11:24:17,577 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-17 11:24:17,685 INFO L124 PetriNetUnfolderBase]: 11694/17513 cut-off events. [2023-11-17 11:24:17,685 INFO L125 PetriNetUnfolderBase]: For 22124/22707 co-relation queries the response was YES. [2023-11-17 11:24:17,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53887 conditions, 17513 events. 11694/17513 cut-off events. For 22124/22707 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 114025 event pairs, 4610 based on Foata normal form. 349/17181 useless extension candidates. Maximal degree in co-relation 53866. Up to 8598 conditions per place. [2023-11-17 11:24:17,782 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 56 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2023-11-17 11:24:17,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 522 flow [2023-11-17 11:24:17,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:24:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:24:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-17 11:24:17,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49777777777777776 [2023-11-17 11:24:17,784 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-17 11:24:17,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-17 11:24:17,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:17,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-17 11:24:17,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 11:24:17,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:17,786 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 11:24:17,786 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 288 flow. Second operand 3 states and 112 transitions. [2023-11-17 11:24:17,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 522 flow [2023-11-17 11:24:17,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:17,792 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 298 flow [2023-11-17 11:24:17,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-11-17 11:24:17,794 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-17 11:24:17,795 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 298 flow [2023-11-17 11:24:17,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 11:24:17,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:17,795 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 11:24:17,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:24:17,795 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:17,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:17,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2022721855, now seen corresponding path program 1 times [2023-11-17 11:24:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168446423] [2023-11-17 11:24:17,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:17,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:17,927 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 11:24:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:17,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168446423] [2023-11-17 11:24:17,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168446423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:17,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:17,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:24:17,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954124513] [2023-11-17 11:24:17,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:24:17,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:24:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:24:17,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2023-11-17 11:24:17,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 11:24:17,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:17,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2023-11-17 11:24:17,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:19,023 INFO L124 PetriNetUnfolderBase]: 5931/9383 cut-off events. [2023-11-17 11:24:19,023 INFO L125 PetriNetUnfolderBase]: For 10554/10721 co-relation queries the response was YES. [2023-11-17 11:24:19,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28321 conditions, 9383 events. 5931/9383 cut-off events. For 10554/10721 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 61701 event pairs, 1183 based on Foata normal form. 789/9812 useless extension candidates. Maximal degree in co-relation 28299. Up to 3986 conditions per place. [2023-11-17 11:24:19,133 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 69 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-11-17 11:24:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 674 flow [2023-11-17 11:24:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:24:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:24:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2023-11-17 11:24:19,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47 [2023-11-17 11:24:19,135 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 141 transitions. [2023-11-17 11:24:19,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 141 transitions. [2023-11-17 11:24:19,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:19,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 141 transitions. [2023-11-17 11:24:19,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 11:24:19,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:19,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:24:19,136 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 298 flow. Second operand 4 states and 141 transitions. [2023-11-17 11:24:19,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 674 flow [2023-11-17 11:24:19,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 92 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:24:19,149 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 343 flow [2023-11-17 11:24:19,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2023-11-17 11:24:19,150 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2023-11-17 11:24:19,150 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 343 flow [2023-11-17 11:24:19,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 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 11:24:19,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:19,150 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 11:24:19,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:24:19,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:19,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:19,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1316526168, now seen corresponding path program 1 times [2023-11-17 11:24:19,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:19,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489431528] [2023-11-17 11:24:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:19,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:19,355 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 11:24:19,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489431528] [2023-11-17 11:24:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489431528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572365853] [2023-11-17 11:24:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:19,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:19,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:19,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:19,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2023-11-17 11:24:19,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 343 flow. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 11:24:19,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:19,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2023-11-17 11:24:19,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:20,158 INFO L124 PetriNetUnfolderBase]: 4594/7239 cut-off events. [2023-11-17 11:24:20,158 INFO L125 PetriNetUnfolderBase]: For 11558/11669 co-relation queries the response was YES. [2023-11-17 11:24:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24626 conditions, 7239 events. 4594/7239 cut-off events. For 11558/11669 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 46380 event pairs, 1011 based on Foata normal form. 391/7308 useless extension candidates. Maximal degree in co-relation 24602. Up to 2783 conditions per place. [2023-11-17 11:24:20,203 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 82 selfloop transitions, 13 changer transitions 1/110 dead transitions. [2023-11-17 11:24:20,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 821 flow [2023-11-17 11:24:20,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:20,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:20,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-17 11:24:20,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693333333333333 [2023-11-17 11:24:20,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-17 11:24:20,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-17 11:24:20,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:20,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-17 11:24:20,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 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 11:24:20,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 11:24:20,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 11:24:20,206 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 343 flow. Second operand 5 states and 176 transitions. [2023-11-17 11:24:20,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 821 flow [2023-11-17 11:24:20,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 795 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:20,215 INFO L231 Difference]: Finished difference. Result has 60 places, 56 transitions, 387 flow [2023-11-17 11:24:20,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=319, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=60, PETRI_TRANSITIONS=56} [2023-11-17 11:24:20,216 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 16 predicate places. [2023-11-17 11:24:20,216 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 56 transitions, 387 flow [2023-11-17 11:24:20,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 11:24:20,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:20,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:20,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:24:20,217 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:20,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:20,217 INFO L85 PathProgramCache]: Analyzing trace with hash 479735879, now seen corresponding path program 1 times [2023-11-17 11:24:20,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:20,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508097709] [2023-11-17 11:24:20,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:20,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:20,438 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 11:24:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:20,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508097709] [2023-11-17 11:24:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508097709] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539812250] [2023-11-17 11:24:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:20,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:20,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:20,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 75 [2023-11-17 11:24:20,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 56 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 11:24:20,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:20,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 75 [2023-11-17 11:24:20,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:21,915 INFO L124 PetriNetUnfolderBase]: 11170/16687 cut-off events. [2023-11-17 11:24:21,916 INFO L125 PetriNetUnfolderBase]: For 37999/37999 co-relation queries the response was YES. [2023-11-17 11:24:21,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61658 conditions, 16687 events. 11170/16687 cut-off events. For 37999/37999 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 102302 event pairs, 1749 based on Foata normal form. 26/16713 useless extension candidates. Maximal degree in co-relation 61634. Up to 6403 conditions per place. [2023-11-17 11:24:21,994 INFO L140 encePairwiseOnDemand]: 65/75 looper letters, 85 selfloop transitions, 20 changer transitions 57/162 dead transitions. [2023-11-17 11:24:21,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 162 transitions, 1381 flow [2023-11-17 11:24:21,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:24:21,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:24:21,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2023-11-17 11:24:21,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-11-17 11:24:21,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 180 transitions. [2023-11-17 11:24:21,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 180 transitions. [2023-11-17 11:24:21,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:21,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 180 transitions. [2023-11-17 11:24:21,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 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 11:24:21,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 11:24:21,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 11:24:21,998 INFO L175 Difference]: Start difference. First operand has 60 places, 56 transitions, 387 flow. Second operand 5 states and 180 transitions. [2023-11-17 11:24:21,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 162 transitions, 1381 flow [2023-11-17 11:24:22,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 162 transitions, 1251 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-11-17 11:24:22,276 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 491 flow [2023-11-17 11:24:22,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=491, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-11-17 11:24:22,277 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 21 predicate places. [2023-11-17 11:24:22,277 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 491 flow [2023-11-17 11:24:22,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 0 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 11:24:22,277 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:22,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:22,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:24:22,278 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:22,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash -489863119, now seen corresponding path program 1 times [2023-11-17 11:24:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600212032] [2023-11-17 11:24:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:22,437 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 11:24:22,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:22,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600212032] [2023-11-17 11:24:22,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600212032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:22,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:24:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581689875] [2023-11-17 11:24:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:22,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:24:22,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:24:22,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:24:22,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 75 [2023-11-17 11:24:22,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 491 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 11:24:22,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:22,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 75 [2023-11-17 11:24:22,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:23,777 INFO L124 PetriNetUnfolderBase]: 8058/12592 cut-off events. [2023-11-17 11:24:23,777 INFO L125 PetriNetUnfolderBase]: For 36940/36940 co-relation queries the response was YES. [2023-11-17 11:24:23,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46920 conditions, 12592 events. 8058/12592 cut-off events. For 36940/36940 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 79556 event pairs, 1019 based on Foata normal form. 13/12605 useless extension candidates. Maximal degree in co-relation 46892. Up to 3624 conditions per place. [2023-11-17 11:24:23,824 INFO L140 encePairwiseOnDemand]: 64/75 looper letters, 94 selfloop transitions, 30 changer transitions 48/172 dead transitions. [2023-11-17 11:24:23,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 172 transitions, 1548 flow [2023-11-17 11:24:23,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2023-11-17 11:24:23,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4311111111111111 [2023-11-17 11:24:23,847 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 194 transitions. [2023-11-17 11:24:23,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 194 transitions. [2023-11-17 11:24:23,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:23,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 194 transitions. [2023-11-17 11:24:23,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 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 11:24:23,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:23,848 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:23,848 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 491 flow. Second operand 6 states and 194 transitions. [2023-11-17 11:24:23,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 172 transitions, 1548 flow [2023-11-17 11:24:24,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 172 transitions, 1507 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:24,105 INFO L231 Difference]: Finished difference. Result has 69 places, 69 transitions, 625 flow [2023-11-17 11:24:24,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=625, PETRI_PLACES=69, PETRI_TRANSITIONS=69} [2023-11-17 11:24:24,106 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 25 predicate places. [2023-11-17 11:24:24,106 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 69 transitions, 625 flow [2023-11-17 11:24:24,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 11:24:24,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:24,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:24:24,107 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:24,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:24,107 INFO L85 PathProgramCache]: Analyzing trace with hash -552927971, now seen corresponding path program 2 times [2023-11-17 11:24:24,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:24,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703121739] [2023-11-17 11:24:24,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:24,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:24,290 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 11:24:24,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:24,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703121739] [2023-11-17 11:24:24,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703121739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:24,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:24,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:24:24,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800025698] [2023-11-17 11:24:24,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:24,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:24:24,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:24,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:24:24,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:24:24,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 75 [2023-11-17 11:24:24,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 69 transitions, 625 flow. Second operand has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 11:24:24,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:24,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 75 [2023-11-17 11:24:24,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:25,170 INFO L124 PetriNetUnfolderBase]: 3913/6508 cut-off events. [2023-11-17 11:24:25,170 INFO L125 PetriNetUnfolderBase]: For 16119/16381 co-relation queries the response was YES. [2023-11-17 11:24:25,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23185 conditions, 6508 events. 3913/6508 cut-off events. For 16119/16381 co-relation queries the response was YES. Maximal size of possible extension queue 374. Compared 43563 event pairs, 855 based on Foata normal form. 209/6603 useless extension candidates. Maximal degree in co-relation 23155. Up to 2589 conditions per place. [2023-11-17 11:24:25,217 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 52 selfloop transitions, 17 changer transitions 58/132 dead transitions. [2023-11-17 11:24:25,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 1308 flow [2023-11-17 11:24:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:25,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-17 11:24:25,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43555555555555553 [2023-11-17 11:24:25,220 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-17 11:24:25,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-17 11:24:25,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:25,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-17 11:24:25,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 11:24:25,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:25,221 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:25,221 INFO L175 Difference]: Start difference. First operand has 69 places, 69 transitions, 625 flow. Second operand 6 states and 196 transitions. [2023-11-17 11:24:25,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 1308 flow [2023-11-17 11:24:25,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 132 transitions, 1295 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:24:25,427 INFO L231 Difference]: Finished difference. Result has 73 places, 41 transitions, 287 flow [2023-11-17 11:24:25,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=73, PETRI_TRANSITIONS=41} [2023-11-17 11:24:25,428 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2023-11-17 11:24:25,428 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 41 transitions, 287 flow [2023-11-17 11:24:25,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.5) internal successors, (141), 6 states have internal predecessors, (141), 0 states have call successors, (0), 0 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 11:24:25,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:25,428 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:25,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:24:25,428 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:25,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1659268418, now seen corresponding path program 1 times [2023-11-17 11:24:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:25,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106247075] [2023-11-17 11:24:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:26,510 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 11:24:26,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:26,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106247075] [2023-11-17 11:24:26,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106247075] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:26,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:26,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:24:26,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582174995] [2023-11-17 11:24:26,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:26,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:24:26,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:26,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:24:26,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:24:26,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 75 [2023-11-17 11:24:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 41 transitions, 287 flow. Second operand has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:24:26,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:26,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 75 [2023-11-17 11:24:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:26,774 INFO L124 PetriNetUnfolderBase]: 780/1313 cut-off events. [2023-11-17 11:24:26,774 INFO L125 PetriNetUnfolderBase]: For 2825/2935 co-relation queries the response was YES. [2023-11-17 11:24:26,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 1313 events. 780/1313 cut-off events. For 2825/2935 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6236 event pairs, 191 based on Foata normal form. 1/1282 useless extension candidates. Maximal degree in co-relation 4884. Up to 660 conditions per place. [2023-11-17 11:24:26,780 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 48 selfloop transitions, 4 changer transitions 43/100 dead transitions. [2023-11-17 11:24:26,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 100 transitions, 825 flow [2023-11-17 11:24:26,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2023-11-17 11:24:26,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-17 11:24:26,781 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 210 transitions. [2023-11-17 11:24:26,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 210 transitions. [2023-11-17 11:24:26,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:26,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 210 transitions. [2023-11-17 11:24:26,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.0) internal successors, (210), 6 states have internal predecessors, (210), 0 states have call successors, (0), 0 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 11:24:26,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:26,783 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:26,783 INFO L175 Difference]: Start difference. First operand has 73 places, 41 transitions, 287 flow. Second operand 6 states and 210 transitions. [2023-11-17 11:24:26,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 100 transitions, 825 flow [2023-11-17 11:24:26,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 628 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-11-17 11:24:26,792 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 208 flow [2023-11-17 11:24:26,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-17 11:24:26,794 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-17 11:24:26,794 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 208 flow [2023-11-17 11:24:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:24:26,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:26,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:26,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:24:26,794 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:26,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1840952380, now seen corresponding path program 2 times [2023-11-17 11:24:26,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:26,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528261614] [2023-11-17 11:24:26,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:26,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:26,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:24:27,905 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 11:24:27,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:24:27,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528261614] [2023-11-17 11:24:27,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528261614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:24:27,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:24:27,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:24:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224210841] [2023-11-17 11:24:27,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:24:27,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:24:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:24:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:24:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:24:27,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 75 [2023-11-17 11:24:27,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:24:27,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:24:27,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 75 [2023-11-17 11:24:27,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:24:28,148 INFO L124 PetriNetUnfolderBase]: 503/894 cut-off events. [2023-11-17 11:24:28,148 INFO L125 PetriNetUnfolderBase]: For 1079/1113 co-relation queries the response was YES. [2023-11-17 11:24:28,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3013 conditions, 894 events. 503/894 cut-off events. For 1079/1113 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4047 event pairs, 61 based on Foata normal form. 1/885 useless extension candidates. Maximal degree in co-relation 2996. Up to 467 conditions per place. [2023-11-17 11:24:28,151 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 53 selfloop transitions, 3 changer transitions 27/88 dead transitions. [2023-11-17 11:24:28,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 588 flow [2023-11-17 11:24:28,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:24:28,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:24:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2023-11-17 11:24:28,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43555555555555553 [2023-11-17 11:24:28,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 196 transitions. [2023-11-17 11:24:28,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 196 transitions. [2023-11-17 11:24:28,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:24:28,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 196 transitions. [2023-11-17 11:24:28,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 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 11:24:28,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:28,154 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 75.0) internal successors, (525), 7 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 11:24:28,154 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 208 flow. Second operand 6 states and 196 transitions. [2023-11-17 11:24:28,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 588 flow [2023-11-17 11:24:28,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 575 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-17 11:24:28,160 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 208 flow [2023-11-17 11:24:28,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2023-11-17 11:24:28,160 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-17 11:24:28,160 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 208 flow [2023-11-17 11:24:28,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.0) internal successors, (216), 8 states have internal predecessors, (216), 0 states have call successors, (0), 0 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 11:24:28,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:24:28,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:28,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:24:28,161 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:24:28,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:24:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash -547085726, now seen corresponding path program 3 times [2023-11-17 11:24:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:24:28,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423733484] [2023-11-17 11:24:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:24:28,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:24:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:28,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:24:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:24:28,284 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:24:28,285 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:24:28,285 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:24:28,286 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:24:28,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:24:28,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:24:28,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:24:28,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:24:28,287 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:24:28,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:24:28,287 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:24:28,292 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:24:28,292 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:24:28,342 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:24:28,344 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:24:28,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:24:28,346 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-17 11:24:28,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:24:28 BasicIcfg [2023-11-17 11:24:28,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:24:28,376 INFO L158 Benchmark]: Toolchain (without parser) took 22944.29ms. Allocated memory was 259.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 206.2MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:24:28,376 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:24:28,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.02ms. Allocated memory is still 259.0MB. Free memory was 206.0MB in the beginning and 181.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:28,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.30ms. Allocated memory is still 259.0MB. Free memory was 181.5MB in the beginning and 179.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:28,376 INFO L158 Benchmark]: Boogie Preprocessor took 24.60ms. Allocated memory is still 259.0MB. Free memory was 179.0MB in the beginning and 176.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:24:28,376 INFO L158 Benchmark]: RCFGBuilder took 657.24ms. Allocated memory is still 259.0MB. Free memory was 176.9MB in the beginning and 193.0MB in the end (delta: -16.1MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2023-11-17 11:24:28,377 INFO L158 Benchmark]: TraceAbstraction took 21662.72ms. Allocated memory was 259.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 192.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. Max. memory is 8.0GB. [2023-11-17 11:24:28,377 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.11ms. Allocated memory is still 182.5MB. Free memory is still 134.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.02ms. Allocated memory is still 259.0MB. Free memory was 206.0MB in the beginning and 181.9MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.30ms. Allocated memory is still 259.0MB. Free memory was 181.5MB in the beginning and 179.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.60ms. Allocated memory is still 259.0MB. Free memory was 179.0MB in the beginning and 176.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 657.24ms. Allocated memory is still 259.0MB. Free memory was 176.9MB in the beginning and 193.0MB in the end (delta: -16.1MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * TraceAbstraction took 21662.72ms. Allocated memory was 259.0MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 192.4MB in the beginning and 2.5GB in the end (delta: -2.3GB). Peak memory consumption was 1.3GB. 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 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: 0.9s, 58 PlacesBefore, 44 PlacesAfterwards, 47 TransitionsBefore, 32 TransitionsAfterwards, 1374 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 24 TotalNumberOfCompositions, 4747 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1687, independent: 1530, independent conditional: 0, independent unconditional: 1530, 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: 914, independent: 853, independent conditional: 0, independent unconditional: 853, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 914, independent: 805, independent conditional: 0, independent unconditional: 805, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 308, independent: 71, independent conditional: 0, independent unconditional: 71, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1687, independent: 677, independent conditional: 0, independent unconditional: 677, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 914, unknown conditional: 0, unknown unconditional: 914] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 166, Positive conditional cache size: 0, Positive unconditional cache size: 166, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1, z=0] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L802] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L825] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, x=2, y=2, z=1] [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, x=2, y=2, z=1] [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, x=2, y=2, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=0, x=2, y=2, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t209={5:0}, t210={6:0}, t211={7:0}, t212={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=0, x=2, y=2, 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: 870]: 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: 872]: 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: 874]: 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: 876]: 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 9 procedures, 85 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.5s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 421 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1284 IncrementalHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 36 mSDtfsCounter, 1284 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=625occurred in iteration=10, InterpolantAutomatonStates: 58, 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.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 11:24:28,416 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...