/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/pthread-wmm/safe016_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:19:08,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:19:09,050 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 15:19:09,055 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:19:09,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:19:09,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:19:09,096 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:19:09,096 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:19:09,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:19:09,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:19:09,097 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:19:09,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:19:09,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:19:09,098 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:19:09,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:19:09,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:19:09,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:19:09,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:19:09,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:19:09,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:19:09,100 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:19:09,105 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:19:09,105 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:19:09,106 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:19:09,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:19:09,109 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:19:09,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:19:09,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:19:09,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:19:09,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:19:09,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:19:09,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:19:09,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:19:09,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:19:09,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:19:09,112 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 15:19:09,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:19:09,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:19:09,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:19:09,468 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:19:09,468 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:19:09,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-08-26 15:19:10,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:19:10,873 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:19:10,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2023-08-26 15:19:10,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a178de0f7/4b908bc0e59d4f99a7d0030bf0a9fb4b/FLAG1a487e30a [2023-08-26 15:19:10,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a178de0f7/4b908bc0e59d4f99a7d0030bf0a9fb4b [2023-08-26 15:19:10,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:19:10,914 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:19:10,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:19:10,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:19:10,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:19:10,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:19:10" (1/1) ... [2023-08-26 15:19:10,918 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da45fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:10, skipping insertion in model container [2023-08-26 15:19:10,918 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:19:10" (1/1) ... [2023-08-26 15:19:10,975 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:19:11,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:19:11,377 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:19:11,408 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:19:11,409 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 15:19:11,463 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:19:11,499 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:19:11,499 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:19:11,505 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:19:11,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11 WrapperNode [2023-08-26 15:19:11,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:19:11,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:19:11,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:19:11,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:19:11,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,569 INFO L138 Inliner]: procedures = 177, calls = 88, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 191 [2023-08-26 15:19:11,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:19:11,570 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:19:11,570 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:19:11,570 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:19:11,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:19:11,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:19:11,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:19:11,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:19:11,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (1/1) ... [2023-08-26 15:19:11,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:19:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:19:11,642 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 15:19:11,651 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 15:19:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 15:19:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:19:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:19:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:19:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:19:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 15:19:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 15:19:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 15:19:11,682 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 15:19:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:19:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:19:11,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:19:11,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:19:11,684 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 15:19:11,814 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:19:11,816 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:19:12,282 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:19:13,028 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:19:13,028 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:19:13,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:19:13 BoogieIcfgContainer [2023-08-26 15:19:13,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:19:13,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:19:13,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:19:13,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:19:13,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:19:10" (1/3) ... [2023-08-26 15:19:13,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465cefe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:19:13, skipping insertion in model container [2023-08-26 15:19:13,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:19:11" (2/3) ... [2023-08-26 15:19:13,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465cefe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:19:13, skipping insertion in model container [2023-08-26 15:19:13,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:19:13" (3/3) ... [2023-08-26 15:19:13,040 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2023-08-26 15:19:13,055 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:19:13,056 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2023-08-26 15:19:13,056 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:19:13,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:19:13,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 200 transitions, 420 flow [2023-08-26 15:19:13,355 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2023-08-26 15:19:13,355 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:13,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 196 events. 3/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 345 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-08-26 15:19:13,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 200 transitions, 420 flow [2023-08-26 15:19:13,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 196 transitions, 404 flow [2023-08-26 15:19:13,375 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:19:13,393 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 196 transitions, 404 flow [2023-08-26 15:19:13,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 196 transitions, 404 flow [2023-08-26 15:19:13,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 196 transitions, 404 flow [2023-08-26 15:19:13,461 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2023-08-26 15:19:13,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:13,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 196 events. 3/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 338 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2023-08-26 15:19:13,471 INFO L119 LiptonReduction]: Number of co-enabled transitions 8996 [2023-08-26 15:19:31,792 INFO L134 LiptonReduction]: Checked pairs total: 41452 [2023-08-26 15:19:31,793 INFO L136 LiptonReduction]: Total number of compositions: 166 [2023-08-26 15:19:31,804 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:19:31,810 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;@66936b99, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:19:31,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2023-08-26 15:19:31,811 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:19:31,811 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 15:19:31,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:31,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:31,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:19:31,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:19:31,816 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:31,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1280, now seen corresponding path program 1 times [2023-08-26 15:19:31,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:31,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567531622] [2023-08-26 15:19:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:31,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:31,936 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 15:19:31,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:31,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567531622] [2023-08-26 15:19:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567531622] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:31,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:31,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:19:31,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527502355] [2023-08-26 15:19:31,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:31,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:19:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:31,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:19:31,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:19:31,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 366 [2023-08-26 15:19:31,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 87 transitions, 186 flow. Second operand has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 15:19:31,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:31,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 366 [2023-08-26 15:19:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:43,929 INFO L124 PetriNetUnfolderBase]: 69461/91513 cut-off events. [2023-08-26 15:19:43,929 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-08-26 15:19:44,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183163 conditions, 91513 events. 69461/91513 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 6628. Compared 604656 event pairs, 69461 based on Foata normal form. 1200/48027 useless extension candidates. Maximal degree in co-relation 183151. Up to 91363 conditions per place. [2023-08-26 15:19:44,496 INFO L140 encePairwiseOnDemand]: 333/366 looper letters, 49 selfloop transitions, 0 changer transitions 0/54 dead transitions. [2023-08-26 15:19:44,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 218 flow [2023-08-26 15:19:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:19:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:19:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 372 transitions. [2023-08-26 15:19:44,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5081967213114754 [2023-08-26 15:19:44,513 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 372 transitions. [2023-08-26 15:19:44,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 372 transitions. [2023-08-26 15:19:44,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:44,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 372 transitions. [2023-08-26 15:19:44,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 186.0) internal successors, (372), 2 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 15:19:44,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states 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 15:19:44,533 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 366.0) internal successors, (1098), 3 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states 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 15:19:44,535 INFO L175 Difference]: Start difference. First operand has 99 places, 87 transitions, 186 flow. Second operand 2 states and 372 transitions. [2023-08-26 15:19:44,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 218 flow [2023-08-26 15:19:44,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 54 transitions, 214 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 15:19:44,551 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 116 flow [2023-08-26 15:19:44,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-26 15:19:44,556 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -35 predicate places. [2023-08-26 15:19:44,556 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 116 flow [2023-08-26 15:19:44,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states 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 15:19:44,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:44,557 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:19:44,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:19:44,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:19:44,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:44,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1266631, now seen corresponding path program 1 times [2023-08-26 15:19:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993793501] [2023-08-26 15:19:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:44,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:44,826 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 15:19:44,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:44,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993793501] [2023-08-26 15:19:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993793501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238034314] [2023-08-26 15:19:44,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:44,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:44,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:44,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:44,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 366 [2023-08-26 15:19:44,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 15:19:44,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:44,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 366 [2023-08-26 15:19:44,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:50,758 INFO L124 PetriNetUnfolderBase]: 31789/42207 cut-off events. [2023-08-26 15:19:50,758 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:50,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84642 conditions, 42207 events. 31789/42207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2019. Compared 237088 event pairs, 31789 based on Foata normal form. 0/26690 useless extension candidates. Maximal degree in co-relation 84639. Up to 42206 conditions per place. [2023-08-26 15:19:51,001 INFO L140 encePairwiseOnDemand]: 355/366 looper letters, 42 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-08-26 15:19:51,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 182 flow [2023-08-26 15:19:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 15:19:51,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38160291438979965 [2023-08-26 15:19:51,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 15:19:51,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 15:19:51,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:51,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 15:19:51,006 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 15:19:51,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:51,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:51,010 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 116 flow. Second operand 3 states and 419 transitions. [2023-08-26 15:19:51,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 182 flow [2023-08-26 15:19:51,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 44 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:19:51,012 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 98 flow [2023-08-26 15:19:51,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-26 15:19:51,013 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -43 predicate places. [2023-08-26 15:19:51,013 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 98 flow [2023-08-26 15:19:51,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states 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 15:19:51,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:51,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:19:51,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:19:51,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:19:51,014 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:51,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1266630, now seen corresponding path program 1 times [2023-08-26 15:19:51,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:51,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877638810] [2023-08-26 15:19:51,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:51,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:51,085 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 15:19:51,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:51,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877638810] [2023-08-26 15:19:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877638810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:51,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126499412] [2023-08-26 15:19:51,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:51,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:51,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:51,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 366 [2023-08-26 15:19:51,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:51,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:51,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 366 [2023-08-26 15:19:51,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:54,191 INFO L124 PetriNetUnfolderBase]: 16483/23232 cut-off events. [2023-08-26 15:19:54,191 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:19:54,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46344 conditions, 23232 events. 16483/23232 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 140380 event pairs, 9651 based on Foata normal form. 0/19679 useless extension candidates. Maximal degree in co-relation 46340. Up to 12787 conditions per place. [2023-08-26 15:19:54,273 INFO L140 encePairwiseOnDemand]: 346/366 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2023-08-26 15:19:54,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 55 transitions, 228 flow [2023-08-26 15:19:54,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 15:19:54,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.377959927140255 [2023-08-26 15:19:54,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 15:19:54,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 15:19:54,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:54,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 15:19:54,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states 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 15:19:54,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:54,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:54,281 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 98 flow. Second operand 3 states and 415 transitions. [2023-08-26 15:19:54,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 55 transitions, 228 flow [2023-08-26 15:19:54,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 55 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:19:54,284 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 175 flow [2023-08-26 15:19:54,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-26 15:19:54,285 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -43 predicate places. [2023-08-26 15:19:54,285 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 175 flow [2023-08-26 15:19:54,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:54,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:54,286 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:19:54,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:19:54,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:19:54,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1213645120, now seen corresponding path program 1 times [2023-08-26 15:19:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671891471] [2023-08-26 15:19:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:54,594 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 15:19:54,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:54,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671891471] [2023-08-26 15:19:54,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671891471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:54,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:54,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:54,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275553941] [2023-08-26 15:19:54,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:54,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:54,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:54,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:54,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:54,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 366 [2023-08-26 15:19:54,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 175 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 15:19:54,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:54,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 366 [2023-08-26 15:19:54,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:19:57,420 INFO L124 PetriNetUnfolderBase]: 14944/21395 cut-off events. [2023-08-26 15:19:57,420 INFO L125 PetriNetUnfolderBase]: For 6407/6557 co-relation queries the response was YES. [2023-08-26 15:19:57,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57563 conditions, 21395 events. 14944/21395 cut-off events. For 6407/6557 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 133514 event pairs, 7262 based on Foata normal form. 0/20066 useless extension candidates. Maximal degree in co-relation 57558. Up to 12732 conditions per place. [2023-08-26 15:19:57,513 INFO L140 encePairwiseOnDemand]: 362/366 looper letters, 75 selfloop transitions, 3 changer transitions 0/83 dead transitions. [2023-08-26 15:19:57,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 457 flow [2023-08-26 15:19:57,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:19:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:19:57,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions. [2023-08-26 15:19:57,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544626593806922 [2023-08-26 15:19:57,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 499 transitions. [2023-08-26 15:19:57,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions. [2023-08-26 15:19:57,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:19:57,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions. [2023-08-26 15:19:57,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:19:57,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:57,520 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:19:57,520 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 175 flow. Second operand 3 states and 499 transitions. [2023-08-26 15:19:57,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 457 flow [2023-08-26 15:19:57,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:19:57,562 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 168 flow [2023-08-26 15:19:57,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-26 15:19:57,563 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -43 predicate places. [2023-08-26 15:19:57,564 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 168 flow [2023-08-26 15:19:57,564 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 15:19:57,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:19:57,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:19:57,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:19:57,565 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:19:57,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:19:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1213644770, now seen corresponding path program 1 times [2023-08-26 15:19:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:19:57,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415263525] [2023-08-26 15:19:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:19:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:19:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:19:57,707 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 15:19:57,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:19:57,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415263525] [2023-08-26 15:19:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415263525] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:19:57,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:19:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:19:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112907757] [2023-08-26 15:19:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:19:57,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:19:57,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:19:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:19:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:19:57,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 366 [2023-08-26 15:19:57,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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 15:19:57,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:19:57,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 366 [2023-08-26 15:19:57,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:00,562 INFO L124 PetriNetUnfolderBase]: 19723/27637 cut-off events. [2023-08-26 15:20:00,562 INFO L125 PetriNetUnfolderBase]: For 5689/5894 co-relation queries the response was YES. [2023-08-26 15:20:00,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72092 conditions, 27637 events. 19723/27637 cut-off events. For 5689/5894 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 163474 event pairs, 11206 based on Foata normal form. 0/24319 useless extension candidates. Maximal degree in co-relation 72086. Up to 22979 conditions per place. [2023-08-26 15:20:00,668 INFO L140 encePairwiseOnDemand]: 362/366 looper letters, 80 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-26 15:20:00,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 87 transitions, 470 flow [2023-08-26 15:20:00,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:20:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:20:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-08-26 15:20:00,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44899817850637525 [2023-08-26 15:20:00,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-08-26 15:20:00,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-08-26 15:20:00,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:00,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-08-26 15:20:00,672 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 15:20:00,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:00,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:00,674 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 168 flow. Second operand 3 states and 493 transitions. [2023-08-26 15:20:00,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 87 transitions, 470 flow [2023-08-26 15:20:00,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:00,677 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 181 flow [2023-08-26 15:20:00,677 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-26 15:20:00,678 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -42 predicate places. [2023-08-26 15:20:00,678 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 181 flow [2023-08-26 15:20:00,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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 15:20:00,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:00,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:00,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:20:00,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:00,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2078936695, now seen corresponding path program 1 times [2023-08-26 15:20:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:00,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950793146] [2023-08-26 15:20:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:00,983 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 15:20:00,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:00,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950793146] [2023-08-26 15:20:00,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950793146] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:00,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:00,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:20:00,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577550819] [2023-08-26 15:20:00,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:00,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:20:00,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:00,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:20:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:20:00,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 366 [2023-08-26 15:20:00,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 15:20:00,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:00,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 366 [2023-08-26 15:20:00,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:03,636 INFO L124 PetriNetUnfolderBase]: 18381/25946 cut-off events. [2023-08-26 15:20:03,636 INFO L125 PetriNetUnfolderBase]: For 5835/5835 co-relation queries the response was YES. [2023-08-26 15:20:03,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71663 conditions, 25946 events. 18381/25946 cut-off events. For 5835/5835 co-relation queries the response was YES. Maximal size of possible extension queue 1260. Compared 157876 event pairs, 8035 based on Foata normal form. 0/22754 useless extension candidates. Maximal degree in co-relation 71656. Up to 16848 conditions per place. [2023-08-26 15:20:03,733 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 83 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2023-08-26 15:20:03,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 88 transitions, 480 flow [2023-08-26 15:20:03,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:20:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:20:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-26 15:20:03,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36270491803278687 [2023-08-26 15:20:03,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-26 15:20:03,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-26 15:20:03,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:03,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-26 15:20:03,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states 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 15:20:03,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:20:03,741 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:20:03,741 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 181 flow. Second operand 4 states and 531 transitions. [2023-08-26 15:20:03,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 88 transitions, 480 flow [2023-08-26 15:20:03,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:20:03,749 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 180 flow [2023-08-26 15:20:03,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-08-26 15:20:03,750 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -41 predicate places. [2023-08-26 15:20:03,750 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 180 flow [2023-08-26 15:20:03,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states 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 15:20:03,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:03,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:03,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:20:03,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:03,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:03,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1031715458, now seen corresponding path program 1 times [2023-08-26 15:20:03,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:03,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373950489] [2023-08-26 15:20:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:04,390 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 15:20:04,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:04,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373950489] [2023-08-26 15:20:04,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373950489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:04,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:04,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:20:04,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929699492] [2023-08-26 15:20:04,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:04,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:20:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:20:04,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:20:04,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 366 [2023-08-26 15:20:04,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 15:20:04,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:04,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 366 [2023-08-26 15:20:04,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:07,923 INFO L124 PetriNetUnfolderBase]: 27729/39156 cut-off events. [2023-08-26 15:20:07,923 INFO L125 PetriNetUnfolderBase]: For 9791/9791 co-relation queries the response was YES. [2023-08-26 15:20:08,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106038 conditions, 39156 events. 27729/39156 cut-off events. For 9791/9791 co-relation queries the response was YES. Maximal size of possible extension queue 1993. Compared 250919 event pairs, 9652 based on Foata normal form. 160/35356 useless extension candidates. Maximal degree in co-relation 106031. Up to 21659 conditions per place. [2023-08-26 15:20:08,217 INFO L140 encePairwiseOnDemand]: 356/366 looper letters, 90 selfloop transitions, 13 changer transitions 0/105 dead transitions. [2023-08-26 15:20:08,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 105 transitions, 569 flow [2023-08-26 15:20:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:20:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:20:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2023-08-26 15:20:08,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3721311475409836 [2023-08-26 15:20:08,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2023-08-26 15:20:08,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2023-08-26 15:20:08,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:08,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2023-08-26 15:20:08,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 15:20:08,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:08,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:08,224 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 180 flow. Second operand 5 states and 681 transitions. [2023-08-26 15:20:08,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 105 transitions, 569 flow [2023-08-26 15:20:08,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:08,231 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 260 flow [2023-08-26 15:20:08,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=260, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2023-08-26 15:20:08,232 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -37 predicate places. [2023-08-26 15:20:08,232 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 260 flow [2023-08-26 15:20:08,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states 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 15:20:08,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:08,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:08,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:20:08,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:08,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:08,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1629897428, now seen corresponding path program 2 times [2023-08-26 15:20:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620286171] [2023-08-26 15:20:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:08,615 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 15:20:08,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620286171] [2023-08-26 15:20:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620286171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:08,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:08,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:20:08,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507741975] [2023-08-26 15:20:08,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:08,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:20:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:08,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:20:08,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:20:08,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 366 [2023-08-26 15:20:08,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 15:20:08,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:08,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 366 [2023-08-26 15:20:08,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:12,805 INFO L124 PetriNetUnfolderBase]: 27300/38567 cut-off events. [2023-08-26 15:20:12,805 INFO L125 PetriNetUnfolderBase]: For 17458/17458 co-relation queries the response was YES. [2023-08-26 15:20:12,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109774 conditions, 38567 events. 27300/38567 cut-off events. For 17458/17458 co-relation queries the response was YES. Maximal size of possible extension queue 1973. Compared 246665 event pairs, 12320 based on Foata normal form. 160/34767 useless extension candidates. Maximal degree in co-relation 109765. Up to 29275 conditions per place. [2023-08-26 15:20:13,017 INFO L140 encePairwiseOnDemand]: 356/366 looper letters, 99 selfloop transitions, 12 changer transitions 0/113 dead transitions. [2023-08-26 15:20:13,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 113 transitions, 683 flow [2023-08-26 15:20:13,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:20:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:20:13,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-08-26 15:20:13,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37595628415300547 [2023-08-26 15:20:13,020 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-08-26 15:20:13,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-08-26 15:20:13,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:13,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-08-26 15:20:13,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:20:13,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:13,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:13,024 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 260 flow. Second operand 5 states and 688 transitions. [2023-08-26 15:20:13,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 113 transitions, 683 flow [2023-08-26 15:20:13,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 113 transitions, 664 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:13,036 INFO L231 Difference]: Finished difference. Result has 65 places, 62 transitions, 319 flow [2023-08-26 15:20:13,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=65, PETRI_TRANSITIONS=62} [2023-08-26 15:20:13,036 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -34 predicate places. [2023-08-26 15:20:13,036 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 62 transitions, 319 flow [2023-08-26 15:20:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states 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 15:20:13,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:13,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:13,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:20:13,037 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:13,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1894403917, now seen corresponding path program 1 times [2023-08-26 15:20:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305450004] [2023-08-26 15:20:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:13,862 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 15:20:13,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:13,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305450004] [2023-08-26 15:20:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305450004] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:13,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:13,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 15:20:13,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751524983] [2023-08-26 15:20:13,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:13,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 15:20:13,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:13,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 15:20:13,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-08-26 15:20:13,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 366 [2023-08-26 15:20:13,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 62 transitions, 319 flow. Second operand has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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 15:20:13,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:13,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 366 [2023-08-26 15:20:13,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:18,309 INFO L124 PetriNetUnfolderBase]: 27035/38191 cut-off events. [2023-08-26 15:20:18,309 INFO L125 PetriNetUnfolderBase]: For 27468/27468 co-relation queries the response was YES. [2023-08-26 15:20:18,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109183 conditions, 38191 events. 27035/38191 cut-off events. For 27468/27468 co-relation queries the response was YES. Maximal size of possible extension queue 1942. Compared 244473 event pairs, 7000 based on Foata normal form. 36/34267 useless extension candidates. Maximal degree in co-relation 109173. Up to 34880 conditions per place. [2023-08-26 15:20:18,599 INFO L140 encePairwiseOnDemand]: 357/366 looper letters, 101 selfloop transitions, 27 changer transitions 0/130 dead transitions. [2023-08-26 15:20:18,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 130 transitions, 901 flow [2023-08-26 15:20:18,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 15:20:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 15:20:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 919 transitions. [2023-08-26 15:20:18,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31386612021857924 [2023-08-26 15:20:18,602 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 919 transitions. [2023-08-26 15:20:18,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 919 transitions. [2023-08-26 15:20:18,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:18,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 919 transitions. [2023-08-26 15:20:18,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.875) internal successors, (919), 8 states have internal predecessors, (919), 0 states have call successors, (0), 0 states 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 15:20:18,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 366.0) internal successors, (3294), 9 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 15:20:18,608 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 366.0) internal successors, (3294), 9 states have internal predecessors, (3294), 0 states have call successors, (0), 0 states 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 15:20:18,608 INFO L175 Difference]: Start difference. First operand has 65 places, 62 transitions, 319 flow. Second operand 8 states and 919 transitions. [2023-08-26 15:20:18,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 130 transitions, 901 flow [2023-08-26 15:20:18,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 130 transitions, 889 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:18,625 INFO L231 Difference]: Finished difference. Result has 73 places, 81 transitions, 525 flow [2023-08-26 15:20:18,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=525, PETRI_PLACES=73, PETRI_TRANSITIONS=81} [2023-08-26 15:20:18,626 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -26 predicate places. [2023-08-26 15:20:18,626 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 81 transitions, 525 flow [2023-08-26 15:20:18,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states 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 15:20:18,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:18,626 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:18,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:20:18,627 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:18,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:18,627 INFO L85 PathProgramCache]: Analyzing trace with hash -360060872, now seen corresponding path program 1 times [2023-08-26 15:20:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:18,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348355380] [2023-08-26 15:20:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:18,788 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 15:20:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:18,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348355380] [2023-08-26 15:20:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348355380] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:20:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496611304] [2023-08-26 15:20:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:18,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:20:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:18,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:20:18,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:20:18,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 366 [2023-08-26 15:20:18,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 81 transitions, 525 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 15:20:18,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:18,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 366 [2023-08-26 15:20:18,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:22,707 INFO L124 PetriNetUnfolderBase]: 25538/36516 cut-off events. [2023-08-26 15:20:22,707 INFO L125 PetriNetUnfolderBase]: For 29600/29921 co-relation queries the response was YES. [2023-08-26 15:20:22,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109551 conditions, 36516 events. 25538/36516 cut-off events. For 29600/29921 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 240155 event pairs, 7980 based on Foata normal form. 176/34040 useless extension candidates. Maximal degree in co-relation 109538. Up to 30512 conditions per place. [2023-08-26 15:20:22,900 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 102 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2023-08-26 15:20:22,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 967 flow [2023-08-26 15:20:22,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:20:22,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:20:22,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions. [2023-08-26 15:20:22,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4408014571948998 [2023-08-26 15:20:22,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 484 transitions. [2023-08-26 15:20:22,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions. [2023-08-26 15:20:22,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:22,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions. [2023-08-26 15:20:22,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states 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 15:20:22,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:22,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:22,905 INFO L175 Difference]: Start difference. First operand has 73 places, 81 transitions, 525 flow. Second operand 3 states and 484 transitions. [2023-08-26 15:20:22,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 967 flow [2023-08-26 15:20:23,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 946 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:23,007 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 516 flow [2023-08-26 15:20:23,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2023-08-26 15:20:23,008 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -25 predicate places. [2023-08-26 15:20:23,008 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 516 flow [2023-08-26 15:20:23,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 15:20:23,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:23,008 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 15:20:23,009 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:23,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1918425859, now seen corresponding path program 1 times [2023-08-26 15:20:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:23,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801654028] [2023-08-26 15:20:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:23,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:23,124 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 15:20:23,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:23,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801654028] [2023-08-26 15:20:23,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801654028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:23,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:23,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:20:23,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682923778] [2023-08-26 15:20:23,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:23,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:20:23,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:23,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:20:23,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:20:23,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 366 [2023-08-26 15:20:23,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states 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 15:20:23,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:23,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 366 [2023-08-26 15:20:23,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:27,158 INFO L124 PetriNetUnfolderBase]: 23131/32774 cut-off events. [2023-08-26 15:20:27,158 INFO L125 PetriNetUnfolderBase]: For 29688/29688 co-relation queries the response was YES. [2023-08-26 15:20:27,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103080 conditions, 32774 events. 23131/32774 cut-off events. For 29688/29688 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 204933 event pairs, 8661 based on Foata normal form. 231/31023 useless extension candidates. Maximal degree in co-relation 103065. Up to 13729 conditions per place. [2023-08-26 15:20:27,357 INFO L140 encePairwiseOnDemand]: 350/366 looper letters, 92 selfloop transitions, 15 changer transitions 0/109 dead transitions. [2023-08-26 15:20:27,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 866 flow [2023-08-26 15:20:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:20:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:20:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-26 15:20:27,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35792349726775957 [2023-08-26 15:20:27,361 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-26 15:20:27,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-26 15:20:27,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:27,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-26 15:20:27,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states 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 15:20:27,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:20:27,364 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:20:27,364 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 516 flow. Second operand 4 states and 524 transitions. [2023-08-26 15:20:27,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 866 flow [2023-08-26 15:20:27,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 109 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:27,468 INFO L231 Difference]: Finished difference. Result has 77 places, 88 transitions, 632 flow [2023-08-26 15:20:27,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=632, PETRI_PLACES=77, PETRI_TRANSITIONS=88} [2023-08-26 15:20:27,469 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -22 predicate places. [2023-08-26 15:20:27,469 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 88 transitions, 632 flow [2023-08-26 15:20:27,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states 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 15:20:27,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:27,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:27,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 15:20:27,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:27,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash 521322523, now seen corresponding path program 1 times [2023-08-26 15:20:27,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:27,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75724387] [2023-08-26 15:20:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:27,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:27,940 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 15:20:27,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:27,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75724387] [2023-08-26 15:20:27,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75724387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:27,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:20:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422700147] [2023-08-26 15:20:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:27,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:20:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:27,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:20:27,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:20:27,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 366 [2023-08-26 15:20:27,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 88 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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 15:20:27,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:27,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 366 [2023-08-26 15:20:27,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:35,463 INFO L124 PetriNetUnfolderBase]: 41867/59333 cut-off events. [2023-08-26 15:20:35,463 INFO L125 PetriNetUnfolderBase]: For 72842/72842 co-relation queries the response was YES. [2023-08-26 15:20:35,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204966 conditions, 59333 events. 41867/59333 cut-off events. For 72842/72842 co-relation queries the response was YES. Maximal size of possible extension queue 3283. Compared 407951 event pairs, 18409 based on Foata normal form. 288/57178 useless extension candidates. Maximal degree in co-relation 204950. Up to 31511 conditions per place. [2023-08-26 15:20:35,875 INFO L140 encePairwiseOnDemand]: 355/366 looper letters, 127 selfloop transitions, 38 changer transitions 0/167 dead transitions. [2023-08-26 15:20:35,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 167 transitions, 1451 flow [2023-08-26 15:20:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:20:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:20:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2023-08-26 15:20:35,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3978142076502732 [2023-08-26 15:20:35,877 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2023-08-26 15:20:35,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2023-08-26 15:20:35,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:35,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2023-08-26 15:20:35,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 15:20:35,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:35,882 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:20:35,882 INFO L175 Difference]: Start difference. First operand has 77 places, 88 transitions, 632 flow. Second operand 5 states and 728 transitions. [2023-08-26 15:20:35,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 167 transitions, 1451 flow [2023-08-26 15:20:36,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 167 transitions, 1444 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 15:20:36,710 INFO L231 Difference]: Finished difference. Result has 82 places, 110 transitions, 953 flow [2023-08-26 15:20:36,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=953, PETRI_PLACES=82, PETRI_TRANSITIONS=110} [2023-08-26 15:20:36,711 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -17 predicate places. [2023-08-26 15:20:36,711 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 110 transitions, 953 flow [2023-08-26 15:20:36,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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 15:20:36,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:36,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:36,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 15:20:36,712 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:36,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -922671255, now seen corresponding path program 1 times [2023-08-26 15:20:36,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:36,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594663195] [2023-08-26 15:20:36,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:36,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:37,165 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 15:20:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:37,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594663195] [2023-08-26 15:20:37,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594663195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:37,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:37,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:20:37,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006098187] [2023-08-26 15:20:37,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:37,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:20:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:37,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:20:37,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:20:37,169 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 366 [2023-08-26 15:20:37,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 110 transitions, 953 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 15:20:37,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:37,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 366 [2023-08-26 15:20:37,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:44,564 INFO L124 PetriNetUnfolderBase]: 40124/57494 cut-off events. [2023-08-26 15:20:44,564 INFO L125 PetriNetUnfolderBase]: For 107845/108821 co-relation queries the response was YES. [2023-08-26 15:20:44,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215697 conditions, 57494 events. 40124/57494 cut-off events. For 107845/108821 co-relation queries the response was YES. Maximal size of possible extension queue 3239. Compared 404980 event pairs, 20058 based on Foata normal form. 306/55319 useless extension candidates. Maximal degree in co-relation 215678. Up to 43670 conditions per place. [2023-08-26 15:20:45,051 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 137 selfloop transitions, 9 changer transitions 0/166 dead transitions. [2023-08-26 15:20:45,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 166 transitions, 1652 flow [2023-08-26 15:20:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:20:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:20:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-26 15:20:45,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4426229508196721 [2023-08-26 15:20:45,053 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-26 15:20:45,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-26 15:20:45,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:45,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-26 15:20:45,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states 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 15:20:45,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:45,056 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:20:45,056 INFO L175 Difference]: Start difference. First operand has 82 places, 110 transitions, 953 flow. Second operand 3 states and 486 transitions. [2023-08-26 15:20:45,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 166 transitions, 1652 flow [2023-08-26 15:20:46,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 1639 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 15:20:46,033 INFO L231 Difference]: Finished difference. Result has 84 places, 110 transitions, 975 flow [2023-08-26 15:20:46,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=84, PETRI_TRANSITIONS=110} [2023-08-26 15:20:46,034 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -15 predicate places. [2023-08-26 15:20:46,034 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 110 transitions, 975 flow [2023-08-26 15:20:46,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 15:20:46,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:46,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:46,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 15:20:46,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:46,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -658340089, now seen corresponding path program 1 times [2023-08-26 15:20:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:46,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453514867] [2023-08-26 15:20:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:46,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:46,236 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 15:20:46,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:46,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453514867] [2023-08-26 15:20:46,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453514867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:46,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:46,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:20:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192873874] [2023-08-26 15:20:46,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:46,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:20:46,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:46,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:20:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:20:46,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 366 [2023-08-26 15:20:46,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 110 transitions, 975 flow. Second operand has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states 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 15:20:46,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:46,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 366 [2023-08-26 15:20:46,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:20:52,676 INFO L124 PetriNetUnfolderBase]: 34291/48849 cut-off events. [2023-08-26 15:20:52,676 INFO L125 PetriNetUnfolderBase]: For 101784/101784 co-relation queries the response was YES. [2023-08-26 15:20:52,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189570 conditions, 48849 events. 34291/48849 cut-off events. For 101784/101784 co-relation queries the response was YES. Maximal size of possible extension queue 2577. Compared 326247 event pairs, 11826 based on Foata normal form. 754/47975 useless extension candidates. Maximal degree in co-relation 189550. Up to 16884 conditions per place. [2023-08-26 15:20:53,049 INFO L140 encePairwiseOnDemand]: 349/366 looper letters, 144 selfloop transitions, 23 changer transitions 0/169 dead transitions. [2023-08-26 15:20:53,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 169 transitions, 1773 flow [2023-08-26 15:20:53,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:20:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:20:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-26 15:20:53,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3424408014571949 [2023-08-26 15:20:53,051 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-26 15:20:53,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-26 15:20:53,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:20:53,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-26 15:20:53,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states 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 15:20:53,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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 15:20:53,056 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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 15:20:53,056 INFO L175 Difference]: Start difference. First operand has 84 places, 110 transitions, 975 flow. Second operand 6 states and 752 transitions. [2023-08-26 15:20:53,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 169 transitions, 1773 flow [2023-08-26 15:20:54,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 169 transitions, 1741 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:20:54,155 INFO L231 Difference]: Finished difference. Result has 89 places, 122 transitions, 1206 flow [2023-08-26 15:20:54,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=957, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1206, PETRI_PLACES=89, PETRI_TRANSITIONS=122} [2023-08-26 15:20:54,156 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -10 predicate places. [2023-08-26 15:20:54,156 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 122 transitions, 1206 flow [2023-08-26 15:20:54,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.42857142857143) internal successors, (801), 7 states have internal predecessors, (801), 0 states have call successors, (0), 0 states 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 15:20:54,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:20:54,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:20:54,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 15:20:54,157 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:20:54,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:20:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 973557629, now seen corresponding path program 1 times [2023-08-26 15:20:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:20:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713114401] [2023-08-26 15:20:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:20:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:20:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:20:54,296 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 15:20:54,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:20:54,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713114401] [2023-08-26 15:20:54,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713114401] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:20:54,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:20:54,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:20:54,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73736793] [2023-08-26 15:20:54,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:20:54,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:20:54,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:20:54,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:20:54,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:20:54,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 366 [2023-08-26 15:20:54,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 122 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 15:20:54,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:20:54,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 366 [2023-08-26 15:20:54,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:02,916 INFO L124 PetriNetUnfolderBase]: 49060/69777 cut-off events. [2023-08-26 15:21:02,917 INFO L125 PetriNetUnfolderBase]: For 218969/222718 co-relation queries the response was YES. [2023-08-26 15:21:03,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284857 conditions, 69777 events. 49060/69777 cut-off events. For 218969/222718 co-relation queries the response was YES. Maximal size of possible extension queue 3174. Compared 496728 event pairs, 18142 based on Foata normal form. 1929/69179 useless extension candidates. Maximal degree in co-relation 284836. Up to 40977 conditions per place. [2023-08-26 15:21:03,494 INFO L140 encePairwiseOnDemand]: 363/366 looper letters, 176 selfloop transitions, 3 changer transitions 0/199 dead transitions. [2023-08-26 15:21:03,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 199 transitions, 2257 flow [2023-08-26 15:21:03,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2023-08-26 15:21:03,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-26 15:21:03,495 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 488 transitions. [2023-08-26 15:21:03,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 488 transitions. [2023-08-26 15:21:03,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:03,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 488 transitions. [2023-08-26 15:21:03,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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 15:21:03,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:21:03,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:21:03,498 INFO L175 Difference]: Start difference. First operand has 89 places, 122 transitions, 1206 flow. Second operand 3 states and 488 transitions. [2023-08-26 15:21:03,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 199 transitions, 2257 flow [2023-08-26 15:21:05,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 199 transitions, 2238 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 15:21:05,126 INFO L231 Difference]: Finished difference. Result has 89 places, 122 transitions, 1206 flow [2023-08-26 15:21:05,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1206, PETRI_PLACES=89, PETRI_TRANSITIONS=122} [2023-08-26 15:21:05,126 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -10 predicate places. [2023-08-26 15:21:05,126 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 122 transitions, 1206 flow [2023-08-26 15:21:05,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 15:21:05,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:05,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:05,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 15:21:05,127 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:05,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:05,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1462141530, now seen corresponding path program 1 times [2023-08-26 15:21:05,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:05,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913112080] [2023-08-26 15:21:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:05,354 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 15:21:05,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:05,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913112080] [2023-08-26 15:21:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913112080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:21:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822312153] [2023-08-26 15:21:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:05,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:21:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:05,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:21:05,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:21:05,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 366 [2023-08-26 15:21:05,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 122 transitions, 1206 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 15:21:05,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:05,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 366 [2023-08-26 15:21:05,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:10,318 INFO L124 PetriNetUnfolderBase]: 24813/37457 cut-off events. [2023-08-26 15:21:10,318 INFO L125 PetriNetUnfolderBase]: For 92379/93743 co-relation queries the response was YES. [2023-08-26 15:21:10,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157766 conditions, 37457 events. 24813/37457 cut-off events. For 92379/93743 co-relation queries the response was YES. Maximal size of possible extension queue 2290. Compared 276521 event pairs, 7587 based on Foata normal form. 548/36670 useless extension candidates. Maximal degree in co-relation 157743. Up to 35562 conditions per place. [2023-08-26 15:21:10,546 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 135 selfloop transitions, 5 changer transitions 0/162 dead transitions. [2023-08-26 15:21:10,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 162 transitions, 1816 flow [2023-08-26 15:21:10,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:21:10,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:21:10,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-08-26 15:21:10,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42805100182149364 [2023-08-26 15:21:10,548 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-08-26 15:21:10,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-08-26 15:21:10,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:10,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-08-26 15:21:10,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states 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 15:21:10,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:21:10,551 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 366.0) internal successors, (1464), 4 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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 15:21:10,552 INFO L175 Difference]: Start difference. First operand has 89 places, 122 transitions, 1206 flow. Second operand 3 states and 470 transitions. [2023-08-26 15:21:10,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 162 transitions, 1816 flow [2023-08-26 15:21:11,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 162 transitions, 1808 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 15:21:11,439 INFO L231 Difference]: Finished difference. Result has 91 places, 126 transitions, 1234 flow [2023-08-26 15:21:11,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=91, PETRI_TRANSITIONS=126} [2023-08-26 15:21:11,439 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -8 predicate places. [2023-08-26 15:21:11,440 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 126 transitions, 1234 flow [2023-08-26 15:21:11,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states 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 15:21:11,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:11,440 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:11,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 15:21:11,440 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:11,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1548022367, now seen corresponding path program 1 times [2023-08-26 15:21:11,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:11,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461795365] [2023-08-26 15:21:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:11,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:11,680 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 15:21:11,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:11,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461795365] [2023-08-26 15:21:11,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461795365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:11,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:21:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676328794] [2023-08-26 15:21:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:11,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:11,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:11,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 366 [2023-08-26 15:21:11,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 126 transitions, 1234 flow. Second operand has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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 15:21:11,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:11,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 366 [2023-08-26 15:21:11,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:13,791 INFO L124 PetriNetUnfolderBase]: 8776/14660 cut-off events. [2023-08-26 15:21:13,791 INFO L125 PetriNetUnfolderBase]: For 36402/37297 co-relation queries the response was YES. [2023-08-26 15:21:13,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65553 conditions, 14660 events. 8776/14660 cut-off events. For 36402/37297 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 108853 event pairs, 1737 based on Foata normal form. 604/14800 useless extension candidates. Maximal degree in co-relation 65529. Up to 12158 conditions per place. [2023-08-26 15:21:13,875 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 161 selfloop transitions, 9 changer transitions 0/190 dead transitions. [2023-08-26 15:21:13,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 190 transitions, 2120 flow [2023-08-26 15:21:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2023-08-26 15:21:13,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4262295081967213 [2023-08-26 15:21:13,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2023-08-26 15:21:13,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2023-08-26 15:21:13,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:13,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2023-08-26 15:21:13,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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 15:21:13,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:21:13,881 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:21:13,881 INFO L175 Difference]: Start difference. First operand has 91 places, 126 transitions, 1234 flow. Second operand 4 states and 624 transitions. [2023-08-26 15:21:13,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 190 transitions, 2120 flow [2023-08-26 15:21:14,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 190 transitions, 2105 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 15:21:14,205 INFO L231 Difference]: Finished difference. Result has 94 places, 125 transitions, 1230 flow [2023-08-26 15:21:14,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1230, PETRI_PLACES=94, PETRI_TRANSITIONS=125} [2023-08-26 15:21:14,206 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -5 predicate places. [2023-08-26 15:21:14,206 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 125 transitions, 1230 flow [2023-08-26 15:21:14,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states 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 15:21:14,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:14,206 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] [2023-08-26 15:21:14,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 15:21:14,207 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:14,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:14,207 INFO L85 PathProgramCache]: Analyzing trace with hash -148113045, now seen corresponding path program 1 times [2023-08-26 15:21:14,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:14,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141365403] [2023-08-26 15:21:14,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:14,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:21:14,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:14,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141365403] [2023-08-26 15:21:14,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141365403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:14,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:21:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561267834] [2023-08-26 15:21:14,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:14,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:21:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:14,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:21:14,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:21:14,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 366 [2023-08-26 15:21:14,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 125 transitions, 1230 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 15:21:14,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:14,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 366 [2023-08-26 15:21:14,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:18,636 INFO L124 PetriNetUnfolderBase]: 18496/30767 cut-off events. [2023-08-26 15:21:18,636 INFO L125 PetriNetUnfolderBase]: For 95759/96973 co-relation queries the response was YES. [2023-08-26 15:21:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147397 conditions, 30767 events. 18496/30767 cut-off events. For 95759/96973 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 250004 event pairs, 3889 based on Foata normal form. 505/30295 useless extension candidates. Maximal degree in co-relation 147372. Up to 15151 conditions per place. [2023-08-26 15:21:18,854 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 242 selfloop transitions, 4 changer transitions 6/270 dead transitions. [2023-08-26 15:21:18,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 270 transitions, 3122 flow [2023-08-26 15:21:18,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:21:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:21:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 646 transitions. [2023-08-26 15:21:18,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412568306010929 [2023-08-26 15:21:18,856 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 646 transitions. [2023-08-26 15:21:18,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 646 transitions. [2023-08-26 15:21:18,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:18,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 646 transitions. [2023-08-26 15:21:18,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 0 states have call successors, (0), 0 states 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 15:21:18,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:21:18,859 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 366.0) internal successors, (1830), 5 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states 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 15:21:18,859 INFO L175 Difference]: Start difference. First operand has 94 places, 125 transitions, 1230 flow. Second operand 4 states and 646 transitions. [2023-08-26 15:21:18,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 270 transitions, 3122 flow [2023-08-26 15:21:19,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 270 transitions, 3080 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-26 15:21:19,559 INFO L231 Difference]: Finished difference. Result has 96 places, 126 transitions, 1230 flow [2023-08-26 15:21:19,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1230, PETRI_PLACES=96, PETRI_TRANSITIONS=126} [2023-08-26 15:21:19,560 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -3 predicate places. [2023-08-26 15:21:19,560 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 126 transitions, 1230 flow [2023-08-26 15:21:19,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states 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 15:21:19,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:19,560 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] [2023-08-26 15:21:19,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 15:21:19,560 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:19,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:19,561 INFO L85 PathProgramCache]: Analyzing trace with hash -603096985, now seen corresponding path program 2 times [2023-08-26 15:21:19,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:19,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504916000] [2023-08-26 15:21:19,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:19,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:19,785 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 15:21:19,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:19,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504916000] [2023-08-26 15:21:19,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504916000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:19,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:19,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 15:21:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32806978] [2023-08-26 15:21:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:19,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:21:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:19,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:21:19,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:21:19,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 366 [2023-08-26 15:21:19,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 126 transitions, 1230 flow. Second operand has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 15:21:19,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:19,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 366 [2023-08-26 15:21:19,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:21,332 INFO L124 PetriNetUnfolderBase]: 5112/9012 cut-off events. [2023-08-26 15:21:21,332 INFO L125 PetriNetUnfolderBase]: For 27786/28940 co-relation queries the response was YES. [2023-08-26 15:21:21,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40750 conditions, 9012 events. 5112/9012 cut-off events. For 27786/28940 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 66683 event pairs, 508 based on Foata normal form. 975/9800 useless extension candidates. Maximal degree in co-relation 40724. Up to 3541 conditions per place. [2023-08-26 15:21:21,387 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 147 selfloop transitions, 13 changer transitions 12/188 dead transitions. [2023-08-26 15:21:21,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 188 transitions, 2035 flow [2023-08-26 15:21:21,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:21:21,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:21:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 775 transitions. [2023-08-26 15:21:21,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42349726775956287 [2023-08-26 15:21:21,389 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 775 transitions. [2023-08-26 15:21:21,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 775 transitions. [2023-08-26 15:21:21,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:21,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 775 transitions. [2023-08-26 15:21:21,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 155.0) internal successors, (775), 5 states have internal predecessors, (775), 0 states have call successors, (0), 0 states 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 15:21:21,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:21:21,392 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 366.0) internal successors, (2196), 6 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 15:21:21,392 INFO L175 Difference]: Start difference. First operand has 96 places, 126 transitions, 1230 flow. Second operand 5 states and 775 transitions. [2023-08-26 15:21:21,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 188 transitions, 2035 flow [2023-08-26 15:21:21,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 188 transitions, 2001 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 15:21:21,481 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 863 flow [2023-08-26 15:21:21,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=863, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2023-08-26 15:21:21,481 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -3 predicate places. [2023-08-26 15:21:21,482 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 863 flow [2023-08-26 15:21:21,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 15:21:21,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:21,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:21,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 15:21:21,482 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:21,483 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1195377347, now seen corresponding path program 1 times [2023-08-26 15:21:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:21,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015801212] [2023-08-26 15:21:21,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:21,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:21:21,759 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 15:21:21,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:21:21,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015801212] [2023-08-26 15:21:21,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015801212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:21:21,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:21:21,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:21:21,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276866491] [2023-08-26 15:21:21,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:21:21,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 15:21:21,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:21:21,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 15:21:21,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 15:21:21,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 366 [2023-08-26 15:21:21,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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 15:21:21,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:21:21,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 366 [2023-08-26 15:21:21,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:21:22,657 INFO L124 PetriNetUnfolderBase]: 3842/6206 cut-off events. [2023-08-26 15:21:22,657 INFO L125 PetriNetUnfolderBase]: For 24233/25329 co-relation queries the response was YES. [2023-08-26 15:21:22,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30468 conditions, 6206 events. 3842/6206 cut-off events. For 24233/25329 co-relation queries the response was YES. Maximal size of possible extension queue 485. Compared 41963 event pairs, 286 based on Foata normal form. 682/6781 useless extension candidates. Maximal degree in co-relation 30442. Up to 2289 conditions per place. [2023-08-26 15:21:22,683 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 82 selfloop transitions, 17 changer transitions 47/154 dead transitions. [2023-08-26 15:21:22,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 1628 flow [2023-08-26 15:21:22,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:21:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:21:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 908 transitions. [2023-08-26 15:21:22,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4134790528233151 [2023-08-26 15:21:22,685 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 908 transitions. [2023-08-26 15:21:22,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 908 transitions. [2023-08-26 15:21:22,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:21:22,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 908 transitions. [2023-08-26 15:21:22,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.33333333333334) internal successors, (908), 6 states have internal predecessors, (908), 0 states have call successors, (0), 0 states 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 15:21:22,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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 15:21:22,690 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 366.0) internal successors, (2562), 7 states have internal predecessors, (2562), 0 states have call successors, (0), 0 states 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 15:21:22,690 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 863 flow. Second operand 6 states and 908 transitions. [2023-08-26 15:21:22,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 1628 flow [2023-08-26 15:21:22,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 154 transitions, 1514 flow, removed 31 selfloop flow, removed 12 redundant places. [2023-08-26 15:21:22,882 INFO L231 Difference]: Finished difference. Result has 81 places, 55 transitions, 457 flow [2023-08-26 15:21:22,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=366, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=81, PETRI_TRANSITIONS=55} [2023-08-26 15:21:22,882 INFO L281 CegarLoopForPetriNet]: 99 programPoint places, -18 predicate places. [2023-08-26 15:21:22,882 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 55 transitions, 457 flow [2023-08-26 15:21:22,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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 15:21:22,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:21:22,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 15:21:22,883 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 15:21:22,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:21:22,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1606140990, now seen corresponding path program 1 times [2023-08-26 15:21:22,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:21:22,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816684535] [2023-08-26 15:21:22,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:21:22,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:21:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:21:23,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:21:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:21:23,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:21:23,147 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:21:23,148 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONASSERT (86 of 87 remaining) [2023-08-26 15:21:23,149 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 87 remaining) [2023-08-26 15:21:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 87 remaining) [2023-08-26 15:21:23,150 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 87 remaining) [2023-08-26 15:21:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 87 remaining) [2023-08-26 15:21:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 87 remaining) [2023-08-26 15:21:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 87 remaining) [2023-08-26 15:21:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 87 remaining) [2023-08-26 15:21:23,153 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 87 remaining) [2023-08-26 15:21:23,154 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 87 remaining) [2023-08-26 15:21:23,155 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 87 remaining) [2023-08-26 15:21:23,156 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 87 remaining) [2023-08-26 15:21:23,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 87 remaining) [2023-08-26 15:21:23,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 87 remaining) [2023-08-26 15:21:23,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 87 remaining) [2023-08-26 15:21:23,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 87 remaining) [2023-08-26 15:21:23,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 87 remaining) [2023-08-26 15:21:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 87 remaining) [2023-08-26 15:21:23,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 87 remaining) [2023-08-26 15:21:23,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 15:21:23,162 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:21:23,170 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:21:23,170 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:21:23,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:21:23 BasicIcfg [2023-08-26 15:21:23,283 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:21:23,283 INFO L158 Benchmark]: Toolchain (without parser) took 132369.45ms. Allocated memory was 360.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 317.3MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-26 15:21:23,283 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 337.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:21:23,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 591.11ms. Allocated memory is still 360.7MB. Free memory was 317.3MB in the beginning and 291.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-26 15:21:23,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.43ms. Allocated memory is still 360.7MB. Free memory was 291.1MB in the beginning and 287.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:21:23,284 INFO L158 Benchmark]: Boogie Preprocessor took 36.68ms. Allocated memory is still 360.7MB. Free memory was 287.9MB in the beginning and 285.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:21:23,284 INFO L158 Benchmark]: RCFGBuilder took 1424.23ms. Allocated memory is still 360.7MB. Free memory was 285.8MB in the beginning and 252.5MB in the end (delta: 33.4MB). Peak memory consumption was 170.7MB. Max. memory is 16.0GB. [2023-08-26 15:21:23,284 INFO L158 Benchmark]: TraceAbstraction took 130248.67ms. Allocated memory was 360.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 251.4MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-26 15:21:23,285 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 360.7MB. Free memory is still 337.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 591.11ms. Allocated memory is still 360.7MB. Free memory was 317.3MB in the beginning and 291.1MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 63.43ms. Allocated memory is still 360.7MB. Free memory was 291.1MB in the beginning and 287.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 36.68ms. Allocated memory is still 360.7MB. Free memory was 287.9MB in the beginning and 285.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1424.23ms. Allocated memory is still 360.7MB. Free memory was 285.8MB in the beginning and 252.5MB in the end (delta: 33.4MB). Peak memory consumption was 170.7MB. Max. memory is 16.0GB. * TraceAbstraction took 130248.67ms. Allocated memory was 360.7MB in the beginning and 15.3GB in the end (delta: 15.0GB). Free memory was 251.4MB in the beginning and 10.4GB in the end (delta: -10.1GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.4s, 206 PlacesBefore, 99 PlacesAfterwards, 196 TransitionsBefore, 87 TransitionsAfterwards, 8996 CoEnabledTransitionPairs, 7 FixpointIterations, 74 TrivialSequentialCompositions, 81 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 166 TotalNumberOfCompositions, 41452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10791, independent: 10100, independent conditional: 0, independent unconditional: 10100, dependent: 691, dependent conditional: 0, dependent unconditional: 691, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3653, independent: 3556, independent conditional: 0, independent unconditional: 3556, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10791, independent: 6544, independent conditional: 0, independent unconditional: 6544, dependent: 594, dependent conditional: 0, dependent unconditional: 594, unknown: 3653, unknown conditional: 0, unknown unconditional: 3653] , Statistics on independence cache: Total cache size (in pairs): 597, Positive cache size: 545, Positive conditional cache size: 0, Positive unconditional cache size: 545, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p2_EAX = 0; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff0_thd4; [L747] 0 _Bool y$r_buff1_thd0; [L748] 0 _Bool y$r_buff1_thd1; [L749] 0 _Bool y$r_buff1_thd2; [L750] 0 _Bool y$r_buff1_thd3; [L751] 0 _Bool y$r_buff1_thd4; [L752] 0 _Bool y$read_delayed; [L753] 0 int *y$read_delayed_var; [L754] 0 int y$w_buff0; [L755] 0 _Bool y$w_buff0_used; [L756] 0 int y$w_buff1; [L757] 0 _Bool y$w_buff1_used; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice1; [L760] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2145; [L853] FCALL, FORK 0 pthread_create(&t2145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2145, ((void *)0), P0, ((void *)0))=-3, t2145={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t2146; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={7:0}, t2146={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t2146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2146, ((void *)0), P1, ((void *)0))=-2, t2145={7:0}, t2146={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] 0 pthread_t t2147; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2145={7:0}, t2146={8:0}, t2147={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] FCALL, FORK 0 pthread_create(&t2147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2147, ((void *)0), P2, ((void *)0))=-1, t2145={7:0}, t2146={8:0}, t2147={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] 0 pthread_t t2148; [L859] FCALL, FORK 0 pthread_create(&t2148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2148, ((void *)0), P3, ((void *)0))=0, t2145={7:0}, t2146={8:0}, t2147={9:0}, t2148={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 y$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(y) [L767] 1 y$mem_tmp = y [L768] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] EXPR 1 \read(y) [L769] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L769] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L770] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L771] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L772] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L773] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L777] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L778] EXPR 1 \read(y) [L778] 1 __unbuffered_p0_EAX = y [L779] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L779] 1 y = y$flush_delayed ? y$mem_tmp : y [L780] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L807] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L827] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 \read(y) [L830] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L830] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L830] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L832] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L833] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L834] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L788] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 \read(y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2145={7:0}, t2146={8:0}, t2147={9:0}, t2148={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] EXPR 0 \read(y) [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] EXPR 0 \read(y) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L884] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L884] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L884] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 x == 2 && y == 2 [L885] EXPR 0 \read(y) [L885] EXPR 0 x == 2 && y == 2 [L885] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] EXPR 0 \read(y) [L886] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L886] 0 y = y$flush_delayed ? y$mem_tmp : y [L887] 0 y$flush_delayed = (_Bool)0 [L889] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe016_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 258 locations, 87 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 129.9s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 105.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 901 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1915 IncrementalHoareTripleChecker+Invalid, 2106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 16 mSDtfsCounter, 1915 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1234occurred in iteration=16, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 2361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:21:23,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...