/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:34:00,853 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:34:00,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:34:00,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:34:00,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:34:00,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:34:00,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:34:00,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:34:00,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:34:00,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:34:00,979 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:34:00,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:34:00,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:34:00,985 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:34:00,985 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:34:00,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:34:00,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:34:00,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:34:00,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:34:00,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:34:00,986 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:34:00,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:34:00,987 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:34:00,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:34:00,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:34:00,988 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:34:00,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:34:00,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:00,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:34:00,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:34:00,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:34:00,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:34:00,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:34:00,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:34:00,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:34:00,991 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:34:01,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:34:01,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:34:01,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:34:01,272 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:34:01,272 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:34:01,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:34:02,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:34:02,648 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:34:02,648 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:34:02,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d7be232/3cab0cfe71894b3e8c12e747712697e2/FLAG09a59f329 [2023-08-24 05:34:02,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d7be232/3cab0cfe71894b3e8c12e747712697e2 [2023-08-24 05:34:02,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:34:02,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:34:02,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:02,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:34:02,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:34:02,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:02" (1/1) ... [2023-08-24 05:34:02,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59653d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:02, skipping insertion in model container [2023-08-24 05:34:02,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:02" (1/1) ... [2023-08-24 05:34:02,741 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:34:02,909 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-24 05:34:03,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:03,131 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:34:03,142 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/safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2023-08-24 05:34:03,160 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:34:03,163 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:34:03,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:03,230 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:03,230 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:03,236 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:34:03,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03 WrapperNode [2023-08-24 05:34:03,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:03,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:03,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:34:03,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:34:03,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,288 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-08-24 05:34:03,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:03,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:34:03,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:34:03,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:34:03,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,306 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,310 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,312 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:34:03,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:34:03,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:34:03,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:34:03,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (1/1) ... [2023-08-24 05:34:03,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:03,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:34:03,350 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:34:03,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:34:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:34:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:34:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:34:03,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:34:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:34:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:34:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:34:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:34:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:34:03,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:34:03,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:34:03,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:34:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:34:03,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:34:03,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:34:03,386 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:34:03,526 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:34:03,528 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:34:03,795 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:34:03,923 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:34:03,923 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:34:03,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:03 BoogieIcfgContainer [2023-08-24 05:34:03,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:34:03,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:34:03,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:34:03,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:34:03,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:34:02" (1/3) ... [2023-08-24 05:34:03,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4768a0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:03, skipping insertion in model container [2023-08-24 05:34:03,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:03" (2/3) ... [2023-08-24 05:34:03,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4768a0cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:03, skipping insertion in model container [2023-08-24 05:34:03,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:03" (3/3) ... [2023-08-24 05:34:03,931 INFO L112 eAbstractionObserver]: Analyzing ICFG safe005_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-24 05:34:03,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:34:03,946 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:34:03,946 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:34:04,006 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:34:04,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:34:04,102 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:34:04,102 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:04,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:34:04,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 107 transitions, 229 flow [2023-08-24 05:34:04,112 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:04,115 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:34:04,128 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:04,131 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:04,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 217 flow [2023-08-24 05:34:04,170 INFO L124 PetriNetUnfolderBase]: 2/104 cut-off events. [2023-08-24 05:34:04,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:04,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:34:04,173 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-08-24 05:34:07,474 INFO L134 LiptonReduction]: Checked pairs total: 4444 [2023-08-24 05:34:07,474 INFO L136 LiptonReduction]: Total number of compositions: 96 [2023-08-24 05:34:07,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:34:07,490 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@50e9f0a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:34:07,490 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:34:07,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:34:07,492 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-24 05:34:07,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:07,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:07,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:34:07,493 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:07,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:07,497 INFO L85 PathProgramCache]: Analyzing trace with hash 442810825, now seen corresponding path program 1 times [2023-08-24 05:34:07,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:07,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598854905] [2023-08-24 05:34:07,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:07,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:07,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598854905] [2023-08-24 05:34:07,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598854905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:07,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:07,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:34:07,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832793701] [2023-08-24 05:34:07,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:07,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 203 [2023-08-24 05:34:07,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:07,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:07,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 203 [2023-08-24 05:34:07,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:08,214 INFO L124 PetriNetUnfolderBase]: 711/1164 cut-off events. [2023-08-24 05:34:08,214 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:34:08,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1164 events. 711/1164 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5719 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2272. Up to 859 conditions per place. [2023-08-24 05:34:08,223 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-24 05:34:08,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 140 flow [2023-08-24 05:34:08,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:08,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 316 transitions. [2023-08-24 05:34:08,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188834154351396 [2023-08-24 05:34:08,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 316 transitions. [2023-08-24 05:34:08,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 316 transitions. [2023-08-24 05:34:08,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:08,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 316 transitions. [2023-08-24 05:34:08,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,247 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,248 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 55 flow. Second operand 3 states and 316 transitions. [2023-08-24 05:34:08,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 140 flow [2023-08-24 05:34:08,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:08,252 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 50 flow [2023-08-24 05:34:08,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 05:34:08,256 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-08-24 05:34:08,256 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 50 flow [2023-08-24 05:34:08,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:08,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:08,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:34:08,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:08,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash -165871513, now seen corresponding path program 1 times [2023-08-24 05:34:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:08,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718639209] [2023-08-24 05:34:08,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:08,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:08,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:08,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718639209] [2023-08-24 05:34:08,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718639209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:08,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:08,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:34:08,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501556347] [2023-08-24 05:34:08,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:08,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:08,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:08,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-08-24 05:34:08,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:08,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-08-24 05:34:08,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:08,735 INFO L124 PetriNetUnfolderBase]: 1346/2064 cut-off events. [2023-08-24 05:34:08,736 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-24 05:34:08,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4331 conditions, 2064 events. 1346/2064 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10016 event pairs, 502 based on Foata normal form. 94/2158 useless extension candidates. Maximal degree in co-relation 4321. Up to 1076 conditions per place. [2023-08-24 05:34:08,747 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 30 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-08-24 05:34:08,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 36 transitions, 160 flow [2023-08-24 05:34:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2023-08-24 05:34:08,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48440065681444994 [2023-08-24 05:34:08,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 295 transitions. [2023-08-24 05:34:08,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 295 transitions. [2023-08-24 05:34:08,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:08,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 295 transitions. [2023-08-24 05:34:08,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,759 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 50 flow. Second operand 3 states and 295 transitions. [2023-08-24 05:34:08,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 36 transitions, 160 flow [2023-08-24 05:34:08,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 36 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:08,761 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 88 flow [2023-08-24 05:34:08,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2023-08-24 05:34:08,762 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-08-24 05:34:08,763 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 88 flow [2023-08-24 05:34:08,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:08,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:08,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:34:08,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:08,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -847050852, now seen corresponding path program 1 times [2023-08-24 05:34:08,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337708631] [2023-08-24 05:34:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:08,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:08,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:08,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337708631] [2023-08-24 05:34:08,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337708631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:08,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:08,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:08,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797876241] [2023-08-24 05:34:08,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:08,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:08,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:08,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:08,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:08,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-08-24 05:34:08,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:08,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:08,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-08-24 05:34:08,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:09,243 INFO L124 PetriNetUnfolderBase]: 1287/1975 cut-off events. [2023-08-24 05:34:09,244 INFO L125 PetriNetUnfolderBase]: For 758/758 co-relation queries the response was YES. [2023-08-24 05:34:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 1975 events. 1287/1975 cut-off events. For 758/758 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8960 event pairs, 210 based on Foata normal form. 15/1990 useless extension candidates. Maximal degree in co-relation 5048. Up to 886 conditions per place. [2023-08-24 05:34:09,253 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 33 selfloop transitions, 7 changer transitions 3/43 dead transitions. [2023-08-24 05:34:09,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 43 transitions, 228 flow [2023-08-24 05:34:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions. [2023-08-24 05:34:09,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47413793103448276 [2023-08-24 05:34:09,255 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 385 transitions. [2023-08-24 05:34:09,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions. [2023-08-24 05:34:09,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:09,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions. [2023-08-24 05:34:09,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,258 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,258 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 88 flow. Second operand 4 states and 385 transitions. [2023-08-24 05:34:09,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 43 transitions, 228 flow [2023-08-24 05:34:09,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 43 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:09,265 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 118 flow [2023-08-24 05:34:09,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-24 05:34:09,266 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-24 05:34:09,266 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 118 flow [2023-08-24 05:34:09,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:09,267 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:09,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:34:09,267 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:09,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash -488772920, now seen corresponding path program 1 times [2023-08-24 05:34:09,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:09,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281035002] [2023-08-24 05:34:09,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:09,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:09,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:09,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281035002] [2023-08-24 05:34:09,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281035002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:09,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:34:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966149836] [2023-08-24 05:34:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:09,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:09,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:09,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:09,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-08-24 05:34:09,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:09,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-08-24 05:34:09,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:09,815 INFO L124 PetriNetUnfolderBase]: 1888/2913 cut-off events. [2023-08-24 05:34:09,815 INFO L125 PetriNetUnfolderBase]: For 2237/2237 co-relation queries the response was YES. [2023-08-24 05:34:09,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7827 conditions, 2913 events. 1888/2913 cut-off events. For 2237/2237 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 14984 event pairs, 399 based on Foata normal form. 60/2973 useless extension candidates. Maximal degree in co-relation 7812. Up to 1440 conditions per place. [2023-08-24 05:34:09,827 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 35 selfloop transitions, 5 changer transitions 15/55 dead transitions. [2023-08-24 05:34:09,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 340 flow [2023-08-24 05:34:09,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:09,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:09,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-24 05:34:09,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49014778325123154 [2023-08-24 05:34:09,829 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-24 05:34:09,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-24 05:34:09,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:09,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-24 05:34:09,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,832 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,833 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 118 flow. Second operand 4 states and 398 transitions. [2023-08-24 05:34:09,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 340 flow [2023-08-24 05:34:09,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 55 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:34:09,838 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 150 flow [2023-08-24 05:34:09,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-24 05:34:09,839 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2023-08-24 05:34:09,839 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 150 flow [2023-08-24 05:34:09,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:09,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:09,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:09,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:34:09,840 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:09,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:09,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2027876822, now seen corresponding path program 1 times [2023-08-24 05:34:09,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:09,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344873493] [2023-08-24 05:34:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:09,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:10,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:10,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344873493] [2023-08-24 05:34:10,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344873493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:10,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:10,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:10,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982495667] [2023-08-24 05:34:10,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:10,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:10,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:10,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:10,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 203 [2023-08-24 05:34:10,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:10,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 203 [2023-08-24 05:34:10,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:10,485 INFO L124 PetriNetUnfolderBase]: 1935/3037 cut-off events. [2023-08-24 05:34:10,485 INFO L125 PetriNetUnfolderBase]: For 2708/2708 co-relation queries the response was YES. [2023-08-24 05:34:10,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8158 conditions, 3037 events. 1935/3037 cut-off events. For 2708/2708 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16135 event pairs, 352 based on Foata normal form. 64/3101 useless extension candidates. Maximal degree in co-relation 8140. Up to 830 conditions per place. [2023-08-24 05:34:10,496 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 43 selfloop transitions, 8 changer transitions 27/78 dead transitions. [2023-08-24 05:34:10,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 456 flow [2023-08-24 05:34:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 677 transitions. [2023-08-24 05:34:10,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47642505277973257 [2023-08-24 05:34:10,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 677 transitions. [2023-08-24 05:34:10,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 677 transitions. [2023-08-24 05:34:10,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:10,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 677 transitions. [2023-08-24 05:34:10,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,504 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,504 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 150 flow. Second operand 7 states and 677 transitions. [2023-08-24 05:34:10,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 456 flow [2023-08-24 05:34:10,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 78 transitions, 441 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:10,512 INFO L231 Difference]: Finished difference. Result has 46 places, 26 transitions, 146 flow [2023-08-24 05:34:10,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=26} [2023-08-24 05:34:10,514 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2023-08-24 05:34:10,514 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 146 flow [2023-08-24 05:34:10,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:10,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:34:10,514 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:10,515 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash -244780293, now seen corresponding path program 1 times [2023-08-24 05:34:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:10,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381878186] [2023-08-24 05:34:10,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:10,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:10,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381878186] [2023-08-24 05:34:10,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381878186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:10,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:10,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:34:10,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764418369] [2023-08-24 05:34:10,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:10,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:10,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:10,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:10,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:10,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 203 [2023-08-24 05:34:10,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 26 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:10,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 203 [2023-08-24 05:34:10,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:10,834 INFO L124 PetriNetUnfolderBase]: 883/1408 cut-off events. [2023-08-24 05:34:10,834 INFO L125 PetriNetUnfolderBase]: For 2086/2086 co-relation queries the response was YES. [2023-08-24 05:34:10,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 1408 events. 883/1408 cut-off events. For 2086/2086 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6362 event pairs, 325 based on Foata normal form. 15/1419 useless extension candidates. Maximal degree in co-relation 3855. Up to 1027 conditions per place. [2023-08-24 05:34:10,840 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 26 selfloop transitions, 3 changer transitions 3/34 dead transitions. [2023-08-24 05:34:10,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 34 transitions, 247 flow [2023-08-24 05:34:10,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:10,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-08-24 05:34:10,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4975369458128079 [2023-08-24 05:34:10,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-08-24 05:34:10,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-08-24 05:34:10,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:10,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-08-24 05:34:10,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,846 INFO L175 Difference]: Start difference. First operand has 46 places, 26 transitions, 146 flow. Second operand 3 states and 303 transitions. [2023-08-24 05:34:10,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 34 transitions, 247 flow [2023-08-24 05:34:10,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 216 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-08-24 05:34:10,850 INFO L231 Difference]: Finished difference. Result has 42 places, 26 transitions, 134 flow [2023-08-24 05:34:10,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2023-08-24 05:34:10,852 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2023-08-24 05:34:10,853 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 134 flow [2023-08-24 05:34:10,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:10,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:10,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:10,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:34:10,853 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:10,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1433948671, now seen corresponding path program 1 times [2023-08-24 05:34:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467922126] [2023-08-24 05:34:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:11,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:11,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467922126] [2023-08-24 05:34:11,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467922126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:11,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:11,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:34:11,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045714296] [2023-08-24 05:34:11,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:11,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:34:11,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:11,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:34:11,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:34:11,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-08-24 05:34:11,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:11,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-08-24 05:34:11,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:11,267 INFO L124 PetriNetUnfolderBase]: 674/1191 cut-off events. [2023-08-24 05:34:11,267 INFO L125 PetriNetUnfolderBase]: For 1029/1034 co-relation queries the response was YES. [2023-08-24 05:34:11,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3102 conditions, 1191 events. 674/1191 cut-off events. For 1029/1034 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 6512 event pairs, 124 based on Foata normal form. 135/1315 useless extension candidates. Maximal degree in co-relation 3083. Up to 510 conditions per place. [2023-08-24 05:34:11,271 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 39 selfloop transitions, 5 changer transitions 5/53 dead transitions. [2023-08-24 05:34:11,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 342 flow [2023-08-24 05:34:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:34:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:34:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 395 transitions. [2023-08-24 05:34:11,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48645320197044334 [2023-08-24 05:34:11,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 395 transitions. [2023-08-24 05:34:11,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 395 transitions. [2023-08-24 05:34:11,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:11,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 395 transitions. [2023-08-24 05:34:11,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,276 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 203.0) internal successors, (1015), 5 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,276 INFO L175 Difference]: Start difference. First operand has 42 places, 26 transitions, 134 flow. Second operand 4 states and 395 transitions. [2023-08-24 05:34:11,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 342 flow [2023-08-24 05:34:11,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 330 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:11,278 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 158 flow [2023-08-24 05:34:11,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-24 05:34:11,279 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 12 predicate places. [2023-08-24 05:34:11,279 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 158 flow [2023-08-24 05:34:11,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:11,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:11,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:34:11,280 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:11,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1562908248, now seen corresponding path program 1 times [2023-08-24 05:34:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650775701] [2023-08-24 05:34:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:11,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:11,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650775701] [2023-08-24 05:34:11,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650775701] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:11,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:11,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:11,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986252574] [2023-08-24 05:34:11,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:11,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:11,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:11,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:11,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-08-24 05:34:11,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:11,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-08-24 05:34:11,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:11,572 INFO L124 PetriNetUnfolderBase]: 349/687 cut-off events. [2023-08-24 05:34:11,573 INFO L125 PetriNetUnfolderBase]: For 811/812 co-relation queries the response was YES. [2023-08-24 05:34:11,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 687 events. 349/687 cut-off events. For 811/812 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3561 event pairs, 49 based on Foata normal form. 88/768 useless extension candidates. Maximal degree in co-relation 2265. Up to 264 conditions per place. [2023-08-24 05:34:11,576 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 44 selfloop transitions, 8 changer transitions 8/64 dead transitions. [2023-08-24 05:34:11,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 64 transitions, 444 flow [2023-08-24 05:34:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:34:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:34:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-24 05:34:11,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48472906403940885 [2023-08-24 05:34:11,578 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-24 05:34:11,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-24 05:34:11,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:11,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-24 05:34:11,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,581 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 158 flow. Second operand 5 states and 492 transitions. [2023-08-24 05:34:11,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 64 transitions, 444 flow [2023-08-24 05:34:11,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 434 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:11,583 INFO L231 Difference]: Finished difference. Result has 48 places, 32 transitions, 198 flow [2023-08-24 05:34:11,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=48, PETRI_TRANSITIONS=32} [2023-08-24 05:34:11,584 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 16 predicate places. [2023-08-24 05:34:11,584 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 32 transitions, 198 flow [2023-08-24 05:34:11,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.8) internal successors, (454), 5 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:11,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:11,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:34:11,585 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:11,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1107504044, now seen corresponding path program 1 times [2023-08-24 05:34:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140177314] [2023-08-24 05:34:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:11,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:11,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140177314] [2023-08-24 05:34:11,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140177314] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:11,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:11,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:34:11,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464474200] [2023-08-24 05:34:11,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:11,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:34:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:34:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:34:11,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 203 [2023-08-24 05:34:11,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 32 transitions, 198 flow. Second operand has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:11,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:11,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 203 [2023-08-24 05:34:11,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:12,133 INFO L124 PetriNetUnfolderBase]: 370/745 cut-off events. [2023-08-24 05:34:12,133 INFO L125 PetriNetUnfolderBase]: For 1502/1502 co-relation queries the response was YES. [2023-08-24 05:34:12,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2941 conditions, 745 events. 370/745 cut-off events. For 1502/1502 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3705 event pairs, 61 based on Foata normal form. 10/755 useless extension candidates. Maximal degree in co-relation 2919. Up to 315 conditions per place. [2023-08-24 05:34:12,136 INFO L140 encePairwiseOnDemand]: 193/203 looper letters, 45 selfloop transitions, 22 changer transitions 22/89 dead transitions. [2023-08-24 05:34:12,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 704 flow [2023-08-24 05:34:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 642 transitions. [2023-08-24 05:34:12,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4517945109078114 [2023-08-24 05:34:12,139 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 642 transitions. [2023-08-24 05:34:12,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 642 transitions. [2023-08-24 05:34:12,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:12,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 642 transitions. [2023-08-24 05:34:12,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,143 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,143 INFO L175 Difference]: Start difference. First operand has 48 places, 32 transitions, 198 flow. Second operand 7 states and 642 transitions. [2023-08-24 05:34:12,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 704 flow [2023-08-24 05:34:12,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 89 transitions, 641 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-08-24 05:34:12,147 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 337 flow [2023-08-24 05:34:12,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-24 05:34:12,148 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2023-08-24 05:34:12,148 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 337 flow [2023-08-24 05:34:12,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.6) internal successors, (428), 5 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:12,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:12,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:34:12,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:12,149 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:12,149 INFO L85 PathProgramCache]: Analyzing trace with hash -270176015, now seen corresponding path program 1 times [2023-08-24 05:34:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345412956] [2023-08-24 05:34:12,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:12,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:12,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:12,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345412956] [2023-08-24 05:34:12,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345412956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:12,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:12,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:12,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101662058] [2023-08-24 05:34:12,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:12,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:34:12,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:12,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:34:12,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:34:12,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 203 [2023-08-24 05:34:12,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:12,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 203 [2023-08-24 05:34:12,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:12,436 INFO L124 PetriNetUnfolderBase]: 177/388 cut-off events. [2023-08-24 05:34:12,436 INFO L125 PetriNetUnfolderBase]: For 970/975 co-relation queries the response was YES. [2023-08-24 05:34:12,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 388 events. 177/388 cut-off events. For 970/975 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1753 event pairs, 25 based on Foata normal form. 26/410 useless extension candidates. Maximal degree in co-relation 1567. Up to 139 conditions per place. [2023-08-24 05:34:12,438 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 48 selfloop transitions, 11 changer transitions 10/74 dead transitions. [2023-08-24 05:34:12,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 658 flow [2023-08-24 05:34:12,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:34:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:34:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 572 transitions. [2023-08-24 05:34:12,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696223316912972 [2023-08-24 05:34:12,441 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 572 transitions. [2023-08-24 05:34:12,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 572 transitions. [2023-08-24 05:34:12,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:12,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 572 transitions. [2023-08-24 05:34:12,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,444 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 203.0) internal successors, (1421), 7 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,444 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 337 flow. Second operand 6 states and 572 transitions. [2023-08-24 05:34:12,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 658 flow [2023-08-24 05:34:12,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 630 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:34:12,448 INFO L231 Difference]: Finished difference. Result has 60 places, 46 transitions, 350 flow [2023-08-24 05:34:12,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=46} [2023-08-24 05:34:12,448 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2023-08-24 05:34:12,448 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 46 transitions, 350 flow [2023-08-24 05:34:12,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.66666666666667) internal successors, (544), 6 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:12,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:12,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:12,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:34:12,449 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:12,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:12,450 INFO L85 PathProgramCache]: Analyzing trace with hash -494564831, now seen corresponding path program 1 times [2023-08-24 05:34:12,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:12,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706920777] [2023-08-24 05:34:12,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:34:13,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706920777] [2023-08-24 05:34:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706920777] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:13,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:34:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154355405] [2023-08-24 05:34:13,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:13,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:34:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:34:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:34:13,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 203 [2023-08-24 05:34:13,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 46 transitions, 350 flow. Second operand has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:13,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 203 [2023-08-24 05:34:13,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:13,217 INFO L124 PetriNetUnfolderBase]: 169/380 cut-off events. [2023-08-24 05:34:13,217 INFO L125 PetriNetUnfolderBase]: For 1233/1244 co-relation queries the response was YES. [2023-08-24 05:34:13,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 380 events. 169/380 cut-off events. For 1233/1244 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1674 event pairs, 22 based on Foata normal form. 13/392 useless extension candidates. Maximal degree in co-relation 1718. Up to 197 conditions per place. [2023-08-24 05:34:13,219 INFO L140 encePairwiseOnDemand]: 197/203 looper letters, 38 selfloop transitions, 5 changer transitions 26/73 dead transitions. [2023-08-24 05:34:13,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 692 flow [2023-08-24 05:34:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:34:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:34:13,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2023-08-24 05:34:13,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44475721323011963 [2023-08-24 05:34:13,221 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2023-08-24 05:34:13,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2023-08-24 05:34:13,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:13,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2023-08-24 05:34:13,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,225 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 203.0) internal successors, (1624), 8 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,225 INFO L175 Difference]: Start difference. First operand has 60 places, 46 transitions, 350 flow. Second operand 7 states and 632 transitions. [2023-08-24 05:34:13,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 692 flow [2023-08-24 05:34:13,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 537 flow, removed 23 selfloop flow, removed 11 redundant places. [2023-08-24 05:34:13,230 INFO L231 Difference]: Finished difference. Result has 57 places, 40 transitions, 258 flow [2023-08-24 05:34:13,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=57, PETRI_TRANSITIONS=40} [2023-08-24 05:34:13,231 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2023-08-24 05:34:13,231 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 40 transitions, 258 flow [2023-08-24 05:34:13,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 87.57142857142857) internal successors, (613), 7 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:34:13,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:13,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:13,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:34:13,232 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:13,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:13,232 INFO L85 PathProgramCache]: Analyzing trace with hash -529076937, now seen corresponding path program 2 times [2023-08-24 05:34:13,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:13,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094595387] [2023-08-24 05:34:13,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:13,263 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:34:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:34:13,317 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:34:13,317 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:34:13,318 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:34:13,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:34:13,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:34:13,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:34:13,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:34:13,320 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:34:13,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:34:13,320 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:13,325 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:34:13,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:34:13,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:34:13 BasicIcfg [2023-08-24 05:34:13,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:34:13,387 INFO L158 Benchmark]: Toolchain (without parser) took 10709.72ms. Allocated memory was 341.8MB in the beginning and 595.6MB in the end (delta: 253.8MB). Free memory was 317.1MB in the beginning and 361.0MB in the end (delta: -43.9MB). Peak memory consumption was 210.5MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,387 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 341.8MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:34:13,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.26ms. Allocated memory is still 341.8MB. Free memory was 317.1MB in the beginning and 294.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 341.8MB. Free memory was 294.0MB in the beginning and 291.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,387 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 341.8MB. Free memory was 291.5MB in the beginning and 289.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,388 INFO L158 Benchmark]: RCFGBuilder took 612.02ms. Allocated memory is still 341.8MB. Free memory was 289.5MB in the beginning and 308.5MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,388 INFO L158 Benchmark]: TraceAbstraction took 9459.99ms. Allocated memory was 341.8MB in the beginning and 595.6MB in the end (delta: 253.8MB). Free memory was 308.5MB in the beginning and 361.0MB in the end (delta: -52.5MB). Peak memory consumption was 200.0MB. Max. memory is 16.0GB. [2023-08-24 05:34:13,392 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.14ms. Allocated memory is still 341.8MB. Free memory is still 318.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 559.26ms. Allocated memory is still 341.8MB. Free memory was 317.1MB in the beginning and 294.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 341.8MB. Free memory was 294.0MB in the beginning and 291.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 341.8MB. Free memory was 291.5MB in the beginning and 289.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 612.02ms. Allocated memory is still 341.8MB. Free memory was 289.5MB in the beginning and 308.5MB in the end (delta: -19.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 9459.99ms. Allocated memory was 341.8MB in the beginning and 595.6MB in the end (delta: 253.8MB). Free memory was 308.5MB in the beginning and 361.0MB in the end (delta: -52.5MB). Peak memory consumption was 200.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 112 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 23 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 6 FixpointIterations, 38 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 4444 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 2017, independent conditional: 0, independent unconditional: 2017, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1012, independent: 969, independent conditional: 0, independent unconditional: 969, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2167, independent: 1048, independent conditional: 0, independent unconditional: 1048, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 1012, unknown conditional: 0, unknown unconditional: 1012] , Statistics on independence cache: Total cache size (in pairs): 78, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1897; [L832] FCALL, FORK 0 pthread_create(&t1897, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1897, ((void *)0), P0, ((void *)0))=-2, t1897={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L833] 0 pthread_t t1898; [L834] FCALL, FORK 0 pthread_create(&t1898, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1898, ((void *)0), P1, ((void *)0))=-1, t1897={5:0}, t1898={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L835] 0 pthread_t t1899; [L836] FCALL, FORK 0 pthread_create(&t1899, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1899, ((void *)0), P2, ((void *)0))=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1897={5:0}, t1898={6:0}, t1899={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 133 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 721 IncrementalHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 8 mSDtfsCounter, 721 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=350occurred in iteration=10, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 821 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-08-24 05:34:13,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...