/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:10:12,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:10:12,924 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-26 12:10:12,927 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:10:12,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:10:12,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:10:12,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:10:12,942 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:10:12,943 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:10:12,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:10:12,943 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:10:12,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:10:12,944 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:10:12,944 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:10:12,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:10:12,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:10:12,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:10:12,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:10:12,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:10:12,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:10:12,946 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:10:12,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:10:12,947 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:10:12,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:10:12,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:10:12,947 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:10:12,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:10:12,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:10:12,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:10:12,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:10:12,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:10:12,949 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:10:12,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:10:12,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:10:12,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:10:12,949 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:10:13,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:10:13,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:10:13,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:10:13,254 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:10:13,256 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:10:13,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-26 12:10:14,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:10:14,482 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:10:14,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe002_rmo.oepc.i [2023-08-26 12:10:14,494 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966095509/f5aa708854ac4d679ee3703bb87ed11b/FLAGf3b417888 [2023-08-26 12:10:14,512 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/966095509/f5aa708854ac4d679ee3703bb87ed11b [2023-08-26 12:10:14,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:10:14,515 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:10:14,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:10:14,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:10:14,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:10:14,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:14,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17940609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14, skipping insertion in model container [2023-08-26 12:10:14,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:14,573 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:10:14,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:10:14,900 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:10:14,924 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:10:14,925 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:10:14,959 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:10:14,993 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:10:14,993 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:10:14,998 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:10:15,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14 WrapperNode [2023-08-26 12:10:15,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:10:15,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:10:15,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:10:15,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:10:15,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,038 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,072 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 173 [2023-08-26 12:10:15,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:10:15,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:10:15,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:10:15,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:10:15,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,110 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:10:15,117 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:10:15,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:10:15,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:10:15,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (1/1) ... [2023-08-26 12:10:15,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:10:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:10:15,152 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-26 12:10:15,155 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-26 12:10:15,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:10:15,183 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:10:15,183 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:10:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:10:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:10:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:10:15,184 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:10:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:10:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:10:15,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:10:15,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:10:15,187 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:10:15,291 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:10:15,293 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:10:15,791 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:10:16,295 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:10:16,296 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:10:16,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:10:16 BoogieIcfgContainer [2023-08-26 12:10:16,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:10:16,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:10:16,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:10:16,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:10:16,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:10:14" (1/3) ... [2023-08-26 12:10:16,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2b0367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:10:16, skipping insertion in model container [2023-08-26 12:10:16,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:10:14" (2/3) ... [2023-08-26 12:10:16,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2b0367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:10:16, skipping insertion in model container [2023-08-26 12:10:16,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:10:16" (3/3) ... [2023-08-26 12:10:16,303 INFO L112 eAbstractionObserver]: Analyzing ICFG safe002_rmo.oepc.i [2023-08-26 12:10:16,316 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:10:16,316 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 12:10:16,316 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:10:16,389 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:10:16,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:10:16,466 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:10:16,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:16,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:10:16,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 189 transitions, 393 flow [2023-08-26 12:10:16,476 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 186 transitions, 381 flow [2023-08-26 12:10:16,479 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:10:16,485 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:10:16,487 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 186 transitions, 381 flow [2023-08-26 12:10:16,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 186 transitions, 381 flow [2023-08-26 12:10:16,520 INFO L124 PetriNetUnfolderBase]: 3/186 cut-off events. [2023-08-26 12:10:16,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:16,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 3/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 341 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:10:16,524 INFO L119 LiptonReduction]: Number of co-enabled transitions 8612 [2023-08-26 12:10:33,906 INFO L134 LiptonReduction]: Checked pairs total: 49859 [2023-08-26 12:10:33,907 INFO L136 LiptonReduction]: Total number of compositions: 157 [2023-08-26 12:10:33,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:10:33,932 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;@77167db6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:10:33,932 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 12:10:33,934 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:10:33,934 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 12:10:33,934 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:33,934 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:33,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:10:33,935 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:33,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:33,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1201, now seen corresponding path program 1 times [2023-08-26 12:10:33,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:33,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851064106] [2023-08-26 12:10:33,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:33,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:34,034 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-26 12:10:34,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:34,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851064106] [2023-08-26 12:10:34,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851064106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:34,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:34,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:10:34,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438864054] [2023-08-26 12:10:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:34,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:10:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:10:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:10:34,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 346 [2023-08-26 12:10:34,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-26 12:10:34,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:34,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 346 [2023-08-26 12:10:34,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:37,175 INFO L124 PetriNetUnfolderBase]: 16294/23361 cut-off events. [2023-08-26 12:10:37,176 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 12:10:37,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46288 conditions, 23361 events. 16294/23361 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2273. Compared 167492 event pairs, 16294 based on Foata normal form. 400/9766 useless extension candidates. Maximal degree in co-relation 46277. Up to 22831 conditions per place. [2023-08-26 12:10:37,329 INFO L140 encePairwiseOnDemand]: 308/346 looper letters, 43 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 12:10:37,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:10:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:10:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2023-08-26 12:10:37,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48121387283236994 [2023-08-26 12:10:37,345 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2023-08-26 12:10:37,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2023-08-26 12:10:37,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:37,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2023-08-26 12:10:37,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 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-26 12:10:37,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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-26 12:10:37,357 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 346.0) internal successors, (1038), 3 states have internal predecessors, (1038), 0 states have call successors, (0), 0 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-26 12:10:37,358 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 333 transitions. [2023-08-26 12:10:37,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:37,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:37,365 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:37,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 12:10:37,369 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:37,369 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:37,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 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-26 12:10:37,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:37,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:37,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:10:37,370 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:37,371 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1188544, now seen corresponding path program 1 times [2023-08-26 12:10:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:37,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635342258] [2023-08-26 12:10:37,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:37,613 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-26 12:10:37,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:37,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635342258] [2023-08-26 12:10:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635342258] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:37,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087130550] [2023-08-26 12:10:37,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:37,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:37,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:37,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 346 [2023-08-26 12:10:37,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-26 12:10:37,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:37,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 346 [2023-08-26 12:10:37,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:40,214 INFO L124 PetriNetUnfolderBase]: 14310/20980 cut-off events. [2023-08-26 12:10:40,214 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:40,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41928 conditions, 20980 events. 14310/20980 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1240. Compared 137408 event pairs, 9819 based on Foata normal form. 0/12066 useless extension candidates. Maximal degree in co-relation 41925. Up to 14243 conditions per place. [2023-08-26 12:10:40,290 INFO L140 encePairwiseOnDemand]: 325/346 looper letters, 55 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2023-08-26 12:10:40,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 66 transitions, 268 flow [2023-08-26 12:10:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 12:10:40,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36801541425818884 [2023-08-26 12:10:40,293 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 12:10:40,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 12:10:40,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:40,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 12:10:40,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 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-26 12:10:40,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:40,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:40,297 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 382 transitions. [2023-08-26 12:10:40,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 66 transitions, 268 flow [2023-08-26 12:10:40,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 268 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:10:40,298 INFO L231 Difference]: Finished difference. Result has 59 places, 55 transitions, 188 flow [2023-08-26 12:10:40,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=59, PETRI_TRANSITIONS=55} [2023-08-26 12:10:40,299 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -38 predicate places. [2023-08-26 12:10:40,299 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 55 transitions, 188 flow [2023-08-26 12:10:40,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 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-26 12:10:40,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:40,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:40,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:10:40,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:40,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1188545, now seen corresponding path program 1 times [2023-08-26 12:10:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:40,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141600455] [2023-08-26 12:10:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:40,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:40,421 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-26 12:10:40,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:40,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141600455] [2023-08-26 12:10:40,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141600455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:40,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:40,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046958922] [2023-08-26 12:10:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:40,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:40,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:40,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:40,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 12:10:40,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 55 transitions, 188 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-26 12:10:40,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:40,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 12:10:40,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:41,292 INFO L124 PetriNetUnfolderBase]: 4092/6386 cut-off events. [2023-08-26 12:10:41,292 INFO L125 PetriNetUnfolderBase]: For 2167/2182 co-relation queries the response was YES. [2023-08-26 12:10:41,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18114 conditions, 6386 events. 4092/6386 cut-off events. For 2167/2182 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 39473 event pairs, 3031 based on Foata normal form. 1759/7640 useless extension candidates. Maximal degree in co-relation 18109. Up to 6250 conditions per place. [2023-08-26 12:10:41,319 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 41 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2023-08-26 12:10:41,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 45 transitions, 254 flow [2023-08-26 12:10:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 12:10:41,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34971098265895956 [2023-08-26 12:10:41,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 12:10:41,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 12:10:41,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:41,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 12:10:41,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 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-26 12:10:41,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:41,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:41,324 INFO L175 Difference]: Start difference. First operand has 59 places, 55 transitions, 188 flow. Second operand 3 states and 363 transitions. [2023-08-26 12:10:41,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 45 transitions, 254 flow [2023-08-26 12:10:41,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:41,336 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 148 flow [2023-08-26 12:10:41,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 12:10:41,336 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -48 predicate places. [2023-08-26 12:10:41,337 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 148 flow [2023-08-26 12:10:41,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 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-26 12:10:41,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:41,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:41,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:10:41,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:41,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:41,338 INFO L85 PathProgramCache]: Analyzing trace with hash -471237991, now seen corresponding path program 1 times [2023-08-26 12:10:41,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:41,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309495214] [2023-08-26 12:10:41,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:41,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:41,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:41,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309495214] [2023-08-26 12:10:41,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309495214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:41,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:41,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419690240] [2023-08-26 12:10:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:41,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:41,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:41,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:41,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:41,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 346 [2023-08-26 12:10:41,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:41,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:41,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 346 [2023-08-26 12:10:41,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:42,252 INFO L124 PetriNetUnfolderBase]: 3517/5842 cut-off events. [2023-08-26 12:10:42,252 INFO L125 PetriNetUnfolderBase]: For 1135/1291 co-relation queries the response was YES. [2023-08-26 12:10:42,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14675 conditions, 5842 events. 3517/5842 cut-off events. For 1135/1291 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 40002 event pairs, 1375 based on Foata normal form. 29/4664 useless extension candidates. Maximal degree in co-relation 14670. Up to 3202 conditions per place. [2023-08-26 12:10:42,282 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 61 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 12:10:42,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 366 flow [2023-08-26 12:10:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-26 12:10:42,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4142581888246628 [2023-08-26 12:10:42,284 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-26 12:10:42,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-26 12:10:42,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:42,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-26 12:10:42,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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-26 12:10:42,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:42,287 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:42,287 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 148 flow. Second operand 3 states and 430 transitions. [2023-08-26 12:10:42,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 366 flow [2023-08-26 12:10:42,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:42,289 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:42,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:10:42,290 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:10:42,290 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:42,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:42,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:42,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:42,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:10:42,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:42,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash -471237633, now seen corresponding path program 1 times [2023-08-26 12:10:42,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:42,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980600118] [2023-08-26 12:10:42,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:42,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:42,981 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-26 12:10:42,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:42,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980600118] [2023-08-26 12:10:42,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980600118] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:42,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:42,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572093796] [2023-08-26 12:10:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:42,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:42,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:42,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:42,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 346 [2023-08-26 12:10:42,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-26 12:10:42,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:42,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 346 [2023-08-26 12:10:42,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:43,630 INFO L124 PetriNetUnfolderBase]: 3438/5610 cut-off events. [2023-08-26 12:10:43,630 INFO L125 PetriNetUnfolderBase]: For 1775/1856 co-relation queries the response was YES. [2023-08-26 12:10:43,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15366 conditions, 5610 events. 3438/5610 cut-off events. For 1775/1856 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 36588 event pairs, 1390 based on Foata normal form. 20/4786 useless extension candidates. Maximal degree in co-relation 15360. Up to 4468 conditions per place. [2023-08-26 12:10:43,647 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 56 selfloop transitions, 5 changer transitions 0/69 dead transitions. [2023-08-26 12:10:43,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 69 transitions, 370 flow [2023-08-26 12:10:43,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:43,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 12:10:43,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40173410404624277 [2023-08-26 12:10:43,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 12:10:43,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 12:10:43,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:43,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 12:10:43,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:43,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:43,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:10:43,652 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 160 flow. Second operand 3 states and 417 transitions. [2023-08-26 12:10:43,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 69 transitions, 370 flow [2023-08-26 12:10:43,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 69 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:43,654 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 197 flow [2023-08-26 12:10:43,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-26 12:10:43,655 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -46 predicate places. [2023-08-26 12:10:43,655 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 197 flow [2023-08-26 12:10:43,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-26 12:10:43,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:43,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:43,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:10:43,655 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:43,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:43,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466365, now seen corresponding path program 1 times [2023-08-26 12:10:43,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:43,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913423654] [2023-08-26 12:10:43,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:43,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:43,886 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-26 12:10:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913423654] [2023-08-26 12:10:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913423654] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:43,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:43,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463392647] [2023-08-26 12:10:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:43,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:43,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:43,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:43,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 346 [2023-08-26 12:10:43,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-26 12:10:43,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:43,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 346 [2023-08-26 12:10:43,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:44,479 INFO L124 PetriNetUnfolderBase]: 3431/5605 cut-off events. [2023-08-26 12:10:44,479 INFO L125 PetriNetUnfolderBase]: For 1965/2008 co-relation queries the response was YES. [2023-08-26 12:10:44,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15801 conditions, 5605 events. 3431/5605 cut-off events. For 1965/2008 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 36571 event pairs, 995 based on Foata normal form. 13/4903 useless extension candidates. Maximal degree in co-relation 15794. Up to 3811 conditions per place. [2023-08-26 12:10:44,501 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 70 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2023-08-26 12:10:44,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 469 flow [2023-08-26 12:10:44,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-08-26 12:10:44,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046242774566474 [2023-08-26 12:10:44,503 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-08-26 12:10:44,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-08-26 12:10:44,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:44,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-08-26 12:10:44,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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-26 12:10:44,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:44,507 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:44,507 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 197 flow. Second operand 4 states and 560 transitions. [2023-08-26 12:10:44,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 469 flow [2023-08-26 12:10:44,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 85 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:44,509 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 212 flow [2023-08-26 12:10:44,510 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=212, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-26 12:10:44,510 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2023-08-26 12:10:44,510 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 212 flow [2023-08-26 12:10:44,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-26 12:10:44,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:44,511 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:44,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:10:44,511 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:44,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466723, now seen corresponding path program 1 times [2023-08-26 12:10:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872708999] [2023-08-26 12:10:44,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:44,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:44,576 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-26 12:10:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:44,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872708999] [2023-08-26 12:10:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872708999] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:44,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994044071] [2023-08-26 12:10:44,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:44,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:44,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:44,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:44,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:44,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 346 [2023-08-26 12:10:44,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-26 12:10:44,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:44,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 346 [2023-08-26 12:10:44,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:45,259 INFO L124 PetriNetUnfolderBase]: 4085/6628 cut-off events. [2023-08-26 12:10:45,259 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2023-08-26 12:10:45,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19312 conditions, 6628 events. 4085/6628 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 44077 event pairs, 1313 based on Foata normal form. 0/6016 useless extension candidates. Maximal degree in co-relation 19304. Up to 2768 conditions per place. [2023-08-26 12:10:45,281 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 55 selfloop transitions, 17 changer transitions 0/73 dead transitions. [2023-08-26 12:10:45,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 73 transitions, 433 flow [2023-08-26 12:10:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-08-26 12:10:45,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3417630057803468 [2023-08-26 12:10:45,283 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-08-26 12:10:45,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-08-26 12:10:45,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:45,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-08-26 12:10:45,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 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-26 12:10:45,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:45,286 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:45,286 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 212 flow. Second operand 4 states and 473 transitions. [2023-08-26 12:10:45,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 73 transitions, 433 flow [2023-08-26 12:10:45,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 73 transitions, 416 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:45,289 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 240 flow [2023-08-26 12:10:45,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-26 12:10:45,289 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -43 predicate places. [2023-08-26 12:10:45,290 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 240 flow [2023-08-26 12:10:45,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.0) internal successors, (416), 4 states have internal predecessors, (416), 0 states have call successors, (0), 0 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-26 12:10:45,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:45,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:10:45,290 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:45,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:45,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1723466722, now seen corresponding path program 1 times [2023-08-26 12:10:45,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804955555] [2023-08-26 12:10:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:45,403 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-26 12:10:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804955555] [2023-08-26 12:10:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804955555] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:45,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:45,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:45,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411863484] [2023-08-26 12:10:45,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:45,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:45,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:45,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:45,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 12:10:45,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 240 flow. Second operand has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-26 12:10:45,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:45,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 12:10:45,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:46,269 INFO L124 PetriNetUnfolderBase]: 5702/9203 cut-off events. [2023-08-26 12:10:46,269 INFO L125 PetriNetUnfolderBase]: For 5430/5445 co-relation queries the response was YES. [2023-08-26 12:10:46,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27903 conditions, 9203 events. 5702/9203 cut-off events. For 5430/5445 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 64558 event pairs, 3071 based on Foata normal form. 65/8925 useless extension candidates. Maximal degree in co-relation 27895. Up to 4867 conditions per place. [2023-08-26 12:10:46,304 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 75 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2023-08-26 12:10:46,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 542 flow [2023-08-26 12:10:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 482 transitions. [2023-08-26 12:10:46,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34826589595375723 [2023-08-26 12:10:46,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 482 transitions. [2023-08-26 12:10:46,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 482 transitions. [2023-08-26 12:10:46,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:46,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 482 transitions. [2023-08-26 12:10:46,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-26 12:10:46,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:46,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:46,309 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 240 flow. Second operand 4 states and 482 transitions. [2023-08-26 12:10:46,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 542 flow [2023-08-26 12:10:46,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 85 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:46,319 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 255 flow [2023-08-26 12:10:46,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=255, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-26 12:10:46,320 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -40 predicate places. [2023-08-26 12:10:46,320 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 255 flow [2023-08-26 12:10:46,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 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-26 12:10:46,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:46,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:46,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:10:46,320 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:46,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1985096356, now seen corresponding path program 2 times [2023-08-26 12:10:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:46,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219954744] [2023-08-26 12:10:46,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:46,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:46,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:46,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:46,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219954744] [2023-08-26 12:10:46,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219954744] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:46,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:46,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:46,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975264745] [2023-08-26 12:10:46,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:46,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:46,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:46,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:46,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:46,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 346 [2023-08-26 12:10:46,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 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-26 12:10:46,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:46,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 346 [2023-08-26 12:10:46,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:47,441 INFO L124 PetriNetUnfolderBase]: 5597/9048 cut-off events. [2023-08-26 12:10:47,442 INFO L125 PetriNetUnfolderBase]: For 7398/7423 co-relation queries the response was YES. [2023-08-26 12:10:47,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27073 conditions, 9048 events. 5597/9048 cut-off events. For 7398/7423 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 63463 event pairs, 2580 based on Foata normal form. 75/8187 useless extension candidates. Maximal degree in co-relation 27064. Up to 6660 conditions per place. [2023-08-26 12:10:47,486 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 74 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-26 12:10:47,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 82 transitions, 523 flow [2023-08-26 12:10:47,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:47,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:47,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-26 12:10:47,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3468208092485549 [2023-08-26 12:10:47,488 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-26 12:10:47,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-26 12:10:47,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:47,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-26 12:10:47,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-26 12:10:47,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:47,491 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:47,491 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 255 flow. Second operand 4 states and 480 transitions. [2023-08-26 12:10:47,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 82 transitions, 523 flow [2023-08-26 12:10:47,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 82 transitions, 510 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:47,494 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 246 flow [2023-08-26 12:10:47,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-26 12:10:47,495 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2023-08-26 12:10:47,495 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 246 flow [2023-08-26 12:10:47,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 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-26 12:10:47,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:47,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:47,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:10:47,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:47,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1724618170, now seen corresponding path program 1 times [2023-08-26 12:10:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862008792] [2023-08-26 12:10:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:47,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:47,904 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-26 12:10:47,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:47,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862008792] [2023-08-26 12:10:47,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862008792] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:47,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:47,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:47,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231232656] [2023-08-26 12:10:47,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:47,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:47,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:47,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:47,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 346 [2023-08-26 12:10:47,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 246 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 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-26 12:10:47,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:47,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 346 [2023-08-26 12:10:47,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:49,053 INFO L124 PetriNetUnfolderBase]: 5671/9130 cut-off events. [2023-08-26 12:10:49,053 INFO L125 PetriNetUnfolderBase]: For 6716/6716 co-relation queries the response was YES. [2023-08-26 12:10:49,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27193 conditions, 9130 events. 5671/9130 cut-off events. For 6716/6716 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 63827 event pairs, 2370 based on Foata normal form. 20/8231 useless extension candidates. Maximal degree in co-relation 27185. Up to 6851 conditions per place. [2023-08-26 12:10:49,099 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 93 selfloop transitions, 12 changer transitions 0/106 dead transitions. [2023-08-26 12:10:49,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 106 transitions, 703 flow [2023-08-26 12:10:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-26 12:10:49,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3453757225433526 [2023-08-26 12:10:49,101 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-26 12:10:49,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-26 12:10:49,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:49,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-26 12:10:49,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 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-26 12:10:49,104 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:49,104 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:49,104 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 246 flow. Second operand 4 states and 478 transitions. [2023-08-26 12:10:49,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 106 transitions, 703 flow [2023-08-26 12:10:49,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 106 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:49,108 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 332 flow [2023-08-26 12:10:49,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=332, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2023-08-26 12:10:49,108 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:49,108 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 332 flow [2023-08-26 12:10:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 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-26 12:10:49,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:49,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:49,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:10:49,109 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:49,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:49,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1887849998, now seen corresponding path program 1 times [2023-08-26 12:10:49,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:49,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99593729] [2023-08-26 12:10:49,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:49,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:49,923 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-26 12:10:49,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:49,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99593729] [2023-08-26 12:10:49,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99593729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:49,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:49,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722276793] [2023-08-26 12:10:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:49,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 346 [2023-08-26 12:10:49,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 332 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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-26 12:10:49,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:49,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 346 [2023-08-26 12:10:49,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:51,222 INFO L124 PetriNetUnfolderBase]: 6230/10016 cut-off events. [2023-08-26 12:10:51,222 INFO L125 PetriNetUnfolderBase]: For 8156/8181 co-relation queries the response was YES. [2023-08-26 12:10:51,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31619 conditions, 10016 events. 6230/10016 cut-off events. For 8156/8181 co-relation queries the response was YES. Maximal size of possible extension queue 807. Compared 71330 event pairs, 2940 based on Foata normal form. 45/8957 useless extension candidates. Maximal degree in co-relation 31610. Up to 6674 conditions per place. [2023-08-26 12:10:51,257 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 85 selfloop transitions, 19 changer transitions 0/107 dead transitions. [2023-08-26 12:10:51,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 728 flow [2023-08-26 12:10:51,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-26 12:10:51,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3578034682080925 [2023-08-26 12:10:51,259 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-26 12:10:51,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-26 12:10:51,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:51,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-26 12:10:51,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 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-26 12:10:51,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:10:51,263 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:10:51,263 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 332 flow. Second operand 5 states and 619 transitions. [2023-08-26 12:10:51,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 728 flow [2023-08-26 12:10:51,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 107 transitions, 717 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:51,273 INFO L231 Difference]: Finished difference. Result has 62 places, 65 transitions, 418 flow [2023-08-26 12:10:51,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=418, PETRI_PLACES=62, PETRI_TRANSITIONS=65} [2023-08-26 12:10:51,274 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -35 predicate places. [2023-08-26 12:10:51,274 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 65 transitions, 418 flow [2023-08-26 12:10:51,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 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-26 12:10:51,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:51,275 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:51,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:10:51,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:51,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:51,275 INFO L85 PathProgramCache]: Analyzing trace with hash -602687502, now seen corresponding path program 2 times [2023-08-26 12:10:51,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869780251] [2023-08-26 12:10:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:52,259 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-26 12:10:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869780251] [2023-08-26 12:10:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869780251] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:52,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071325668] [2023-08-26 12:10:52,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:52,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:52,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 346 [2023-08-26 12:10:52,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 65 transitions, 418 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 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-26 12:10:52,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:52,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 346 [2023-08-26 12:10:52,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:53,481 INFO L124 PetriNetUnfolderBase]: 7120/11384 cut-off events. [2023-08-26 12:10:53,481 INFO L125 PetriNetUnfolderBase]: For 14178/14205 co-relation queries the response was YES. [2023-08-26 12:10:53,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38912 conditions, 11384 events. 7120/11384 cut-off events. For 14178/14205 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 82332 event pairs, 2822 based on Foata normal form. 47/10883 useless extension candidates. Maximal degree in co-relation 38902. Up to 6792 conditions per place. [2023-08-26 12:10:53,546 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 104 selfloop transitions, 28 changer transitions 0/135 dead transitions. [2023-08-26 12:10:53,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 135 transitions, 997 flow [2023-08-26 12:10:53,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions. [2023-08-26 12:10:53,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.355009633911368 [2023-08-26 12:10:53,548 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 737 transitions. [2023-08-26 12:10:53,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions. [2023-08-26 12:10:53,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:53,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions. [2023-08-26 12:10:53,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 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-26 12:10:53,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:10:53,552 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:10:53,552 INFO L175 Difference]: Start difference. First operand has 62 places, 65 transitions, 418 flow. Second operand 6 states and 737 transitions. [2023-08-26 12:10:53,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 135 transitions, 997 flow [2023-08-26 12:10:53,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 135 transitions, 969 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:53,570 INFO L231 Difference]: Finished difference. Result has 66 places, 75 transitions, 557 flow [2023-08-26 12:10:53,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=557, PETRI_PLACES=66, PETRI_TRANSITIONS=75} [2023-08-26 12:10:53,570 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-08-26 12:10:53,570 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 75 transitions, 557 flow [2023-08-26 12:10:53,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 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-26 12:10:53,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:53,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:53,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:10:53,571 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:53,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:53,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1923557348, now seen corresponding path program 3 times [2023-08-26 12:10:53,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:53,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087385002] [2023-08-26 12:10:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:53,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:54,681 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-26 12:10:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087385002] [2023-08-26 12:10:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087385002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:54,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:54,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:54,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802068558] [2023-08-26 12:10:54,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:54,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:54,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:54,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:54,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 346 [2023-08-26 12:10:54,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 75 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-26 12:10:54,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:54,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 346 [2023-08-26 12:10:54,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:56,006 INFO L124 PetriNetUnfolderBase]: 7792/12424 cut-off events. [2023-08-26 12:10:56,006 INFO L125 PetriNetUnfolderBase]: For 23207/23212 co-relation queries the response was YES. [2023-08-26 12:10:56,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46737 conditions, 12424 events. 7792/12424 cut-off events. For 23207/23212 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 90939 event pairs, 3527 based on Foata normal form. 17/11827 useless extension candidates. Maximal degree in co-relation 46725. Up to 9042 conditions per place. [2023-08-26 12:10:56,078 INFO L140 encePairwiseOnDemand]: 338/346 looper letters, 98 selfloop transitions, 45 changer transitions 0/146 dead transitions. [2023-08-26 12:10:56,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 146 transitions, 1300 flow [2023-08-26 12:10:56,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-26 12:10:56,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3444123314065511 [2023-08-26 12:10:56,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-26 12:10:56,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-26 12:10:56,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:56,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-26 12:10:56,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 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-26 12:10:56,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:10:56,084 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:10:56,084 INFO L175 Difference]: Start difference. First operand has 66 places, 75 transitions, 557 flow. Second operand 6 states and 715 transitions. [2023-08-26 12:10:56,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 146 transitions, 1300 flow [2023-08-26 12:10:56,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 146 transitions, 1254 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:56,129 INFO L231 Difference]: Finished difference. Result has 71 places, 100 transitions, 952 flow [2023-08-26 12:10:56,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=952, PETRI_PLACES=71, PETRI_TRANSITIONS=100} [2023-08-26 12:10:56,130 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -26 predicate places. [2023-08-26 12:10:56,130 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 100 transitions, 952 flow [2023-08-26 12:10:56,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-26 12:10:56,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:56,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:56,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:10:56,130 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:56,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:56,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1887781290, now seen corresponding path program 1 times [2023-08-26 12:10:56,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:56,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053144007] [2023-08-26 12:10:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:56,207 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-26 12:10:56,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:56,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053144007] [2023-08-26 12:10:56,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053144007] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:56,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:56,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:56,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299079336] [2023-08-26 12:10:56,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:56,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:56,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:56,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:56,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:56,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 346 [2023-08-26 12:10:56,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 100 transitions, 952 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-26 12:10:56,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:56,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 346 [2023-08-26 12:10:56,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:57,407 INFO L124 PetriNetUnfolderBase]: 6431/10277 cut-off events. [2023-08-26 12:10:57,407 INFO L125 PetriNetUnfolderBase]: For 27534/27534 co-relation queries the response was YES. [2023-08-26 12:10:57,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42473 conditions, 10277 events. 6431/10277 cut-off events. For 27534/27534 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 72169 event pairs, 2485 based on Foata normal form. 230/10134 useless extension candidates. Maximal degree in co-relation 42458. Up to 3853 conditions per place. [2023-08-26 12:10:57,451 INFO L140 encePairwiseOnDemand]: 329/346 looper letters, 118 selfloop transitions, 36 changer transitions 0/155 dead transitions. [2023-08-26 12:10:57,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 155 transitions, 1857 flow [2023-08-26 12:10:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:57,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-08-26 12:10:57,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3309248554913295 [2023-08-26 12:10:57,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-08-26 12:10:57,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-08-26 12:10:57,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:57,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-08-26 12:10:57,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 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-26 12:10:57,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:57,455 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:10:57,455 INFO L175 Difference]: Start difference. First operand has 71 places, 100 transitions, 952 flow. Second operand 4 states and 458 transitions. [2023-08-26 12:10:57,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 155 transitions, 1857 flow [2023-08-26 12:10:57,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 155 transitions, 1768 flow, removed 44 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:57,490 INFO L231 Difference]: Finished difference. Result has 75 places, 126 transitions, 1393 flow [2023-08-26 12:10:57,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1393, PETRI_PLACES=75, PETRI_TRANSITIONS=126} [2023-08-26 12:10:57,491 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -22 predicate places. [2023-08-26 12:10:57,491 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 126 transitions, 1393 flow [2023-08-26 12:10:57,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 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-26 12:10:57,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:57,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:57,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:10:57,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:57,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:57,492 INFO L85 PathProgramCache]: Analyzing trace with hash 268881849, now seen corresponding path program 1 times [2023-08-26 12:10:57,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:57,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282503522] [2023-08-26 12:10:57,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:57,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:58,334 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-26 12:10:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282503522] [2023-08-26 12:10:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282503522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:10:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335957348] [2023-08-26 12:10:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:58,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:10:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:58,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:10:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:10:58,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 346 [2023-08-26 12:10:58,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 126 transitions, 1393 flow. Second operand has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-26 12:10:58,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:58,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 346 [2023-08-26 12:10:58,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:00,134 INFO L124 PetriNetUnfolderBase]: 7884/12676 cut-off events. [2023-08-26 12:11:00,134 INFO L125 PetriNetUnfolderBase]: For 34877/34877 co-relation queries the response was YES. [2023-08-26 12:11:00,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54228 conditions, 12676 events. 7884/12676 cut-off events. For 34877/34877 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 93597 event pairs, 2162 based on Foata normal form. 72/12372 useless extension candidates. Maximal degree in co-relation 54212. Up to 7762 conditions per place. [2023-08-26 12:11:00,231 INFO L140 encePairwiseOnDemand]: 336/346 looper letters, 197 selfloop transitions, 86 changer transitions 2/286 dead transitions. [2023-08-26 12:11:00,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 286 transitions, 3336 flow [2023-08-26 12:11:00,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 12:11:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 12:11:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1490 transitions. [2023-08-26 12:11:00,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28709055876685935 [2023-08-26 12:11:00,248 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1490 transitions. [2023-08-26 12:11:00,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1490 transitions. [2023-08-26 12:11:00,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:00,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1490 transitions. [2023-08-26 12:11:00,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.33333333333333) internal successors, (1490), 15 states have internal predecessors, (1490), 0 states have call successors, (0), 0 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-26 12:11:00,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 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-26 12:11:00,255 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 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-26 12:11:00,255 INFO L175 Difference]: Start difference. First operand has 75 places, 126 transitions, 1393 flow. Second operand 15 states and 1490 transitions. [2023-08-26 12:11:00,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 286 transitions, 3336 flow [2023-08-26 12:11:00,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 286 transitions, 3322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:00,407 INFO L231 Difference]: Finished difference. Result has 96 places, 197 transitions, 2641 flow [2023-08-26 12:11:00,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1389, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2641, PETRI_PLACES=96, PETRI_TRANSITIONS=197} [2023-08-26 12:11:00,408 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 12:11:00,408 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 197 transitions, 2641 flow [2023-08-26 12:11:00,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.75) internal successors, (734), 8 states have internal predecessors, (734), 0 states have call successors, (0), 0 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-26 12:11:00,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:00,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:00,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:11:00,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:00,409 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash 499194495, now seen corresponding path program 2 times [2023-08-26 12:11:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89445297] [2023-08-26 12:11:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:00,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:00,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:01,143 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-26 12:11:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:01,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89445297] [2023-08-26 12:11:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89445297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:01,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:11:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743445003] [2023-08-26 12:11:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:01,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:11:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:11:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:11:01,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 346 [2023-08-26 12:11:01,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 197 transitions, 2641 flow. Second operand has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 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-26 12:11:01,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:01,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 346 [2023-08-26 12:11:01,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:03,554 INFO L124 PetriNetUnfolderBase]: 8988/14619 cut-off events. [2023-08-26 12:11:03,554 INFO L125 PetriNetUnfolderBase]: For 53014/53014 co-relation queries the response was YES. [2023-08-26 12:11:03,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67452 conditions, 14619 events. 8988/14619 cut-off events. For 53014/53014 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 112284 event pairs, 1663 based on Foata normal form. 36/14199 useless extension candidates. Maximal degree in co-relation 67427. Up to 5852 conditions per place. [2023-08-26 12:11:03,657 INFO L140 encePairwiseOnDemand]: 335/346 looper letters, 251 selfloop transitions, 126 changer transitions 1/379 dead transitions. [2023-08-26 12:11:03,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 379 transitions, 4839 flow [2023-08-26 12:11:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 12:11:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 12:11:03,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1619 transitions. [2023-08-26 12:11:03,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2924494219653179 [2023-08-26 12:11:03,660 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1619 transitions. [2023-08-26 12:11:03,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1619 transitions. [2023-08-26 12:11:03,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:03,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1619 transitions. [2023-08-26 12:11:03,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 101.1875) internal successors, (1619), 16 states have internal predecessors, (1619), 0 states have call successors, (0), 0 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-26 12:11:03,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 346.0) internal successors, (5882), 17 states have internal predecessors, (5882), 0 states have call successors, (0), 0 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-26 12:11:03,668 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 346.0) internal successors, (5882), 17 states have internal predecessors, (5882), 0 states have call successors, (0), 0 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-26 12:11:03,668 INFO L175 Difference]: Start difference. First operand has 96 places, 197 transitions, 2641 flow. Second operand 16 states and 1619 transitions. [2023-08-26 12:11:03,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 379 transitions, 4839 flow [2023-08-26 12:11:04,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 379 transitions, 4705 flow, removed 67 selfloop flow, removed 0 redundant places. [2023-08-26 12:11:04,006 INFO L231 Difference]: Finished difference. Result has 118 places, 256 transitions, 3704 flow [2023-08-26 12:11:04,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=2507, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3704, PETRI_PLACES=118, PETRI_TRANSITIONS=256} [2023-08-26 12:11:04,006 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2023-08-26 12:11:04,006 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 256 transitions, 3704 flow [2023-08-26 12:11:04,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 91.4) internal successors, (914), 10 states have internal predecessors, (914), 0 states have call successors, (0), 0 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-26 12:11:04,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:04,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:04,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:11:04,007 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:04,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:04,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1608321714, now seen corresponding path program 1 times [2023-08-26 12:11:04,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:04,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029785080] [2023-08-26 12:11:04,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:04,129 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-26 12:11:04,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029785080] [2023-08-26 12:11:04,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029785080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:04,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:04,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:04,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884133528] [2023-08-26 12:11:04,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:04,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:04,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:04,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:04,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:04,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 346 [2023-08-26 12:11:04,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 256 transitions, 3704 flow. Second operand has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 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-26 12:11:04,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:04,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 346 [2023-08-26 12:11:04,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:05,724 INFO L124 PetriNetUnfolderBase]: 6838/11265 cut-off events. [2023-08-26 12:11:05,724 INFO L125 PetriNetUnfolderBase]: For 52789/52789 co-relation queries the response was YES. [2023-08-26 12:11:05,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54518 conditions, 11265 events. 6838/11265 cut-off events. For 52789/52789 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 84664 event pairs, 2474 based on Foata normal form. 332/11369 useless extension candidates. Maximal degree in co-relation 54485. Up to 4954 conditions per place. [2023-08-26 12:11:05,804 INFO L140 encePairwiseOnDemand]: 328/346 looper letters, 274 selfloop transitions, 66 changer transitions 8/349 dead transitions. [2023-08-26 12:11:05,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 349 transitions, 5491 flow [2023-08-26 12:11:05,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:05,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:05,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions. [2023-08-26 12:11:05,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3155105973025048 [2023-08-26 12:11:05,806 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 655 transitions. [2023-08-26 12:11:05,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions. [2023-08-26 12:11:05,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:05,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions. [2023-08-26 12:11:05,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 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-26 12:11:05,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:11:05,809 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 346.0) internal successors, (2422), 7 states have internal predecessors, (2422), 0 states have call successors, (0), 0 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-26 12:11:05,809 INFO L175 Difference]: Start difference. First operand has 118 places, 256 transitions, 3704 flow. Second operand 6 states and 655 transitions. [2023-08-26 12:11:05,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 349 transitions, 5491 flow [2023-08-26 12:11:06,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 349 transitions, 5354 flow, removed 40 selfloop flow, removed 7 redundant places. [2023-08-26 12:11:06,178 INFO L231 Difference]: Finished difference. Result has 118 places, 276 transitions, 4155 flow [2023-08-26 12:11:06,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4155, PETRI_PLACES=118, PETRI_TRANSITIONS=276} [2023-08-26 12:11:06,179 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 21 predicate places. [2023-08-26 12:11:06,179 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 276 transitions, 4155 flow [2023-08-26 12:11:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 99.0) internal successors, (693), 7 states have internal predecessors, (693), 0 states have call successors, (0), 0 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-26 12:11:06,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:06,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:06,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:11:06,180 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:06,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1681631572, now seen corresponding path program 1 times [2023-08-26 12:11:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848480730] [2023-08-26 12:11:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:06,401 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-26 12:11:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848480730] [2023-08-26 12:11:06,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848480730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:06,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:06,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:11:06,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17567006] [2023-08-26 12:11:06,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:06,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:11:06,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:06,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:11:06,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:11:06,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 346 [2023-08-26 12:11:06,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 276 transitions, 4155 flow. Second operand has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 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-26 12:11:06,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:06,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 346 [2023-08-26 12:11:06,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:07,884 INFO L124 PetriNetUnfolderBase]: 5783/8993 cut-off events. [2023-08-26 12:11:07,885 INFO L125 PetriNetUnfolderBase]: For 50503/50503 co-relation queries the response was YES. [2023-08-26 12:11:07,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46753 conditions, 8993 events. 5783/8993 cut-off events. For 50503/50503 co-relation queries the response was YES. Maximal size of possible extension queue 599. Compared 58481 event pairs, 570 based on Foata normal form. 332/9325 useless extension candidates. Maximal degree in co-relation 46719. Up to 4448 conditions per place. [2023-08-26 12:11:07,927 INFO L140 encePairwiseOnDemand]: 332/346 looper letters, 47 selfloop transitions, 10 changer transitions 296/354 dead transitions. [2023-08-26 12:11:07,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 354 transitions, 5661 flow [2023-08-26 12:11:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:11:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:11:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 824 transitions. [2023-08-26 12:11:07,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2976878612716763 [2023-08-26 12:11:07,929 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 824 transitions. [2023-08-26 12:11:07,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 824 transitions. [2023-08-26 12:11:07,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:07,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 824 transitions. [2023-08-26 12:11:07,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.0) internal successors, (824), 8 states have internal predecessors, (824), 0 states have call successors, (0), 0 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-26 12:11:07,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 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-26 12:11:07,933 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 346.0) internal successors, (3114), 9 states have internal predecessors, (3114), 0 states have call successors, (0), 0 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-26 12:11:07,933 INFO L175 Difference]: Start difference. First operand has 118 places, 276 transitions, 4155 flow. Second operand 8 states and 824 transitions. [2023-08-26 12:11:07,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 354 transitions, 5661 flow [2023-08-26 12:11:08,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 354 transitions, 5593 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-26 12:11:08,255 INFO L231 Difference]: Finished difference. Result has 112 places, 47 transitions, 477 flow [2023-08-26 12:11:08,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=4035, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=477, PETRI_PLACES=112, PETRI_TRANSITIONS=47} [2023-08-26 12:11:08,255 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 15 predicate places. [2023-08-26 12:11:08,255 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 47 transitions, 477 flow [2023-08-26 12:11:08,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.5) internal successors, (955), 10 states have internal predecessors, (955), 0 states have call successors, (0), 0 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-26 12:11:08,256 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:08,256 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:08,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:11:08,256 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:08,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:08,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2057016129, now seen corresponding path program 1 times [2023-08-26 12:11:08,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:08,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748065773] [2023-08-26 12:11:08,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:08,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:08,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:08,387 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-26 12:11:08,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748065773] [2023-08-26 12:11:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748065773] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976127987] [2023-08-26 12:11:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:08,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:08,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:08,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:08,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:11:08,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 47 transitions, 477 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 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-26 12:11:08,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:08,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:11:08,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:08,542 INFO L124 PetriNetUnfolderBase]: 453/821 cut-off events. [2023-08-26 12:11:08,543 INFO L125 PetriNetUnfolderBase]: For 5177/5260 co-relation queries the response was YES. [2023-08-26 12:11:08,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 821 events. 453/821 cut-off events. For 5177/5260 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4043 event pairs, 98 based on Foata normal form. 32/845 useless extension candidates. Maximal degree in co-relation 3584. Up to 640 conditions per place. [2023-08-26 12:11:08,548 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 55 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2023-08-26 12:11:08,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 70 transitions, 801 flow [2023-08-26 12:11:08,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-26 12:11:08,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38246628131021193 [2023-08-26 12:11:08,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-26 12:11:08,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-26 12:11:08,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:08,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-26 12:11:08,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 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-26 12:11:08,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:11:08,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 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-26 12:11:08,552 INFO L175 Difference]: Start difference. First operand has 112 places, 47 transitions, 477 flow. Second operand 3 states and 397 transitions. [2023-08-26 12:11:08,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 70 transitions, 801 flow [2023-08-26 12:11:08,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 70 transitions, 648 flow, removed 28 selfloop flow, removed 20 redundant places. [2023-08-26 12:11:08,557 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 389 flow [2023-08-26 12:11:08,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=389, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-08-26 12:11:08,558 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 12:11:08,558 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 389 flow [2023-08-26 12:11:08,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 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-26 12:11:08,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:08,558 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:08,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:11:08,558 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:08,559 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1535761512, now seen corresponding path program 1 times [2023-08-26 12:11:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035685455] [2023-08-26 12:11:08,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:09,894 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-26 12:11:09,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:09,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035685455] [2023-08-26 12:11:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035685455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401636332] [2023-08-26 12:11:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:09,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:09,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:09,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:09,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:09,896 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 346 [2023-08-26 12:11:09,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-26 12:11:09,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:09,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 346 [2023-08-26 12:11:09,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:10,179 INFO L124 PetriNetUnfolderBase]: 511/906 cut-off events. [2023-08-26 12:11:10,179 INFO L125 PetriNetUnfolderBase]: For 2825/2825 co-relation queries the response was YES. [2023-08-26 12:11:10,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 906 events. 511/906 cut-off events. For 2825/2825 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4415 event pairs, 236 based on Foata normal form. 3/908 useless extension candidates. Maximal degree in co-relation 4047. Up to 768 conditions per place. [2023-08-26 12:11:10,184 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 47 selfloop transitions, 15 changer transitions 0/63 dead transitions. [2023-08-26 12:11:10,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 63 transitions, 575 flow [2023-08-26 12:11:10,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 557 transitions. [2023-08-26 12:11:10,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3219653179190751 [2023-08-26 12:11:10,188 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 557 transitions. [2023-08-26 12:11:10,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 557 transitions. [2023-08-26 12:11:10,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:10,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 557 transitions. [2023-08-26 12:11:10,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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-26 12:11:10,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:10,190 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:10,190 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 389 flow. Second operand 5 states and 557 transitions. [2023-08-26 12:11:10,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 63 transitions, 575 flow [2023-08-26 12:11:10,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 63 transitions, 565 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:10,195 INFO L231 Difference]: Finished difference. Result has 77 places, 51 transitions, 433 flow [2023-08-26 12:11:10,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=433, PETRI_PLACES=77, PETRI_TRANSITIONS=51} [2023-08-26 12:11:10,195 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -20 predicate places. [2023-08-26 12:11:10,195 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 51 transitions, 433 flow [2023-08-26 12:11:10,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-26 12:11:10,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:10,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:10,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:11:10,196 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:10,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:10,196 INFO L85 PathProgramCache]: Analyzing trace with hash 239220736, now seen corresponding path program 2 times [2023-08-26 12:11:10,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:10,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207317548] [2023-08-26 12:11:10,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:10,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:11,465 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-26 12:11:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207317548] [2023-08-26 12:11:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207317548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:11,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:11,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:11:11,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649039763] [2023-08-26 12:11:11,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:11,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:11:11,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:11,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:11:11,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:11:11,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 346 [2023-08-26 12:11:11,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 51 transitions, 433 flow. Second operand has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-26 12:11:11,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:11,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 346 [2023-08-26 12:11:11,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:11,787 INFO L124 PetriNetUnfolderBase]: 813/1436 cut-off events. [2023-08-26 12:11:11,787 INFO L125 PetriNetUnfolderBase]: For 5679/5679 co-relation queries the response was YES. [2023-08-26 12:11:11,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 1436 events. 813/1436 cut-off events. For 5679/5679 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8001 event pairs, 162 based on Foata normal form. 3/1438 useless extension candidates. Maximal degree in co-relation 6762. Up to 946 conditions per place. [2023-08-26 12:11:11,794 INFO L140 encePairwiseOnDemand]: 337/346 looper letters, 80 selfloop transitions, 43 changer transitions 0/124 dead transitions. [2023-08-26 12:11:11,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 124 transitions, 1281 flow [2023-08-26 12:11:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 813 transitions. [2023-08-26 12:11:11,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3356729975227085 [2023-08-26 12:11:11,795 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 813 transitions. [2023-08-26 12:11:11,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 813 transitions. [2023-08-26 12:11:11,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:11,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 813 transitions. [2023-08-26 12:11:11,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.14285714285714) internal successors, (813), 7 states have internal predecessors, (813), 0 states have call successors, (0), 0 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-26 12:11:11,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 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-26 12:11:11,799 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 346.0) internal successors, (2768), 8 states have internal predecessors, (2768), 0 states have call successors, (0), 0 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-26 12:11:11,799 INFO L175 Difference]: Start difference. First operand has 77 places, 51 transitions, 433 flow. Second operand 7 states and 813 transitions. [2023-08-26 12:11:11,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 124 transitions, 1281 flow [2023-08-26 12:11:11,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 124 transitions, 1188 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-26 12:11:11,806 INFO L231 Difference]: Finished difference. Result has 83 places, 85 transitions, 880 flow [2023-08-26 12:11:11,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=880, PETRI_PLACES=83, PETRI_TRANSITIONS=85} [2023-08-26 12:11:11,806 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -14 predicate places. [2023-08-26 12:11:11,806 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 85 transitions, 880 flow [2023-08-26 12:11:11,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.125) internal successors, (873), 8 states have internal predecessors, (873), 0 states have call successors, (0), 0 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-26 12:11:11,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:11,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:11:11,807 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:11,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:11,807 INFO L85 PathProgramCache]: Analyzing trace with hash -883754388, now seen corresponding path program 3 times [2023-08-26 12:11:11,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845052050] [2023-08-26 12:11:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:12,876 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-26 12:11:12,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:12,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845052050] [2023-08-26 12:11:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845052050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:12,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:12,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134076059] [2023-08-26 12:11:12,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:12,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:12,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:12,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:12,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:12,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 346 [2023-08-26 12:11:12,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 85 transitions, 880 flow. Second operand has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-26 12:11:12,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:12,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 346 [2023-08-26 12:11:12,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:13,136 INFO L124 PetriNetUnfolderBase]: 808/1430 cut-off events. [2023-08-26 12:11:13,136 INFO L125 PetriNetUnfolderBase]: For 6909/6909 co-relation queries the response was YES. [2023-08-26 12:11:13,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7417 conditions, 1430 events. 808/1430 cut-off events. For 6909/6909 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7951 event pairs, 212 based on Foata normal form. 3/1432 useless extension candidates. Maximal degree in co-relation 7390. Up to 989 conditions per place. [2023-08-26 12:11:13,143 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 64 selfloop transitions, 35 changer transitions 0/100 dead transitions. [2023-08-26 12:11:13,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 100 transitions, 1174 flow [2023-08-26 12:11:13,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:13,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:13,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 556 transitions. [2023-08-26 12:11:13,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3213872832369942 [2023-08-26 12:11:13,144 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 556 transitions. [2023-08-26 12:11:13,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 556 transitions. [2023-08-26 12:11:13,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:13,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 556 transitions. [2023-08-26 12:11:13,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.2) internal successors, (556), 5 states have internal predecessors, (556), 0 states have call successors, (0), 0 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-26 12:11:13,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:13,146 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:13,147 INFO L175 Difference]: Start difference. First operand has 83 places, 85 transitions, 880 flow. Second operand 5 states and 556 transitions. [2023-08-26 12:11:13,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 100 transitions, 1174 flow [2023-08-26 12:11:13,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 100 transitions, 1169 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:13,155 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 1023 flow [2023-08-26 12:11:13,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1023, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-26 12:11:13,156 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -9 predicate places. [2023-08-26 12:11:13,156 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 1023 flow [2023-08-26 12:11:13,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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-26 12:11:13,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:13,156 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-26 12:11:13,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:11:13,156 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:13,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:13,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1606282742, now seen corresponding path program 1 times [2023-08-26 12:11:13,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:13,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458759942] [2023-08-26 12:11:13,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:13,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:13,270 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-26 12:11:13,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:13,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458759942] [2023-08-26 12:11:13,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458759942] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:13,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:13,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:13,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490625374] [2023-08-26 12:11:13,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:13,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:13,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:13,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:13,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:13,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:11:13,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 1023 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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-26 12:11:13,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:13,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:11:13,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:13,417 INFO L124 PetriNetUnfolderBase]: 347/739 cut-off events. [2023-08-26 12:11:13,417 INFO L125 PetriNetUnfolderBase]: For 4854/4888 co-relation queries the response was YES. [2023-08-26 12:11:13,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3869 conditions, 739 events. 347/739 cut-off events. For 4854/4888 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4115 event pairs, 25 based on Foata normal form. 96/832 useless extension candidates. Maximal degree in co-relation 3840. Up to 272 conditions per place. [2023-08-26 12:11:13,420 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 92 selfloop transitions, 7 changer transitions 0/127 dead transitions. [2023-08-26 12:11:13,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 127 transitions, 1641 flow [2023-08-26 12:11:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 528 transitions. [2023-08-26 12:11:13,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3815028901734104 [2023-08-26 12:11:13,422 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 528 transitions. [2023-08-26 12:11:13,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 528 transitions. [2023-08-26 12:11:13,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:13,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 528 transitions. [2023-08-26 12:11:13,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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-26 12:11:13,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:11:13,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 346.0) internal successors, (1730), 5 states have internal predecessors, (1730), 0 states have call successors, (0), 0 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-26 12:11:13,424 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 1023 flow. Second operand 4 states and 528 transitions. [2023-08-26 12:11:13,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 127 transitions, 1641 flow [2023-08-26 12:11:13,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 127 transitions, 1585 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:13,430 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 979 flow [2023-08-26 12:11:13,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=979, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2023-08-26 12:11:13,431 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -7 predicate places. [2023-08-26 12:11:13,431 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 979 flow [2023-08-26 12:11:13,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 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-26 12:11:13,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:13,431 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-26 12:11:13,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 12:11:13,431 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:13,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:13,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1606436628, now seen corresponding path program 1 times [2023-08-26 12:11:13,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:13,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663580587] [2023-08-26 12:11:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:13,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:13,633 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-26 12:11:13,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:13,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663580587] [2023-08-26 12:11:13,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663580587] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:13,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:13,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:13,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694863959] [2023-08-26 12:11:13,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:13,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:13,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:13,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:13,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:13,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:11:13,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 979 flow. Second operand has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 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-26 12:11:13,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:13,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:11:13,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:13,979 INFO L124 PetriNetUnfolderBase]: 1007/2022 cut-off events. [2023-08-26 12:11:13,979 INFO L125 PetriNetUnfolderBase]: For 11371/11402 co-relation queries the response was YES. [2023-08-26 12:11:13,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10547 conditions, 2022 events. 1007/2022 cut-off events. For 11371/11402 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13131 event pairs, 277 based on Foata normal form. 43/2054 useless extension candidates. Maximal degree in co-relation 10517. Up to 823 conditions per place. [2023-08-26 12:11:13,989 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 106 selfloop transitions, 15 changer transitions 7/155 dead transitions. [2023-08-26 12:11:13,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 155 transitions, 1753 flow [2023-08-26 12:11:13,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-26 12:11:13,991 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3838150289017341 [2023-08-26 12:11:13,991 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-26 12:11:13,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-26 12:11:13,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:13,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-26 12:11:13,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 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-26 12:11:13,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:13,993 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:13,993 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 979 flow. Second operand 5 states and 664 transitions. [2023-08-26 12:11:13,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 155 transitions, 1753 flow [2023-08-26 12:11:14,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 1703 flow, removed 13 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:14,007 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 1020 flow [2023-08-26 12:11:14,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1020, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2023-08-26 12:11:14,007 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -2 predicate places. [2023-08-26 12:11:14,008 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 1020 flow [2023-08-26 12:11:14,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 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-26 12:11:14,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:14,008 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-26 12:11:14,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 12:11:14,008 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:14,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:14,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1103246048, now seen corresponding path program 2 times [2023-08-26 12:11:14,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:14,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32050011] [2023-08-26 12:11:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:14,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:14,152 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-26 12:11:14,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:14,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32050011] [2023-08-26 12:11:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32050011] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:14,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:14,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:14,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387401286] [2023-08-26 12:11:14,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:14,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:14,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:14,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:14,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 346 [2023-08-26 12:11:14,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 1020 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-26 12:11:14,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:14,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 346 [2023-08-26 12:11:14,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:14,360 INFO L124 PetriNetUnfolderBase]: 562/1191 cut-off events. [2023-08-26 12:11:14,361 INFO L125 PetriNetUnfolderBase]: For 7705/7748 co-relation queries the response was YES. [2023-08-26 12:11:14,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6148 conditions, 1191 events. 562/1191 cut-off events. For 7705/7748 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 7949 event pairs, 26 based on Foata normal form. 113/1289 useless extension candidates. Maximal degree in co-relation 6115. Up to 531 conditions per place. [2023-08-26 12:11:14,367 INFO L140 encePairwiseOnDemand]: 341/346 looper letters, 89 selfloop transitions, 10 changer transitions 1/125 dead transitions. [2023-08-26 12:11:14,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 125 transitions, 1631 flow [2023-08-26 12:11:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 649 transitions. [2023-08-26 12:11:14,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37514450867052024 [2023-08-26 12:11:14,368 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 649 transitions. [2023-08-26 12:11:14,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 649 transitions. [2023-08-26 12:11:14,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:14,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 649 transitions. [2023-08-26 12:11:14,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 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-26 12:11:14,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:14,370 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 346.0) internal successors, (2076), 6 states have internal predecessors, (2076), 0 states have call successors, (0), 0 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-26 12:11:14,370 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 1020 flow. Second operand 5 states and 649 transitions. [2023-08-26 12:11:14,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 125 transitions, 1631 flow [2023-08-26 12:11:14,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 125 transitions, 1507 flow, removed 25 selfloop flow, removed 4 redundant places. [2023-08-26 12:11:14,379 INFO L231 Difference]: Finished difference. Result has 96 places, 83 transitions, 896 flow [2023-08-26 12:11:14,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=896, PETRI_PLACES=96, PETRI_TRANSITIONS=83} [2023-08-26 12:11:14,380 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 12:11:14,380 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 83 transitions, 896 flow [2023-08-26 12:11:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 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-26 12:11:14,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:14,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:14,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 12:11:14,380 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:14,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1385216776, now seen corresponding path program 1 times [2023-08-26 12:11:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:14,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375432604] [2023-08-26 12:11:14,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:14,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:11:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:14,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:11:14,521 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:11:14,522 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 12:11:14,525 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 12:11:14,526 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 12:11:14,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 12:11:14,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 12:11:14,530 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 12:11:14,531 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 12:11:14,532 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 12:11:14,533 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 12:11:14,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-08-26 12:11:14,533 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:14,538 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:11:14,538 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:11:14,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:11:14 BasicIcfg [2023-08-26 12:11:14,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:11:14,604 INFO L158 Benchmark]: Toolchain (without parser) took 60088.77ms. Allocated memory was 348.1MB in the beginning and 3.9GB in the end (delta: 3.5GB). Free memory was 322.3MB in the beginning and 3.1GB in the end (delta: -2.8GB). Peak memory consumption was 750.0MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,604 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory was 325.5MB in the beginning and 325.4MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:11:14,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.45ms. Allocated memory is still 348.1MB. Free memory was 322.3MB in the beginning and 296.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.89ms. Allocated memory is still 348.1MB. Free memory was 296.9MB in the beginning and 294.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,604 INFO L158 Benchmark]: Boogie Preprocessor took 43.56ms. Allocated memory is still 348.1MB. Free memory was 294.2MB in the beginning and 291.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,605 INFO L158 Benchmark]: RCFGBuilder took 1180.25ms. Allocated memory was 348.1MB in the beginning and 524.3MB in the end (delta: 176.2MB). Free memory was 291.4MB in the beginning and 457.8MB in the end (delta: -166.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,605 INFO L158 Benchmark]: TraceAbstraction took 58304.66ms. Allocated memory was 524.3MB in the beginning and 3.9GB in the end (delta: 3.3GB). Free memory was 456.7MB in the beginning and 3.1GB in the end (delta: -2.6GB). Peak memory consumption was 706.0MB. Max. memory is 16.0GB. [2023-08-26 12:11:14,606 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 348.1MB. Free memory was 325.5MB in the beginning and 325.4MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 484.45ms. Allocated memory is still 348.1MB. Free memory was 322.3MB in the beginning and 296.9MB in the end (delta: 25.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.89ms. Allocated memory is still 348.1MB. Free memory was 296.9MB in the beginning and 294.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.56ms. Allocated memory is still 348.1MB. Free memory was 294.2MB in the beginning and 291.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1180.25ms. Allocated memory was 348.1MB in the beginning and 524.3MB in the end (delta: 176.2MB). Free memory was 291.4MB in the beginning and 457.8MB in the end (delta: -166.4MB). Peak memory consumption was 81.8MB. Max. memory is 16.0GB. * TraceAbstraction took 58304.66ms. Allocated memory was 524.3MB in the beginning and 3.9GB in the end (delta: 3.3GB). Free memory was 456.7MB in the beginning and 3.1GB in the end (delta: -2.6GB). Peak memory consumption was 706.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: 17.4s, 193 PlacesBefore, 97 PlacesAfterwards, 186 TransitionsBefore, 88 TransitionsAfterwards, 8612 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 157 TotalNumberOfCompositions, 49859 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11608, independent: 10813, independent conditional: 0, independent unconditional: 10813, dependent: 795, dependent conditional: 0, dependent unconditional: 795, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3217, independent: 3098, independent conditional: 0, independent unconditional: 3098, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11608, independent: 7715, independent conditional: 0, independent unconditional: 7715, dependent: 676, dependent conditional: 0, dependent unconditional: 676, unknown: 3217, unknown conditional: 0, unknown unconditional: 3217] , Statistics on independence cache: Total cache size (in pairs): 503, Positive cache size: 440, Positive conditional cache size: 0, Positive unconditional cache size: 440, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L852] 0 pthread_t t1837; [L853] FCALL, FORK 0 pthread_create(&t1837, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1837, ((void *)0), P0, ((void *)0))=-1, t1837={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1838; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1838, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1838, ((void *)0), P1, ((void *)0))=0, t1837={6:0}, t1838={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t1839; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 \read(y) [L797] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L798] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L799] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L800] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t1839, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1839, ((void *)0), P2, ((void *)0))=1, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 y$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(y) [L814] 3 y$mem_tmp = y [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] EXPR 3 \read(y) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L815] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L816] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L817] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L818] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L819] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L821] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] EXPR 3 \read(y) [L822] 3 __unbuffered_p2_EAX = y [L823] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L823] 3 y = y$flush_delayed ? y$mem_tmp : y [L824] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 \read(y) [L830] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L830] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L831] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L832] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L833] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L834] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 \read(y) [L863] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L863] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L864] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L865] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L866] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L867] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1837={6:0}, t1838={7:0}, t1839={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 y$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(y) [L873] 0 y$mem_tmp = y [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] EXPR 0 \read(y) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L875] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L876] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L877] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L878] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L880] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L882] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L883] EXPR 0 \read(y) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] EXPR 0 \read(y) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe002_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: 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: 853]: 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: 857]: 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, 249 locations, 100 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: 58.1s, OverallIterations: 26, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1140 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3157 IncrementalHoareTripleChecker+Invalid, 3462 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 305 mSolverCounterUnsat, 28 mSDtfsCounter, 3157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4155occurred in iteration=17, InterpolantAutomatonStates: 134, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 345 NumberOfCodeBlocks, 345 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 3369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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-26 12:11:14,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...