/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --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/weaver/parallel-ticket-6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 16:50:41,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 16:50:42,035 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 16:50:42,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 16:50:42,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 16:50:42,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 16:50:42,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 16:50:42,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 16:50:42,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 16:50:42,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 16:50:42,065 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 16:50:42,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 16:50:42,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 16:50:42,066 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 16:50:42,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 16:50:42,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 16:50:42,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 16:50:42,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 16:50:42,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 16:50:42,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 16:50:42,067 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 16:50:42,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 16:50:42,068 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 16:50:42,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 16:50:42,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 16:50:42,068 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 16:50:42,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 16:50:42,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:50:42,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 16:50:42,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 16:50:42,070 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 16:50:42,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 16:50:42,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 16:50:42,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 16:50:42,335 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 16:50:42,336 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 16:50:42,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-26 16:50:43,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 16:50:43,471 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 16:50:43,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-ticket-6.wvr.c [2023-08-26 16:50:43,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f504013db/24a4584c4ed14070b73789fc7fe12be1/FLAGe3cc2a5e7 [2023-08-26 16:50:43,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f504013db/24a4584c4ed14070b73789fc7fe12be1 [2023-08-26 16:50:43,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 16:50:43,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 16:50:43,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 16:50:43,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 16:50:43,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 16:50:43,501 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,502 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed6a43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43, skipping insertion in model container [2023-08-26 16:50:43,502 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,526 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 16:50:43,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:50:43,683 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 16:50:43,714 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:50:43,722 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 16:50:43,722 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 16:50:43,727 INFO L206 MainTranslator]: Completed translation [2023-08-26 16:50:43,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43 WrapperNode [2023-08-26 16:50:43,727 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 16:50:43,728 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 16:50:43,729 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 16:50:43,729 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 16:50:43,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,750 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,783 INFO L138 Inliner]: procedures = 25, calls = 101, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 290 [2023-08-26 16:50:43,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 16:50:43,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 16:50:43,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 16:50:43,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 16:50:43,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,809 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,811 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 16:50:43,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 16:50:43,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 16:50:43,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 16:50:43,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (1/1) ... [2023-08-26 16:50:43,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:50:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:50:43,838 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 16:50:43,854 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 16:50:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 16:50:43,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 16:50:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 16:50:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 16:50:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 16:50:43,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 16:50:43,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 16:50:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 16:50:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 16:50:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 16:50:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 16:50:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 16:50:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 16:50:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-26 16:50:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-26 16:50:43,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-26 16:50:43,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-26 16:50:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 16:50:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 16:50:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 16:50:43,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 16:50:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 16:50:43,871 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 16:50:43,953 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 16:50:43,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 16:50:44,259 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 16:50:44,309 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 16:50:44,310 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 16:50:44,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:50:44 BoogieIcfgContainer [2023-08-26 16:50:44,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 16:50:44,317 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 16:50:44,317 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 16:50:44,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 16:50:44,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:50:43" (1/3) ... [2023-08-26 16:50:44,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8dcbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:50:44, skipping insertion in model container [2023-08-26 16:50:44,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:50:43" (2/3) ... [2023-08-26 16:50:44,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8dcbd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:50:44, skipping insertion in model container [2023-08-26 16:50:44,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:50:44" (3/3) ... [2023-08-26 16:50:44,321 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-6.wvr.c [2023-08-26 16:50:44,332 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 16:50:44,332 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2023-08-26 16:50:44,332 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 16:50:44,432 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-26 16:50:44,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 233 places, 216 transitions, 480 flow [2023-08-26 16:50:44,544 INFO L124 PetriNetUnfolderBase]: 2/210 cut-off events. [2023-08-26 16:50:44,545 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 16:50:44,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 210 events. 2/210 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 161 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-08-26 16:50:44,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 233 places, 216 transitions, 480 flow [2023-08-26 16:50:44,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 193 transitions, 422 flow [2023-08-26 16:50:44,559 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 16:50:44,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 193 transitions, 422 flow [2023-08-26 16:50:44,566 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 193 transitions, 422 flow [2023-08-26 16:50:44,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 193 transitions, 422 flow [2023-08-26 16:50:44,603 INFO L124 PetriNetUnfolderBase]: 2/193 cut-off events. [2023-08-26 16:50:44,603 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 16:50:44,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 193 events. 2/193 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-08-26 16:50:44,607 INFO L119 LiptonReduction]: Number of co-enabled transitions 3930 [2023-08-26 16:50:51,924 INFO L134 LiptonReduction]: Checked pairs total: 22343 [2023-08-26 16:50:51,924 INFO L136 LiptonReduction]: Total number of compositions: 165 [2023-08-26 16:50:51,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 16:50:51,944 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;@615f0a7a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 16:50:51,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-08-26 16:50:51,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 16:50:51,945 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 16:50:51,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:50:51,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:50:51,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 16:50:51,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:50:51,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:50:51,949 INFO L85 PathProgramCache]: Analyzing trace with hash 837, now seen corresponding path program 1 times [2023-08-26 16:50:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:50:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913201919] [2023-08-26 16:50:51,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:50:51,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:50:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:50:52,015 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 16:50:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:50:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913201919] [2023-08-26 16:50:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913201919] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:50:52,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:50:52,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 16:50:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234463896] [2023-08-26 16:50:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:50:52,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 16:50:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:50:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 16:50:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 16:50:52,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 381 [2023-08-26 16:50:52,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 74 transitions, 184 flow. Second operand has 2 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 16:50:52,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:50:52,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 381 [2023-08-26 16:50:52,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:50:59,157 INFO L124 PetriNetUnfolderBase]: 107865/140906 cut-off events. [2023-08-26 16:50:59,157 INFO L125 PetriNetUnfolderBase]: For 3860/3860 co-relation queries the response was YES. [2023-08-26 16:50:59,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280173 conditions, 140906 events. 107865/140906 cut-off events. For 3860/3860 co-relation queries the response was YES. Maximal size of possible extension queue 5193. Compared 894155 event pairs, 107865 based on Foata normal form. 0/126081 useless extension candidates. Maximal degree in co-relation 229646. Up to 135165 conditions per place. [2023-08-26 16:50:59,818 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 65 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2023-08-26 16:50:59,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 72 transitions, 310 flow [2023-08-26 16:50:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 16:50:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 16:50:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 433 transitions. [2023-08-26 16:50:59,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568241469816273 [2023-08-26 16:50:59,828 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 433 transitions. [2023-08-26 16:50:59,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 433 transitions. [2023-08-26 16:50:59,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:50:59,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 433 transitions. [2023-08-26 16:50:59,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 216.5) internal successors, (433), 2 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 16:50:59,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 0 states have call successors, (0), 0 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 16:50:59,836 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 381.0) internal successors, (1143), 3 states have internal predecessors, (1143), 0 states have call successors, (0), 0 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 16:50:59,837 INFO L175 Difference]: Start difference. First operand has 93 places, 74 transitions, 184 flow. Second operand 2 states and 433 transitions. [2023-08-26 16:50:59,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 72 transitions, 310 flow [2023-08-26 16:51:00,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 72 transitions, 286 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-26 16:51:00,094 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 156 flow [2023-08-26 16:51:00,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=156, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2023-08-26 16:51:00,097 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -13 predicate places. [2023-08-26 16:51:00,097 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 156 flow [2023-08-26 16:51:00,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 183.5) internal successors, (367), 2 states have internal predecessors, (367), 0 states have call successors, (0), 0 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 16:51:00,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:00,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:51:00,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 16:51:00,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:00,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash 823722, now seen corresponding path program 1 times [2023-08-26 16:51:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:00,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499568676] [2023-08-26 16:51:00,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:00,638 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 16:51:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:00,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499568676] [2023-08-26 16:51:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499568676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:00,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:00,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450354397] [2023-08-26 16:51:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:00,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:00,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:00,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 16:51:00,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:51:00,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:00,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 16:51:00,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:06,090 INFO L124 PetriNetUnfolderBase]: 104022/136033 cut-off events. [2023-08-26 16:51:06,090 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:06,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267694 conditions, 136033 events. 104022/136033 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5139. Compared 863481 event pairs, 104022 based on Foata normal form. 0/122236 useless extension candidates. Maximal degree in co-relation 267691. Up to 130293 conditions per place. [2023-08-26 16:51:06,627 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 62 selfloop transitions, 1 changer transitions 0/70 dead transitions. [2023-08-26 16:51:06,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 70 transitions, 278 flow [2023-08-26 16:51:06,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2023-08-26 16:51:06,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44006999125109364 [2023-08-26 16:51:06,632 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2023-08-26 16:51:06,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2023-08-26 16:51:06,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:06,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2023-08-26 16:51:06,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 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 16:51:06,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:06,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:06,636 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 156 flow. Second operand 3 states and 503 transitions. [2023-08-26 16:51:06,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 70 transitions, 278 flow [2023-08-26 16:51:06,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 70 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:51:06,638 INFO L231 Difference]: Finished difference. Result has 80 places, 70 transitions, 154 flow [2023-08-26 16:51:06,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=80, PETRI_TRANSITIONS=70} [2023-08-26 16:51:06,638 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -13 predicate places. [2023-08-26 16:51:06,639 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 70 transitions, 154 flow [2023-08-26 16:51:06,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:51:06,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:06,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:51:06,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 16:51:06,639 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:06,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash 823721, now seen corresponding path program 1 times [2023-08-26 16:51:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620340220] [2023-08-26 16:51:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:06,762 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 16:51:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620340220] [2023-08-26 16:51:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620340220] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:06,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403360217] [2023-08-26 16:51:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:06,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:06,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:06,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:06,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 16:51:06,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 70 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:51:06,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:06,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 16:51:06,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:12,126 INFO L124 PetriNetUnfolderBase]: 100179/131160 cut-off events. [2023-08-26 16:51:12,126 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:12,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257952 conditions, 131160 events. 100179/131160 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 833221 event pairs, 100179 based on Foata normal form. 0/118391 useless extension candidates. Maximal degree in co-relation 257948. Up to 125422 conditions per place. [2023-08-26 16:51:12,627 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 60 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2023-08-26 16:51:12,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 68 transitions, 272 flow [2023-08-26 16:51:12,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-26 16:51:12,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4225721784776903 [2023-08-26 16:51:12,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-26 16:51:12,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-26 16:51:12,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:12,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-26 16:51:12,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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 16:51:12,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:12,632 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:12,633 INFO L175 Difference]: Start difference. First operand has 80 places, 70 transitions, 154 flow. Second operand 3 states and 483 transitions. [2023-08-26 16:51:12,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 68 transitions, 272 flow [2023-08-26 16:51:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 68 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:12,634 INFO L231 Difference]: Finished difference. Result has 79 places, 68 transitions, 151 flow [2023-08-26 16:51:12,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=79, PETRI_TRANSITIONS=68} [2023-08-26 16:51:12,635 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -14 predicate places. [2023-08-26 16:51:12,635 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 68 transitions, 151 flow [2023-08-26 16:51:12,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:51:12,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:12,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:51:12,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 16:51:12,635 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:12,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash 791617946, now seen corresponding path program 1 times [2023-08-26 16:51:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:12,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339399817] [2023-08-26 16:51:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:12,702 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 16:51:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:12,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339399817] [2023-08-26 16:51:12,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339399817] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:12,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:12,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:12,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141557063] [2023-08-26 16:51:12,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:12,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:12,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:12,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:12,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:12,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 16:51:12,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 68 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 16:51:12,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:12,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 16:51:12,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:18,035 INFO L124 PetriNetUnfolderBase]: 99387/130092 cut-off events. [2023-08-26 16:51:18,036 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:18,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255821 conditions, 130092 events. 99387/130092 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 826302 event pairs, 99387 based on Foata normal form. 0/117597 useless extension candidates. Maximal degree in co-relation 255817. Up to 124358 conditions per place. [2023-08-26 16:51:18,532 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 58 selfloop transitions, 1 changer transitions 0/66 dead transitions. [2023-08-26 16:51:18,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 66 transitions, 265 flow [2023-08-26 16:51:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-26 16:51:18,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42082239720035 [2023-08-26 16:51:18,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-26 16:51:18,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-26 16:51:18,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:18,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-26 16:51:18,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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 16:51:18,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:18,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:18,537 INFO L175 Difference]: Start difference. First operand has 79 places, 68 transitions, 151 flow. Second operand 3 states and 481 transitions. [2023-08-26 16:51:18,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 66 transitions, 265 flow [2023-08-26 16:51:18,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:18,539 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 148 flow [2023-08-26 16:51:18,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2023-08-26 16:51:18,539 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -15 predicate places. [2023-08-26 16:51:18,539 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 148 flow [2023-08-26 16:51:18,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 16:51:18,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:18,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:51:18,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 16:51:18,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:18,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash 791617945, now seen corresponding path program 1 times [2023-08-26 16:51:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:18,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999527935] [2023-08-26 16:51:18,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:18,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:18,631 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 16:51:18,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999527935] [2023-08-26 16:51:18,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999527935] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:18,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:18,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:18,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932091181] [2023-08-26 16:51:18,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:18,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:18,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:18,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:18,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:18,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 16:51:18,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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 16:51:18,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:18,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 16:51:18,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:23,740 INFO L124 PetriNetUnfolderBase]: 98595/129024 cut-off events. [2023-08-26 16:51:23,740 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:23,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253690 conditions, 129024 events. 98595/129024 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 819580 event pairs, 98595 based on Foata normal form. 0/116803 useless extension candidates. Maximal degree in co-relation 253686. Up to 123294 conditions per place. [2023-08-26 16:51:24,276 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 56 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2023-08-26 16:51:24,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 64 transitions, 258 flow [2023-08-26 16:51:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2023-08-26 16:51:24,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348206474190726 [2023-08-26 16:51:24,278 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 497 transitions. [2023-08-26 16:51:24,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions. [2023-08-26 16:51:24,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:24,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions. [2023-08-26 16:51:24,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 0 states have call successors, (0), 0 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 16:51:24,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:24,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:24,282 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 148 flow. Second operand 3 states and 497 transitions. [2023-08-26 16:51:24,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 64 transitions, 258 flow [2023-08-26 16:51:24,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 64 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:24,283 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 145 flow [2023-08-26 16:51:24,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2023-08-26 16:51:24,284 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-08-26 16:51:24,284 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 145 flow [2023-08-26 16:51:24,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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 16:51:24,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:24,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:24,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 16:51:24,285 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:24,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:24,285 INFO L85 PathProgramCache]: Analyzing trace with hash 535656059, now seen corresponding path program 1 times [2023-08-26 16:51:24,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:24,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50059545] [2023-08-26 16:51:24,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:24,364 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 16:51:24,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:24,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50059545] [2023-08-26 16:51:24,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50059545] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:24,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:24,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:24,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972988155] [2023-08-26 16:51:24,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:24,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:24,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:24,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:24,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:24,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 16:51:24,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 64 transitions, 145 flow. Second operand has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 16:51:24,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:24,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 16:51:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:29,515 INFO L124 PetriNetUnfolderBase]: 98307/128592 cut-off events. [2023-08-26 16:51:29,516 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252843 conditions, 128592 events. 98307/128592 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 816758 event pairs, 98307 based on Foata normal form. 0/116503 useless extension candidates. Maximal degree in co-relation 252839. Up to 122878 conditions per place. [2023-08-26 16:51:30,216 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 54 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2023-08-26 16:51:30,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 62 transitions, 251 flow [2023-08-26 16:51:30,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 477 transitions. [2023-08-26 16:51:30,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41732283464566927 [2023-08-26 16:51:30,218 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 477 transitions. [2023-08-26 16:51:30,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 477 transitions. [2023-08-26 16:51:30,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:30,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 477 transitions. [2023-08-26 16:51:30,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 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 16:51:30,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:30,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:30,222 INFO L175 Difference]: Start difference. First operand has 77 places, 64 transitions, 145 flow. Second operand 3 states and 477 transitions. [2023-08-26 16:51:30,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 62 transitions, 251 flow [2023-08-26 16:51:30,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 62 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:30,224 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 142 flow [2023-08-26 16:51:30,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-26 16:51:30,224 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -17 predicate places. [2023-08-26 16:51:30,224 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 142 flow [2023-08-26 16:51:30,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 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 16:51:30,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:30,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:30,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 16:51:30,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:30,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:30,225 INFO L85 PathProgramCache]: Analyzing trace with hash 535656061, now seen corresponding path program 1 times [2023-08-26 16:51:30,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:30,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432667143] [2023-08-26 16:51:30,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:30,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:51:30,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:30,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432667143] [2023-08-26 16:51:30,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432667143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:30,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:30,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:30,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58366927] [2023-08-26 16:51:30,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:30,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:30,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 16:51:30,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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 16:51:30,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:30,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 16:51:30,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:35,455 INFO L124 PetriNetUnfolderBase]: 98019/128160 cut-off events. [2023-08-26 16:51:35,455 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:35,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251996 conditions, 128160 events. 98019/128160 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5104. Compared 813517 event pairs, 98019 based on Foata normal form. 0/116203 useless extension candidates. Maximal degree in co-relation 251992. Up to 122462 conditions per place. [2023-08-26 16:51:35,985 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 52 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2023-08-26 16:51:35,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 60 transitions, 244 flow [2023-08-26 16:51:35,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-26 16:51:35,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43132108486439197 [2023-08-26 16:51:35,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-26 16:51:35,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-26 16:51:35,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:35,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-26 16:51:35,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 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 16:51:35,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:35,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:35,991 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 142 flow. Second operand 3 states and 493 transitions. [2023-08-26 16:51:35,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 60 transitions, 244 flow [2023-08-26 16:51:35,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 60 transitions, 243 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:35,992 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 139 flow [2023-08-26 16:51:35,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-26 16:51:35,992 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-08-26 16:51:35,992 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 139 flow [2023-08-26 16:51:35,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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 16:51:35,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:35,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:35,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 16:51:35,993 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:35,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:35,993 INFO L85 PathProgramCache]: Analyzing trace with hash -630581640, now seen corresponding path program 1 times [2023-08-26 16:51:35,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:35,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419277737] [2023-08-26 16:51:35,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:35,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:36,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:51:36,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:36,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419277737] [2023-08-26 16:51:36,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419277737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:36,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:36,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:36,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534572123] [2023-08-26 16:51:36,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:36,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:36,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:36,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:36,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:36,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 16:51:36,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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 16:51:36,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:36,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 16:51:36,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:41,197 INFO L124 PetriNetUnfolderBase]: 97227/127032 cut-off events. [2023-08-26 16:51:41,197 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:41,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249805 conditions, 127032 events. 97227/127032 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5095. Compared 805732 event pairs, 97227 based on Foata normal form. 0/115363 useless extension candidates. Maximal degree in co-relation 249801. Up to 121398 conditions per place. [2023-08-26 16:51:41,757 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 50 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2023-08-26 16:51:41,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 58 transitions, 237 flow [2023-08-26 16:51:41,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:41,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-26 16:51:41,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4138232720909886 [2023-08-26 16:51:41,758 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-26 16:51:41,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-26 16:51:41,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:41,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-26 16:51:41,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 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 16:51:41,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:41,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:41,762 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 139 flow. Second operand 3 states and 473 transitions. [2023-08-26 16:51:41,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 58 transitions, 237 flow [2023-08-26 16:51:41,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 58 transitions, 236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:41,763 INFO L231 Difference]: Finished difference. Result has 74 places, 58 transitions, 136 flow [2023-08-26 16:51:41,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=74, PETRI_TRANSITIONS=58} [2023-08-26 16:51:41,766 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -19 predicate places. [2023-08-26 16:51:41,766 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 58 transitions, 136 flow [2023-08-26 16:51:41,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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 16:51:41,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:41,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:41,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 16:51:41,766 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:41,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:41,767 INFO L85 PathProgramCache]: Analyzing trace with hash -630581639, now seen corresponding path program 1 times [2023-08-26 16:51:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116505236] [2023-08-26 16:51:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:41,830 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 16:51:41,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:41,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116505236] [2023-08-26 16:51:41,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116505236] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:41,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:41,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:41,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358741324] [2023-08-26 16:51:41,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:41,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:41,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:41,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 16:51:41,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 58 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 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 16:51:41,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:41,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 16:51:41,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:46,946 INFO L124 PetriNetUnfolderBase]: 96435/125904 cut-off events. [2023-08-26 16:51:46,946 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:47,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247614 conditions, 125904 events. 96435/125904 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 5086. Compared 796846 event pairs, 96435 based on Foata normal form. 0/114523 useless extension candidates. Maximal degree in co-relation 247610. Up to 120334 conditions per place. [2023-08-26 16:51:47,516 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 48 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2023-08-26 16:51:47,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 56 transitions, 230 flow [2023-08-26 16:51:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2023-08-26 16:51:47,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42782152230971127 [2023-08-26 16:51:47,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 489 transitions. [2023-08-26 16:51:47,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 489 transitions. [2023-08-26 16:51:47,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:47,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 489 transitions. [2023-08-26 16:51:47,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 0 states have call successors, (0), 0 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 16:51:47,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:47,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:47,520 INFO L175 Difference]: Start difference. First operand has 74 places, 58 transitions, 136 flow. Second operand 3 states and 489 transitions. [2023-08-26 16:51:47,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 56 transitions, 230 flow [2023-08-26 16:51:47,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 56 transitions, 229 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:47,522 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 133 flow [2023-08-26 16:51:47,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-26 16:51:47,522 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -20 predicate places. [2023-08-26 16:51:47,522 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 133 flow [2023-08-26 16:51:47,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 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 16:51:47,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:47,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:47,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 16:51:47,523 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:47,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -398547804, now seen corresponding path program 1 times [2023-08-26 16:51:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71231255] [2023-08-26 16:51:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:47,577 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 16:51:47,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:47,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71231255] [2023-08-26 16:51:47,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71231255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:47,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:47,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:47,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927348311] [2023-08-26 16:51:47,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:47,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:47,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:47,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:47,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:47,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 381 [2023-08-26 16:51:47,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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 16:51:47,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:47,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 381 [2023-08-26 16:51:47,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:52,688 INFO L124 PetriNetUnfolderBase]: 92592/120777 cut-off events. [2023-08-26 16:51:52,688 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:52,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237617 conditions, 120777 events. 92592/120777 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 4899. Compared 759595 event pairs, 92592 based on Foata normal form. 0/110424 useless extension candidates. Maximal degree in co-relation 237613. Up to 115463 conditions per place. [2023-08-26 16:51:53,417 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 46 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2023-08-26 16:51:53,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 54 transitions, 223 flow [2023-08-26 16:51:53,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2023-08-26 16:51:53,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42607174103237094 [2023-08-26 16:51:53,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2023-08-26 16:51:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2023-08-26 16:51:53,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:53,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2023-08-26 16:51:53,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:51:53,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:53,421 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:53,421 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 133 flow. Second operand 3 states and 487 transitions. [2023-08-26 16:51:53,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 54 transitions, 223 flow [2023-08-26 16:51:53,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 54 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:53,422 INFO L231 Difference]: Finished difference. Result has 72 places, 54 transitions, 130 flow [2023-08-26 16:51:53,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=72, PETRI_TRANSITIONS=54} [2023-08-26 16:51:53,422 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -21 predicate places. [2023-08-26 16:51:53,422 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 54 transitions, 130 flow [2023-08-26 16:51:53,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 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 16:51:53,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:53,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:53,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 16:51:53,423 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:53,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -398547803, now seen corresponding path program 1 times [2023-08-26 16:51:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:53,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028672828] [2023-08-26 16:51:53,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:53,464 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 16:51:53,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:53,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028672828] [2023-08-26 16:51:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028672828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:53,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:51:53,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765222537] [2023-08-26 16:51:53,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:53,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:51:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:53,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:51:53,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:51:53,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 381 [2023-08-26 16:51:53,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 54 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 16:51:53,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:53,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 381 [2023-08-26 16:51:53,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:51:58,132 INFO L124 PetriNetUnfolderBase]: 88749/115650 cut-off events. [2023-08-26 16:51:58,133 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:51:58,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227620 conditions, 115650 events. 88749/115650 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 4735. Compared 722087 event pairs, 88749 based on Foata normal form. 0/106325 useless extension candidates. Maximal degree in co-relation 227616. Up to 110592 conditions per place. [2023-08-26 16:51:58,673 INFO L140 encePairwiseOnDemand]: 378/381 looper letters, 44 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2023-08-26 16:51:58,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 52 transitions, 216 flow [2023-08-26 16:51:58,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:51:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:51:58,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-26 16:51:58,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40857392825896766 [2023-08-26 16:51:58,675 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-26 16:51:58,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-26 16:51:58,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:51:58,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-26 16:51:58,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 16:51:58,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:58,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:51:58,677 INFO L175 Difference]: Start difference. First operand has 72 places, 54 transitions, 130 flow. Second operand 3 states and 467 transitions. [2023-08-26 16:51:58,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 52 transitions, 216 flow [2023-08-26 16:51:58,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 52 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:51:58,679 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 127 flow [2023-08-26 16:51:58,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2023-08-26 16:51:58,679 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 16:51:58,679 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 127 flow [2023-08-26 16:51:58,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 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 16:51:58,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:51:58,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:51:58,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 16:51:58,680 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:51:58,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:51:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -752328124, now seen corresponding path program 1 times [2023-08-26 16:51:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:51:58,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131004023] [2023-08-26 16:51:58,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:51:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:51:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:51:58,931 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 16:51:58,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:51:58,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131004023] [2023-08-26 16:51:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131004023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:51:58,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:51:58,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 16:51:58,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215181237] [2023-08-26 16:51:58,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:51:58,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:51:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:51:58,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:51:58,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:51:58,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 381 [2023-08-26 16:51:58,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 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 16:51:58,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:51:58,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 381 [2023-08-26 16:51:58,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:52:02,926 INFO L124 PetriNetUnfolderBase]: 70317/92098 cut-off events. [2023-08-26 16:52:02,926 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:52:03,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181541 conditions, 92098 events. 70317/92098 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 3664. Compared 566417 event pairs, 70317 based on Foata normal form. 0/87125 useless extension candidates. Maximal degree in co-relation 181537. Up to 88064 conditions per place. [2023-08-26 16:52:03,327 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 43 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2023-08-26 16:52:03,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 51 transitions, 213 flow [2023-08-26 16:52:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:52:03,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:52:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 16:52:03,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3805774278215223 [2023-08-26 16:52:03,329 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 16:52:03,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 16:52:03,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:52:03,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 16:52:03,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 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 16:52:03,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:52:03,331 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:52:03,331 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 127 flow. Second operand 3 states and 435 transitions. [2023-08-26 16:52:03,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 51 transitions, 213 flow [2023-08-26 16:52:03,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 51 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:52:03,333 INFO L231 Difference]: Finished difference. Result has 71 places, 51 transitions, 126 flow [2023-08-26 16:52:03,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=71, PETRI_TRANSITIONS=51} [2023-08-26 16:52:03,333 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 16:52:03,333 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 126 flow [2023-08-26 16:52:03,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 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 16:52:03,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:52:03,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:52:03,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 16:52:03,334 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:52:03,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:52:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash -752328125, now seen corresponding path program 1 times [2023-08-26 16:52:03,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:52:03,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365250810] [2023-08-26 16:52:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:52:03,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:52:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:52:03,463 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 16:52:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:52:03,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365250810] [2023-08-26 16:52:03,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365250810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:52:03,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:52:03,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 16:52:03,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057266236] [2023-08-26 16:52:03,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:52:03,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 16:52:03,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:52:03,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 16:52:03,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-08-26 16:52:03,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 381 [2023-08-26 16:52:03,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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 16:52:03,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:52:03,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 381 [2023-08-26 16:52:03,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:52:06,385 INFO L124 PetriNetUnfolderBase]: 51885/68546 cut-off events. [2023-08-26 16:52:06,386 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-08-26 16:52:06,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135462 conditions, 68546 events. 51885/68546 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 2614. Compared 415083 event pairs, 51885 based on Foata normal form. 0/67925 useless extension candidates. Maximal degree in co-relation 135458. Up to 65536 conditions per place. [2023-08-26 16:52:06,687 INFO L140 encePairwiseOnDemand]: 379/381 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2023-08-26 16:52:06,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 50 transitions, 210 flow [2023-08-26 16:52:06,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:52:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:52:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 16:52:06,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3665791776027997 [2023-08-26 16:52:06,688 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 16:52:06,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 16:52:06,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:52:06,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 16:52:06,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:52:06,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:52:06,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 381.0) internal successors, (1524), 4 states have internal predecessors, (1524), 0 states have call successors, (0), 0 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 16:52:06,691 INFO L175 Difference]: Start difference. First operand has 71 places, 51 transitions, 126 flow. Second operand 3 states and 419 transitions. [2023-08-26 16:52:06,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 50 transitions, 210 flow [2023-08-26 16:52:06,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 50 transitions, 209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:52:06,692 INFO L231 Difference]: Finished difference. Result has 71 places, 50 transitions, 125 flow [2023-08-26 16:52:06,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=71, PETRI_TRANSITIONS=50} [2023-08-26 16:52:06,692 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -22 predicate places. [2023-08-26 16:52:06,692 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 50 transitions, 125 flow [2023-08-26 16:52:06,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 126.625) internal successors, (1013), 8 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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 16:52:06,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:52:06,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:52:06,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 16:52:06,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:52:06,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:52:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1435640807, now seen corresponding path program 1 times [2023-08-26 16:52:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:52:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057553472] [2023-08-26 16:52:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:52:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:52:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:52:07,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:52:07,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:52:07,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057553472] [2023-08-26 16:52:07,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057553472] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:52:07,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:52:07,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:52:07,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607474516] [2023-08-26 16:52:07,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:52:07,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 16:52:07,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:52:07,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 16:52:07,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 16:52:07,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 381 [2023-08-26 16:52:07,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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 16:52:07,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:52:07,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 381 [2023-08-26 16:52:07,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:52:28,881 INFO L124 PetriNetUnfolderBase]: 421515/526270 cut-off events. [2023-08-26 16:52:28,881 INFO L125 PetriNetUnfolderBase]: For 6447/6447 co-relation queries the response was YES. [2023-08-26 16:52:30,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060543 conditions, 526270 events. 421515/526270 cut-off events. For 6447/6447 co-relation queries the response was YES. Maximal size of possible extension queue 9974. Compared 3009141 event pairs, 134644 based on Foata normal form. 2/526272 useless extension candidates. Maximal degree in co-relation 1060539. Up to 234423 conditions per place. [2023-08-26 16:52:30,807 INFO L140 encePairwiseOnDemand]: 372/381 looper letters, 124 selfloop transitions, 13 changer transitions 30/167 dead transitions. [2023-08-26 16:52:30,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 167 transitions, 718 flow [2023-08-26 16:52:30,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:52:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:52:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1019 transitions. [2023-08-26 16:52:30,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5349081364829397 [2023-08-26 16:52:30,809 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1019 transitions. [2023-08-26 16:52:30,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1019 transitions. [2023-08-26 16:52:30,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:52:30,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1019 transitions. [2023-08-26 16:52:30,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 203.8) internal successors, (1019), 5 states have internal predecessors, (1019), 0 states have call successors, (0), 0 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 16:52:30,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 0 states have call successors, (0), 0 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 16:52:30,812 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 381.0) internal successors, (2286), 6 states have internal predecessors, (2286), 0 states have call successors, (0), 0 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 16:52:30,813 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 125 flow. Second operand 5 states and 1019 transitions. [2023-08-26 16:52:30,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 167 transitions, 718 flow [2023-08-26 16:52:30,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 167 transitions, 717 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:52:30,815 INFO L231 Difference]: Finished difference. Result has 77 places, 61 transitions, 218 flow [2023-08-26 16:52:30,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2023-08-26 16:52:30,815 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -16 predicate places. [2023-08-26 16:52:30,815 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 218 flow [2023-08-26 16:52:30,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 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 16:52:30,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:52:30,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:52:30,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 16:52:30,816 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:52:30,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:52:30,816 INFO L85 PathProgramCache]: Analyzing trace with hash 420462633, now seen corresponding path program 2 times [2023-08-26 16:52:30,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:52:30,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143040183] [2023-08-26 16:52:30,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:52:30,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:52:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:52:31,046 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 16:52:31,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:52:31,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143040183] [2023-08-26 16:52:31,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143040183] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:52:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:52:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 16:52:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216703116] [2023-08-26 16:52:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:52:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 16:52:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:52:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 16:52:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 16:52:31,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 16:52:31,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 218 flow. Second operand has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 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 16:52:31,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:52:31,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 16:52:31,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:52:49,498 INFO L124 PetriNetUnfolderBase]: 223021/310037 cut-off events. [2023-08-26 16:52:49,498 INFO L125 PetriNetUnfolderBase]: For 49744/88028 co-relation queries the response was YES. [2023-08-26 16:52:50,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694014 conditions, 310037 events. 223021/310037 cut-off events. For 49744/88028 co-relation queries the response was YES. Maximal size of possible extension queue 13329. Compared 2504869 event pairs, 44782 based on Foata normal form. 326/283934 useless extension candidates. Maximal degree in co-relation 694007. Up to 73527 conditions per place. [2023-08-26 16:52:51,727 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 225 selfloop transitions, 117 changer transitions 0/360 dead transitions. [2023-08-26 16:52:51,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 360 transitions, 1548 flow [2023-08-26 16:52:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 16:52:51,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 16:52:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2954 transitions. [2023-08-26 16:52:51,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168853893263342 [2023-08-26 16:52:51,731 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2954 transitions. [2023-08-26 16:52:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2954 transitions. [2023-08-26 16:52:51,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:52:51,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2954 transitions. [2023-08-26 16:52:51,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 196.93333333333334) internal successors, (2954), 15 states have internal predecessors, (2954), 0 states have call successors, (0), 0 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 16:52:51,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 381.0) internal successors, (6096), 16 states have internal predecessors, (6096), 0 states have call successors, (0), 0 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 16:52:51,741 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 381.0) internal successors, (6096), 16 states have internal predecessors, (6096), 0 states have call successors, (0), 0 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 16:52:51,741 INFO L175 Difference]: Start difference. First operand has 77 places, 61 transitions, 218 flow. Second operand 15 states and 2954 transitions. [2023-08-26 16:52:51,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 360 transitions, 1548 flow [2023-08-26 16:52:51,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 360 transitions, 1532 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 16:52:51,769 INFO L231 Difference]: Finished difference. Result has 91 places, 186 transitions, 744 flow [2023-08-26 16:52:51,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=744, PETRI_PLACES=91, PETRI_TRANSITIONS=186} [2023-08-26 16:52:51,769 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -2 predicate places. [2023-08-26 16:52:51,769 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 186 transitions, 744 flow [2023-08-26 16:52:51,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 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 16:52:51,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:52:51,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:52:51,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 16:52:51,770 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:52:51,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:52:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash 305099423, now seen corresponding path program 3 times [2023-08-26 16:52:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:52:51,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311726856] [2023-08-26 16:52:51,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:52:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:52:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:52:52,092 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 16:52:52,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:52:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311726856] [2023-08-26 16:52:52,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311726856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:52:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:52:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 16:52:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013134668] [2023-08-26 16:52:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:52:52,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 16:52:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:52:52,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 16:52:52,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-26 16:52:52,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 16:52:52,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 186 transitions, 744 flow. Second operand has 7 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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 16:52:52,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:52:52,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 16:52:52,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:53:09,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][249], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 306#true, Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue]) [2023-08-26 16:53:09,968 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 16:53:09,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:53:09,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:53:09,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:53:10,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][249], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 102#L182-1true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 306#true, Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue]) [2023-08-26 16:53:10,222 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 16:53:10,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:53:10,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:53:10,222 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:53:10,866 INFO L124 PetriNetUnfolderBase]: 233473/321767 cut-off events. [2023-08-26 16:53:10,866 INFO L125 PetriNetUnfolderBase]: For 151896/199583 co-relation queries the response was YES. [2023-08-26 16:53:12,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 869036 conditions, 321767 events. 233473/321767 cut-off events. For 151896/199583 co-relation queries the response was YES. Maximal size of possible extension queue 13460. Compared 2523286 event pairs, 59884 based on Foata normal form. 4528/303148 useless extension candidates. Maximal degree in co-relation 869028. Up to 240308 conditions per place. [2023-08-26 16:53:13,335 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 236 selfloop transitions, 119 changer transitions 0/373 dead transitions. [2023-08-26 16:53:13,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 373 transitions, 2081 flow [2023-08-26 16:53:13,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 16:53:13,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 16:53:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1752 transitions. [2023-08-26 16:53:13,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.510936132983377 [2023-08-26 16:53:13,338 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1752 transitions. [2023-08-26 16:53:13,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1752 transitions. [2023-08-26 16:53:13,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:53:13,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1752 transitions. [2023-08-26 16:53:13,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.66666666666666) internal successors, (1752), 9 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 16:53:13,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 381.0) internal successors, (3810), 10 states have internal predecessors, (3810), 0 states have call successors, (0), 0 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 16:53:13,344 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 381.0) internal successors, (3810), 10 states have internal predecessors, (3810), 0 states have call successors, (0), 0 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 16:53:13,344 INFO L175 Difference]: Start difference. First operand has 91 places, 186 transitions, 744 flow. Second operand 9 states and 1752 transitions. [2023-08-26 16:53:13,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 373 transitions, 2081 flow [2023-08-26 16:53:14,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 373 transitions, 2081 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:53:14,160 INFO L231 Difference]: Finished difference. Result has 103 places, 254 transitions, 1432 flow [2023-08-26 16:53:14,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1432, PETRI_PLACES=103, PETRI_TRANSITIONS=254} [2023-08-26 16:53:14,161 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 10 predicate places. [2023-08-26 16:53:14,161 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 254 transitions, 1432 flow [2023-08-26 16:53:14,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 180.14285714285714) internal successors, (1261), 7 states have internal predecessors, (1261), 0 states have call successors, (0), 0 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 16:53:14,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:53:14,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:53:14,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 16:53:14,162 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:53:14,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:53:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -54328669, now seen corresponding path program 4 times [2023-08-26 16:53:14,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:53:14,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179007176] [2023-08-26 16:53:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:53:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:53:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:53:14,411 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 16:53:14,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:53:14,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179007176] [2023-08-26 16:53:14,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179007176] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:53:14,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:53:14,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 16:53:14,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476607442] [2023-08-26 16:53:14,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:53:14,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:53:14,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:53:14,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:53:14,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:53:14,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 16:53:14,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 254 transitions, 1432 flow. Second operand has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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 16:53:14,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:53:14,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 16:53:14,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:53:34,633 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L112-->thread4EXIT: Formula: (and (= (+ v_~s~0_131 1) v_~s~0_130) (= |v_thread4Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread4Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_131} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_7|, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_7|, ~s~0=v_~s~0_130} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_#res#1.offset, ~s~0][224], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 349#true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 174#L74true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 17#L182-2true, 310#(<= (+ ~s~0 1) ~t~0), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)]) [2023-08-26 16:53:34,634 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-26 16:53:34,634 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 16:53:34,634 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 16:53:34,634 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-26 16:53:34,752 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([733] L112-->thread4EXIT: Formula: (and (= (+ v_~s~0_131 1) v_~s~0_130) (= |v_thread4Thread1of1ForFork1_#res#1.base_7| 0) (= |v_thread4Thread1of1ForFork1_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_131} OutVars{thread4Thread1of1ForFork1_#res#1.base=|v_thread4Thread1of1ForFork1_#res#1.base_7|, thread4Thread1of1ForFork1_#t~post8#1=|v_thread4Thread1of1ForFork1_#t~post8#1_5|, thread4Thread1of1ForFork1_#res#1.offset=|v_thread4Thread1of1ForFork1_#res#1.offset_7|, ~s~0=v_~s~0_130} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_#res#1.base, thread4Thread1of1ForFork1_#t~post8#1, thread4Thread1of1ForFork1_#res#1.offset, ~s~0][224], [Black: 325#(and (= ~s~0 ~m1~0) (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 349#true, 84#L150true, Black: 327#(and (<= (+ 5 ~s~0) ~t~0) (<= (+ 5 ~s~0) ~m6~0)), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 8#thread5EXITtrue, 122#thread3EXITtrue, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 310#(<= (+ ~s~0 1) ~t~0), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 184#L183-1true]) [2023-08-26 16:53:34,752 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-26 16:53:34,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 16:53:34,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 16:53:34,752 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-26 16:53:34,935 INFO L124 PetriNetUnfolderBase]: 226775/313768 cut-off events. [2023-08-26 16:53:34,935 INFO L125 PetriNetUnfolderBase]: For 338389/400270 co-relation queries the response was YES. [2023-08-26 16:53:36,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964261 conditions, 313768 events. 226775/313768 cut-off events. For 338389/400270 co-relation queries the response was YES. Maximal size of possible extension queue 12949. Compared 2477996 event pairs, 62659 based on Foata normal form. 6254/297802 useless extension candidates. Maximal degree in co-relation 964248. Up to 232608 conditions per place. [2023-08-26 16:53:37,847 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 239 selfloop transitions, 159 changer transitions 0/416 dead transitions. [2023-08-26 16:53:37,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 416 transitions, 2961 flow [2023-08-26 16:53:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 16:53:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 16:53:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1376 transitions. [2023-08-26 16:53:37,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159355080614924 [2023-08-26 16:53:37,850 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1376 transitions. [2023-08-26 16:53:37,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1376 transitions. [2023-08-26 16:53:37,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:53:37,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1376 transitions. [2023-08-26 16:53:37,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 196.57142857142858) internal successors, (1376), 7 states have internal predecessors, (1376), 0 states have call successors, (0), 0 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 16:53:37,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 381.0) internal successors, (3048), 8 states have internal predecessors, (3048), 0 states have call successors, (0), 0 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 16:53:37,855 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 381.0) internal successors, (3048), 8 states have internal predecessors, (3048), 0 states have call successors, (0), 0 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 16:53:37,855 INFO L175 Difference]: Start difference. First operand has 103 places, 254 transitions, 1432 flow. Second operand 7 states and 1376 transitions. [2023-08-26 16:53:37,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 416 transitions, 2961 flow [2023-08-26 16:53:42,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 416 transitions, 2912 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-26 16:53:42,031 INFO L231 Difference]: Finished difference. Result has 108 places, 306 transitions, 2205 flow [2023-08-26 16:53:42,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2205, PETRI_PLACES=108, PETRI_TRANSITIONS=306} [2023-08-26 16:53:42,032 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 15 predicate places. [2023-08-26 16:53:42,032 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 306 transitions, 2205 flow [2023-08-26 16:53:42,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.16666666666666) internal successors, (1087), 6 states have internal predecessors, (1087), 0 states have call successors, (0), 0 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 16:53:42,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:53:42,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:53:42,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 16:53:42,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:53:42,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:53:42,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1726680565, now seen corresponding path program 5 times [2023-08-26 16:53:42,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:53:42,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446006843] [2023-08-26 16:53:42,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:53:42,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:53:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:53:42,340 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 16:53:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:53:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446006843] [2023-08-26 16:53:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446006843] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:53:42,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:53:42,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 16:53:42,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658833245] [2023-08-26 16:53:42,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:53:42,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 16:53:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:53:42,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 16:53:42,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-26 16:53:42,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 16:53:42,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 306 transitions, 2205 flow. Second operand has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 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 16:53:42,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:53:42,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 16:53:42,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:54:12,419 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 47#L128true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 115#L55true, 85#thread4EXITtrue, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 16:54:12,419 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-26 16:54:12,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 16:54:12,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 16:54:12,419 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-26 16:54:13,828 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [47#L128true, 349#true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 115#L55true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 85#thread4EXITtrue, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 16:54:13,828 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,828 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,828 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,828 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,837 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 84#L150true, 174#L74true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 115#L55true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 16:54:13,837 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,837 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,837 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:13,837 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:54:14,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][304], [349#true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 174#L74true, 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 368#(<= (+ 2 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, 122#thread3EXITtrue, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 115#L55true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 313#(<= (+ ~s~0 4) ~t~0)]) [2023-08-26 16:54:14,918 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 16:54:14,918 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:54:14,918 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:54:14,918 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:54:15,596 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 349#true, 312#(<= (+ 3 ~s~0) ~t~0), 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 135#L124true, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0), 184#L183-1true]) [2023-08-26 16:54:15,596 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,597 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,597 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,597 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 88#L147true, 349#true, 312#(<= (+ 3 ~s~0) ~t~0), 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), 17#L182-2true, Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 140#L131true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 16:54:15,694 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,694 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,694 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:15,694 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-26 16:54:16,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][490], [130#L93true, 88#L147true, 312#(<= (+ 3 ~s~0) ~t~0), 349#true, 331#true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 45#thread2EXITtrue, 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 140#L131true, 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 367#(<= (+ ~s~0 1) ~t~0), 184#L183-1true]) [2023-08-26 16:54:16,054 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-26 16:54:16,055 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 16:54:16,055 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 16:54:16,055 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-26 16:54:16,145 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([731] L74-->thread2EXIT: Formula: (and (= (+ v_~s~0_127 1) v_~s~0_126) (= |v_thread2Thread1of1ForFork0_#res#1.base_7| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_7| 0)) InVars {~s~0=v_~s~0_127} OutVars{thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_7|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_7|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_5|, ~s~0=v_~s~0_126} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_#t~post4#1, ~s~0][543], [130#L93true, 349#true, 47#L128true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 45#thread2EXITtrue, Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 363#true, 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), 311#(<= (+ 2 ~s~0) ~t~0), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 85#thread4EXITtrue, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 184#L183-1true]) [2023-08-26 16:54:16,145 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is not cut-off event [2023-08-26 16:54:16,145 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 16:54:16,146 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 16:54:16,146 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is not cut-off event [2023-08-26 16:54:16,946 INFO L124 PetriNetUnfolderBase]: 337853/471748 cut-off events. [2023-08-26 16:54:16,946 INFO L125 PetriNetUnfolderBase]: For 589570/693846 co-relation queries the response was YES. [2023-08-26 16:54:19,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1511605 conditions, 471748 events. 337853/471748 cut-off events. For 589570/693846 co-relation queries the response was YES. Maximal size of possible extension queue 20392. Compared 3985861 event pairs, 68130 based on Foata normal form. 13984/449308 useless extension candidates. Maximal degree in co-relation 1511590. Up to 113102 conditions per place. [2023-08-26 16:54:21,261 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 260 selfloop transitions, 339 changer transitions 0/617 dead transitions. [2023-08-26 16:54:21,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 617 transitions, 4994 flow [2023-08-26 16:54:21,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 16:54:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 16:54:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2181 transitions. [2023-08-26 16:54:21,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204008589835362 [2023-08-26 16:54:21,265 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2181 transitions. [2023-08-26 16:54:21,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2181 transitions. [2023-08-26 16:54:21,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:54:21,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2181 transitions. [2023-08-26 16:54:21,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 198.27272727272728) internal successors, (2181), 11 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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 16:54:21,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 381.0) internal successors, (4572), 12 states have internal predecessors, (4572), 0 states have call successors, (0), 0 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 16:54:21,271 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 381.0) internal successors, (4572), 12 states have internal predecessors, (4572), 0 states have call successors, (0), 0 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 16:54:21,271 INFO L175 Difference]: Start difference. First operand has 108 places, 306 transitions, 2205 flow. Second operand 11 states and 2181 transitions. [2023-08-26 16:54:21,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 617 transitions, 4994 flow [2023-08-26 16:54:24,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 617 transitions, 4778 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 16:54:24,459 INFO L231 Difference]: Finished difference. Result has 120 places, 460 transitions, 4322 flow [2023-08-26 16:54:24,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=381, PETRI_DIFFERENCE_MINUEND_FLOW=2055, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=208, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4322, PETRI_PLACES=120, PETRI_TRANSITIONS=460} [2023-08-26 16:54:24,460 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 27 predicate places. [2023-08-26 16:54:24,460 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 460 transitions, 4322 flow [2023-08-26 16:54:24,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 179.375) internal successors, (1435), 8 states have internal predecessors, (1435), 0 states have call successors, (0), 0 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 16:54:24,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:54:24,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:54:24,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 16:54:24,460 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-08-26 16:54:24,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:54:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -750154679, now seen corresponding path program 6 times [2023-08-26 16:54:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:54:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035295901] [2023-08-26 16:54:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:54:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:54:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:54:24,810 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 16:54:24,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:54:24,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035295901] [2023-08-26 16:54:24,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035295901] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:54:24,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:54:24,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-08-26 16:54:24,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702697279] [2023-08-26 16:54:24,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:54:24,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 16:54:24,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:54:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 16:54:24,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-08-26 16:54:24,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 381 [2023-08-26 16:54:24,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 460 transitions, 4322 flow. Second operand has 12 states, 12 states have (on average 177.58333333333334) internal successors, (2131), 12 states have internal predecessors, (2131), 0 states have call successors, (0), 0 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 16:54:24,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:54:24,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 381 [2023-08-26 16:54:24,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:55:04,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [130#L93true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 174#L74true, 331#true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 369#(<= (+ 3 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 70#L181-4true, Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue, 384#true, Black: 368#(<= (+ 2 ~s~0) ~t~0), 313#(<= (+ ~s~0 4) ~t~0), Black: 378#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 376#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 16:55:04,476 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-26 16:55:04,476 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:55:04,476 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:55:04,476 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-26 16:55:05,968 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([620] L147-->L150: Formula: (= v_~b~0_9 (ite (= (ite (or (not (= (mod v_~b~0_10 256) 0)) (= v_~x~0_7 1)) 1 0) 0) 0 1)) InVars {~b~0=v_~b~0_10, ~x~0=v_~x~0_7} OutVars{~b~0=v_~b~0_9, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[~b~0][334], [130#L93true, 102#L182-1true, 84#L150true, 273#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t6~0#1.base|)) (= |ULTIMATE.start_main_~#t6~0#1.offset| 0)), 331#true, 174#L74true, 265#(= (select |#valid| |ULTIMATE.start_main_~#t5~0#1.base|) 1), 277#(= (select |#valid| |ULTIMATE.start_main_~#t6~0#1.base|) 1), 236#true, 257#(= (select |#valid| |ULTIMATE.start_main_~#t4~0#1.base|) 1), Black: 336#(and (<= 2 ~t~0) (= ~s~0 0)), Black: 335#(and (<= 1 ~t~0) (= ~s~0 0)), Black: 341#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~m1~0 0) (= ~s~0 0)), 245#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), Black: 343#(and (<= 2 ~m6~0) (<= 2 ~t~0) (= ~s~0 0)), 261#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|)) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)), 369#(<= (+ 3 ~s~0) ~t~0), 8#thread5EXITtrue, 205#L112true, Black: 353#(and (<= 1 ~t~0) (= ~s~0 0)), 286#(and (or (not (= (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|) (select |#length| |ULTIMATE.start_main_~#t4~0#1.base|))) (= |ULTIMATE.start_main_~#t4~0#1.offset| 0)) (<= 4 (select |#length| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_main_~#t1~0#1.offset| 0)), 269#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t5~0#1.base|)) (= |ULTIMATE.start_main_~#t5~0#1.offset| 0)), Black: 356#(and (= ~m1~0 0) (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), Black: 358#(and (< ~s~0 ~m2~0) (<= 1 ~t~0) (= ~s~0 0)), 295#(= (select |#valid| |ULTIMATE.start_main_~#t1~0#1.base|) 1), Black: 299#(= ~b~0 (* (div ~b~0 256) 256)), 253#(and (= (select |#length| |ULTIMATE.start_main_~#t3~0#1.base|) 4) (= |ULTIMATE.start_main_~#t3~0#1.offset| 0)), Black: 300#(and (= ~b~0 (* (div ~b~0 256) 256)) (not (= ~x~0 1))), 241#(and (<= 4 (select |#length| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_main_~#t2~0#1.offset| 0)), 384#true, 249#(= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1), 198#thread1EXITtrue, Black: 368#(<= (+ 2 ~s~0) ~t~0), 313#(<= (+ ~s~0 4) ~t~0), Black: 378#(and (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 376#(and (= ~s~0 ~m1~0) (<= (+ 3 ~s~0) ~t~0) (<= (+ 3 ~s~0) ~m4~0)), Black: 367#(<= (+ ~s~0 1) ~t~0)]) [2023-08-26 16:55:05,968 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-26 16:55:05,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:55:05,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:55:05,968 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-26 16:55:09,050 INFO L124 PetriNetUnfolderBase]: 364493/507098 cut-off events. [2023-08-26 16:55:09,051 INFO L125 PetriNetUnfolderBase]: For 1457034/1600101 co-relation queries the response was YES. [2023-08-26 16:55:11,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942099 conditions, 507098 events. 364493/507098 cut-off events. For 1457034/1600101 co-relation queries the response was YES. Maximal size of possible extension queue 21200. Compared 4238331 event pairs, 98861 based on Foata normal form. 25127/498106 useless extension candidates. Maximal degree in co-relation 1942080. Up to 369432 conditions per place. [2023-08-26 16:55:14,106 INFO L140 encePairwiseOnDemand]: 367/381 looper letters, 405 selfloop transitions, 367 changer transitions 0/790 dead transitions. [2023-08-26 16:55:14,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 790 transitions, 7826 flow [2023-08-26 16:55:14,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-26 16:55:14,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-26 16:55:14,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4424 transitions. [2023-08-26 16:55:14,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048499372361064 [2023-08-26 16:55:14,112 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4424 transitions. [2023-08-26 16:55:14,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4424 transitions. [2023-08-26 16:55:14,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:55:14,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4424 transitions. [2023-08-26 16:55:14,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.34782608695653) internal successors, (4424), 23 states have internal predecessors, (4424), 0 states have call successors, (0), 0 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 16:55:14,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 381.0) internal successors, (9144), 24 states have internal predecessors, (9144), 0 states have call successors, (0), 0 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 16:55:14,124 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 381.0) internal successors, (9144), 24 states have internal predecessors, (9144), 0 states have call successors, (0), 0 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 16:55:14,124 INFO L175 Difference]: Start difference. First operand has 120 places, 460 transitions, 4322 flow. Second operand 23 states and 4424 transitions. [2023-08-26 16:55:14,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 790 transitions, 7826 flow