/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 PROGRAM_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/safe027_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:27:49,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:27:49,486 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 18:27:49,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:27:49,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:27:49,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:27:49,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:27:49,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:27:49,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:27:49,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:27:49,522 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:27:49,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:27:49,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:27:49,523 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:27:49,523 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:27:49,523 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:27:49,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:27:49,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:27:49,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:27:49,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:27:49,524 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:27:49,524 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:27:49,525 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:27:49,525 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:27:49,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:27:49,525 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:27:49,525 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:27:49,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:27:49,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:27:49,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:27:49,527 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:27:49,527 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:27:49,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:27:49,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:27:49,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:27:49,527 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 -> PROGRAM_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 18:27:49,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:27:49,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:27:49,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:27:49,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:27:49,786 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:27:49,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2023-08-26 18:27:50,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:27:50,871 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:27:50,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe027_power.oepc.i [2023-08-26 18:27:50,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff8fed63/2c89fd4034ef47628d5e4ba3d774172a/FLAG73725c326 [2023-08-26 18:27:50,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff8fed63/2c89fd4034ef47628d5e4ba3d774172a [2023-08-26 18:27:50,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:27:50,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:27:50,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:27:50,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:27:50,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:27:50,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:27:50" (1/1) ... [2023-08-26 18:27:50,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d5a6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:50, skipping insertion in model container [2023-08-26 18:27:50,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:27:50" (1/1) ... [2023-08-26 18:27:50,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:27:51,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:27:51,203 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:27:51,227 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:27:51,229 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:27:51,272 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:27:51,299 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:27:51,300 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:27:51,304 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:27:51,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51 WrapperNode [2023-08-26 18:27:51,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:27:51,306 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:27:51,306 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:27:51,306 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:27:51,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,365 INFO L138 Inliner]: procedures = 177, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 156 [2023-08-26 18:27:51,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:27:51,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:27:51,366 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:27:51,366 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:27:51,372 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:27:51,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:27:51,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:27:51,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:27:51,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (1/1) ... [2023-08-26 18:27:51,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:27:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:27:51,434 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 18:27:51,440 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 18:27:51,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:27:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:27:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:27:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:27:51,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 18:27:51,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 18:27:51,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:27:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:27:51,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:27:51,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:27:51,464 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 18:27:51,603 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:27:51,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:27:52,065 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:27:52,521 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:27:52,521 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:27:52,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:27:52 BoogieIcfgContainer [2023-08-26 18:27:52,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:27:52,525 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:27:52,525 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:27:52,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:27:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:27:50" (1/3) ... [2023-08-26 18:27:52,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54181619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:27:52, skipping insertion in model container [2023-08-26 18:27:52,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:27:51" (2/3) ... [2023-08-26 18:27:52,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54181619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:27:52, skipping insertion in model container [2023-08-26 18:27:52,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:27:52" (3/3) ... [2023-08-26 18:27:52,530 INFO L112 eAbstractionObserver]: Analyzing ICFG safe027_power.oepc.i [2023-08-26 18:27:52,545 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:27:52,545 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 49 error locations. [2023-08-26 18:27:52,545 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:27:52,674 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:27:52,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 195 transitions, 410 flow [2023-08-26 18:27:52,783 INFO L124 PetriNetUnfolderBase]: 3/191 cut-off events. [2023-08-26 18:27:52,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:27:52,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 3/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 292 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2023-08-26 18:27:52,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 195 transitions, 410 flow [2023-08-26 18:27:52,795 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 201 places, 191 transitions, 394 flow [2023-08-26 18:27:52,798 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:27:52,807 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 191 transitions, 394 flow [2023-08-26 18:27:52,812 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 191 transitions, 394 flow [2023-08-26 18:27:52,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 191 transitions, 394 flow [2023-08-26 18:27:52,867 INFO L124 PetriNetUnfolderBase]: 3/191 cut-off events. [2023-08-26 18:27:52,867 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:27:52,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 3/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 300 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 131. Up to 2 conditions per place. [2023-08-26 18:27:52,872 INFO L119 LiptonReduction]: Number of co-enabled transitions 8638 [2023-08-26 18:28:04,903 INFO L134 LiptonReduction]: Checked pairs total: 39131 [2023-08-26 18:28:04,903 INFO L136 LiptonReduction]: Total number of compositions: 165 [2023-08-26 18:28:04,916 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:28:04,924 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;@6c171b61, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:28:04,924 INFO L358 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2023-08-26 18:28:04,925 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:28:04,925 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:28:04,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:04,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:04,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:28:04,925 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 18:28:04,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:04,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1176, now seen corresponding path program 1 times [2023-08-26 18:28:04,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:04,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622556690] [2023-08-26 18:28:04,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:04,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:05,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622556690] [2023-08-26 18:28:05,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622556690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:05,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:05,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:28:05,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067233851] [2023-08-26 18:28:05,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:05,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:28:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:05,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:28:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:28:05,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 360 [2023-08-26 18:28:05,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 82 transitions, 176 flow. Second operand has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:05,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:05,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 360 [2023-08-26 18:28:05,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:10,947 INFO L124 PetriNetUnfolderBase]: 42996/57728 cut-off events. [2023-08-26 18:28:10,947 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-26 18:28:11,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114778 conditions, 57728 events. 42996/57728 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 3009. Compared 346332 event pairs, 42996 based on Foata normal form. 900/33207 useless extension candidates. Maximal degree in co-relation 114766. Up to 56823 conditions per place. [2023-08-26 18:28:11,262 INFO L140 encePairwiseOnDemand]: 326/360 looper letters, 44 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-26 18:28:11,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 194 flow [2023-08-26 18:28:11,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:28:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:28:11,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 366 transitions. [2023-08-26 18:28:11,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2023-08-26 18:28:11,277 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 366 transitions. [2023-08-26 18:28:11,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 366 transitions. [2023-08-26 18:28:11,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:11,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 366 transitions. [2023-08-26 18:28:11,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 183.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:11,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:11,289 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:11,290 INFO L175 Difference]: Start difference. First operand has 93 places, 82 transitions, 176 flow. Second operand 2 states and 366 transitions. [2023-08-26 18:28:11,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 194 flow [2023-08-26 18:28:11,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 47 transitions, 190 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:28:11,296 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 102 flow [2023-08-26 18:28:11,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=102, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-08-26 18:28:11,299 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2023-08-26 18:28:11,300 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 102 flow [2023-08-26 18:28:11,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:11,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:11,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:28:11,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:28:11,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:11,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:11,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1163542, now seen corresponding path program 1 times [2023-08-26 18:28:11,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:11,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257161365] [2023-08-26 18:28:11,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:11,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:11,505 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 18:28:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:11,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257161365] [2023-08-26 18:28:11,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257161365] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:11,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:11,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:28:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025778543] [2023-08-26 18:28:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:11,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:11,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:11,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:11,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 360 [2023-08-26 18:28:11,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:11,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:11,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 360 [2023-08-26 18:28:11,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:15,951 INFO L124 PetriNetUnfolderBase]: 30602/41752 cut-off events. [2023-08-26 18:28:15,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:28:16,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83420 conditions, 41752 events. 30602/41752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 250306 event pairs, 19886 based on Foata normal form. 0/28812 useless extension candidates. Maximal degree in co-relation 83417. Up to 26751 conditions per place. [2023-08-26 18:28:16,139 INFO L140 encePairwiseOnDemand]: 344/360 looper letters, 53 selfloop transitions, 9 changer transitions 0/63 dead transitions. [2023-08-26 18:28:16,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 63 transitions, 258 flow [2023-08-26 18:28:16,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:16,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2023-08-26 18:28:16,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39444444444444443 [2023-08-26 18:28:16,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 426 transitions. [2023-08-26 18:28:16,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 426 transitions. [2023-08-26 18:28:16,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:16,142 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 426 transitions. [2023-08-26 18:28:16,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:16,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:16,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:16,148 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 102 flow. Second operand 3 states and 426 transitions. [2023-08-26 18:28:16,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 63 transitions, 258 flow [2023-08-26 18:28:16,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 63 transitions, 258 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:28:16,150 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 172 flow [2023-08-26 18:28:16,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-08-26 18:28:16,151 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2023-08-26 18:28:16,152 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 172 flow [2023-08-26 18:28:16,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:16,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:16,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:28:16,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:28:16,157 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:16,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1163543, now seen corresponding path program 1 times [2023-08-26 18:28:16,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:16,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024212591] [2023-08-26 18:28:16,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:16,272 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 18:28:16,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:16,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024212591] [2023-08-26 18:28:16,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024212591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:16,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:28:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56331299] [2023-08-26 18:28:16,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:16,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:16,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:16,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:16,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:16,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 360 [2023-08-26 18:28:16,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:16,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:16,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 360 [2023-08-26 18:28:16,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:18,436 INFO L124 PetriNetUnfolderBase]: 10484/14999 cut-off events. [2023-08-26 18:28:18,436 INFO L125 PetriNetUnfolderBase]: For 4187/4187 co-relation queries the response was YES. [2023-08-26 18:28:18,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38876 conditions, 14999 events. 10484/14999 cut-off events. For 4187/4187 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 87863 event pairs, 8660 based on Foata normal form. 3267/17449 useless extension candidates. Maximal degree in co-relation 38871. Up to 14229 conditions per place. [2023-08-26 18:28:18,494 INFO L140 encePairwiseOnDemand]: 352/360 looper letters, 40 selfloop transitions, 1 changer transitions 1/45 dead transitions. [2023-08-26 18:28:18,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 45 transitions, 242 flow [2023-08-26 18:28:18,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:18,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:18,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-26 18:28:18,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38425925925925924 [2023-08-26 18:28:18,496 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-26 18:28:18,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-26 18:28:18,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:18,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-26 18:28:18,497 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 18:28:18,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:18,499 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:18,499 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 172 flow. Second operand 3 states and 415 transitions. [2023-08-26 18:28:18,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 45 transitions, 242 flow [2023-08-26 18:28:18,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:18,522 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 140 flow [2023-08-26 18:28:18,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-26 18:28:18,522 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -41 predicate places. [2023-08-26 18:28:18,522 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 140 flow [2023-08-26 18:28:18,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:18,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:18,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:18,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:28:18,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:18,523 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1418787062, now seen corresponding path program 1 times [2023-08-26 18:28:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406989389] [2023-08-26 18:28:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:18,605 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 18:28:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:18,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406989389] [2023-08-26 18:28:18,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406989389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:18,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:18,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:28:18,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949252508] [2023-08-26 18:28:18,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:18,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:18,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:18,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:18,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:18,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 360 [2023-08-26 18:28:18,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:18,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:18,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 360 [2023-08-26 18:28:18,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:20,378 INFO L124 PetriNetUnfolderBase]: 9810/14083 cut-off events. [2023-08-26 18:28:20,378 INFO L125 PetriNetUnfolderBase]: For 1588/1588 co-relation queries the response was YES. [2023-08-26 18:28:20,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34438 conditions, 14083 events. 9810/14083 cut-off events. For 1588/1588 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 82542 event pairs, 7135 based on Foata normal form. 0/12271 useless extension candidates. Maximal degree in co-relation 34433. Up to 8575 conditions per place. [2023-08-26 18:28:20,431 INFO L140 encePairwiseOnDemand]: 356/360 looper letters, 69 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-26 18:28:20,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 76 transitions, 384 flow [2023-08-26 18:28:20,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-26 18:28:20,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2023-08-26 18:28:20,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-26 18:28:20,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-26 18:28:20,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:20,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-26 18:28:20,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:20,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:20,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:20,436 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 140 flow. Second operand 3 states and 492 transitions. [2023-08-26 18:28:20,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 76 transitions, 384 flow [2023-08-26 18:28:20,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 76 transitions, 383 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:28:20,437 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 152 flow [2023-08-26 18:28:20,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-26 18:28:20,438 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -40 predicate places. [2023-08-26 18:28:20,438 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 152 flow [2023-08-26 18:28:20,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:20,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:20,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:20,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:28:20,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:20,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:20,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1418786794, now seen corresponding path program 1 times [2023-08-26 18:28:20,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289387728] [2023-08-26 18:28:20,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:20,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:20,547 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 18:28:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289387728] [2023-08-26 18:28:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289387728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:20,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:20,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:28:20,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962337789] [2023-08-26 18:28:20,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:20,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:20,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:20,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:20,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:20,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 360 [2023-08-26 18:28:20,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:20,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:20,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 360 [2023-08-26 18:28:20,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:22,347 INFO L124 PetriNetUnfolderBase]: 9679/13833 cut-off events. [2023-08-26 18:28:22,348 INFO L125 PetriNetUnfolderBase]: For 3262/3322 co-relation queries the response was YES. [2023-08-26 18:28:22,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36190 conditions, 13833 events. 9679/13833 cut-off events. For 3262/3322 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 83403 event pairs, 2118 based on Foata normal form. 60/12599 useless extension candidates. Maximal degree in co-relation 36184. Up to 11135 conditions per place. [2023-08-26 18:28:22,408 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 65 selfloop transitions, 2 changer transitions 0/71 dead transitions. [2023-08-26 18:28:22,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 382 flow [2023-08-26 18:28:22,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:22,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2023-08-26 18:28:22,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44722222222222224 [2023-08-26 18:28:22,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2023-08-26 18:28:22,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2023-08-26 18:28:22,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:22,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2023-08-26 18:28:22,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:22,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:22,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:22,413 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 152 flow. Second operand 3 states and 483 transitions. [2023-08-26 18:28:22,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 382 flow [2023-08-26 18:28:22,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:22,415 INFO L231 Difference]: Finished difference. Result has 54 places, 44 transitions, 154 flow [2023-08-26 18:28:22,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=54, PETRI_TRANSITIONS=44} [2023-08-26 18:28:22,416 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -39 predicate places. [2023-08-26 18:28:22,416 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 44 transitions, 154 flow [2023-08-26 18:28:22,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:22,417 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:22,417 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:22,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:28:22,417 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:22,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash -262324980, now seen corresponding path program 1 times [2023-08-26 18:28:22,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:22,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632282911] [2023-08-26 18:28:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:22,767 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 18:28:22,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:22,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632282911] [2023-08-26 18:28:22,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632282911] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:22,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:22,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:28:22,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151850897] [2023-08-26 18:28:22,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:22,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:28:22,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:22,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:28:22,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:28:22,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 360 [2023-08-26 18:28:22,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 44 transitions, 154 flow. Second operand has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:22,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:22,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 360 [2023-08-26 18:28:22,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:24,324 INFO L124 PetriNetUnfolderBase]: 9937/14630 cut-off events. [2023-08-26 18:28:24,324 INFO L125 PetriNetUnfolderBase]: For 2393/2393 co-relation queries the response was YES. [2023-08-26 18:28:24,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38371 conditions, 14630 events. 9937/14630 cut-off events. For 2393/2393 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 90318 event pairs, 3349 based on Foata normal form. 0/13154 useless extension candidates. Maximal degree in co-relation 38364. Up to 5404 conditions per place. [2023-08-26 18:28:24,383 INFO L140 encePairwiseOnDemand]: 350/360 looper letters, 73 selfloop transitions, 10 changer transitions 0/84 dead transitions. [2023-08-26 18:28:24,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 446 flow [2023-08-26 18:28:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:28:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:28:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-26 18:28:24,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36777777777777776 [2023-08-26 18:28:24,386 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-26 18:28:24,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-26 18:28:24,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:24,386 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-26 18:28:24,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:24,389 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:24,391 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:24,391 INFO L175 Difference]: Start difference. First operand has 54 places, 44 transitions, 154 flow. Second operand 5 states and 662 transitions. [2023-08-26 18:28:24,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 446 flow [2023-08-26 18:28:24,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 84 transitions, 438 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:24,397 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 224 flow [2023-08-26 18:28:24,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-26 18:28:24,399 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -36 predicate places. [2023-08-26 18:28:24,401 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 224 flow [2023-08-26 18:28:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.5) internal successors, (717), 6 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:24,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:24,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:28:24,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:24,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1032718573, now seen corresponding path program 1 times [2023-08-26 18:28:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:24,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346638354] [2023-08-26 18:28:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:24,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:24,869 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 18:28:24,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346638354] [2023-08-26 18:28:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346638354] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:24,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907464802] [2023-08-26 18:28:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:24,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:24,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:24,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:24,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 360 [2023-08-26 18:28:24,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 50 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:24,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:24,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 360 [2023-08-26 18:28:24,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:26,413 INFO L124 PetriNetUnfolderBase]: 9174/13771 cut-off events. [2023-08-26 18:28:26,414 INFO L125 PetriNetUnfolderBase]: For 9201/9201 co-relation queries the response was YES. [2023-08-26 18:28:26,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38716 conditions, 13771 events. 9174/13771 cut-off events. For 9201/9201 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 87253 event pairs, 3509 based on Foata normal form. 96/13627 useless extension candidates. Maximal degree in co-relation 38707. Up to 7768 conditions per place. [2023-08-26 18:28:26,474 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 69 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-26 18:28:26,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 76 transitions, 445 flow [2023-08-26 18:28:26,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:26,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-26 18:28:26,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3819444444444444 [2023-08-26 18:28:26,476 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-26 18:28:26,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-26 18:28:26,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:26,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-26 18:28:26,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:26,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:26,479 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:26,479 INFO L175 Difference]: Start difference. First operand has 57 places, 50 transitions, 224 flow. Second operand 4 states and 550 transitions. [2023-08-26 18:28:26,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 76 transitions, 445 flow [2023-08-26 18:28:26,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 438 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:28:26,571 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 219 flow [2023-08-26 18:28:26,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=53, 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=219, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-26 18:28:26,571 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -37 predicate places. [2023-08-26 18:28:26,571 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 219 flow [2023-08-26 18:28:26,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:26,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:26,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:26,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:28:26,572 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:26,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:26,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1565295516, now seen corresponding path program 1 times [2023-08-26 18:28:26,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:26,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422717641] [2023-08-26 18:28:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:26,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:26,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422717641] [2023-08-26 18:28:26,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422717641] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:26,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:26,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:28:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849077118] [2023-08-26 18:28:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:26,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:26,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:26,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:26,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:26,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 360 [2023-08-26 18:28:26,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 49 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:26,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:26,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 360 [2023-08-26 18:28:26,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:29,224 INFO L124 PetriNetUnfolderBase]: 17388/24762 cut-off events. [2023-08-26 18:28:29,224 INFO L125 PetriNetUnfolderBase]: For 22236/22386 co-relation queries the response was YES. [2023-08-26 18:28:29,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71154 conditions, 24762 events. 17388/24762 cut-off events. For 22236/22386 co-relation queries the response was YES. Maximal size of possible extension queue 1333. Compared 156692 event pairs, 2999 based on Foata normal form. 144/24105 useless extension candidates. Maximal degree in co-relation 71146. Up to 11162 conditions per place. [2023-08-26 18:28:29,345 INFO L140 encePairwiseOnDemand]: 356/360 looper letters, 115 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2023-08-26 18:28:29,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 122 transitions, 792 flow [2023-08-26 18:28:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-26 18:28:29,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-26 18:28:29,347 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-26 18:28:29,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-26 18:28:29,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:29,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-26 18:28:29,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:29,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:29,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:29,350 INFO L175 Difference]: Start difference. First operand has 56 places, 49 transitions, 219 flow. Second operand 4 states and 640 transitions. [2023-08-26 18:28:29,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 122 transitions, 792 flow [2023-08-26 18:28:29,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 122 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:29,497 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 234 flow [2023-08-26 18:28:29,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=234, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-26 18:28:29,498 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -34 predicate places. [2023-08-26 18:28:29,498 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 234 flow [2023-08-26 18:28:29,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:29,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:29,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:29,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:28:29,498 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:29,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:29,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1949563995, now seen corresponding path program 1 times [2023-08-26 18:28:29,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:29,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142161511] [2023-08-26 18:28:29,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:29,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:29,672 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 18:28:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:29,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142161511] [2023-08-26 18:28:29,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142161511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:29,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:29,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:28:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140316790] [2023-08-26 18:28:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:29,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:29,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 360 [2023-08-26 18:28:29,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:29,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:29,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 360 [2023-08-26 18:28:29,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:31,934 INFO L124 PetriNetUnfolderBase]: 13256/20098 cut-off events. [2023-08-26 18:28:31,934 INFO L125 PetriNetUnfolderBase]: For 14967/14967 co-relation queries the response was YES. [2023-08-26 18:28:31,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60473 conditions, 20098 events. 13256/20098 cut-off events. For 14967/14967 co-relation queries the response was YES. Maximal size of possible extension queue 1184. Compared 137898 event pairs, 5113 based on Foata normal form. 24/19754 useless extension candidates. Maximal degree in co-relation 60463. Up to 11289 conditions per place. [2023-08-26 18:28:32,034 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 68 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-26 18:28:32,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 76 transitions, 463 flow [2023-08-26 18:28:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:32,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-26 18:28:32,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44907407407407407 [2023-08-26 18:28:32,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-26 18:28:32,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-26 18:28:32,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:32,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-26 18:28:32,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:32,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:32,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:32,038 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 234 flow. Second operand 3 states and 485 transitions. [2023-08-26 18:28:32,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 76 transitions, 463 flow [2023-08-26 18:28:32,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 76 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:32,224 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 241 flow [2023-08-26 18:28:32,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2023-08-26 18:28:32,224 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -33 predicate places. [2023-08-26 18:28:32,224 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 241 flow [2023-08-26 18:28:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:32,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:32,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:28:32,225 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:32,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:32,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1949477826, now seen corresponding path program 1 times [2023-08-26 18:28:32,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:32,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072503729] [2023-08-26 18:28:32,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:32,311 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 18:28:32,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072503729] [2023-08-26 18:28:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072503729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927670586] [2023-08-26 18:28:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:32,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:32,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 360 [2023-08-26 18:28:32,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:32,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:32,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 360 [2023-08-26 18:28:32,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:34,352 INFO L124 PetriNetUnfolderBase]: 12071/17324 cut-off events. [2023-08-26 18:28:34,352 INFO L125 PetriNetUnfolderBase]: For 13502/13502 co-relation queries the response was YES. [2023-08-26 18:28:34,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56603 conditions, 17324 events. 12071/17324 cut-off events. For 13502/13502 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 104388 event pairs, 3946 based on Foata normal form. 240/17287 useless extension candidates. Maximal degree in co-relation 56592. Up to 7131 conditions per place. [2023-08-26 18:28:34,418 INFO L140 encePairwiseOnDemand]: 346/360 looper letters, 57 selfloop transitions, 17 changer transitions 0/75 dead transitions. [2023-08-26 18:28:34,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 509 flow [2023-08-26 18:28:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:34,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2023-08-26 18:28:34,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3645833333333333 [2023-08-26 18:28:34,420 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2023-08-26 18:28:34,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2023-08-26 18:28:34,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:34,420 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2023-08-26 18:28:34,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:34,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:34,422 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:34,423 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 241 flow. Second operand 4 states and 525 transitions. [2023-08-26 18:28:34,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 509 flow [2023-08-26 18:28:34,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 75 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:28:34,547 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 374 flow [2023-08-26 18:28:34,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-08-26 18:28:34,547 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -30 predicate places. [2023-08-26 18:28:34,547 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 374 flow [2023-08-26 18:28:34,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:34,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:34,548 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 18:28:34,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:28:34,548 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:34,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:34,548 INFO L85 PathProgramCache]: Analyzing trace with hash -679250827, now seen corresponding path program 1 times [2023-08-26 18:28:34,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:34,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618619803] [2023-08-26 18:28:34,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:34,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:35,798 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 18:28:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:35,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618619803] [2023-08-26 18:28:35,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618619803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:35,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:35,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:28:35,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234871551] [2023-08-26 18:28:35,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:35,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:28:35,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:35,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:28:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:28:35,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 360 [2023-08-26 18:28:35,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 374 flow. Second operand has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:35,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:35,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 360 [2023-08-26 18:28:35,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:38,401 INFO L124 PetriNetUnfolderBase]: 13499/19335 cut-off events. [2023-08-26 18:28:38,401 INFO L125 PetriNetUnfolderBase]: For 25305/25305 co-relation queries the response was YES. [2023-08-26 18:28:38,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70153 conditions, 19335 events. 13499/19335 cut-off events. For 25305/25305 co-relation queries the response was YES. Maximal size of possible extension queue 1125. Compared 117602 event pairs, 6132 based on Foata normal form. 12/19071 useless extension candidates. Maximal degree in co-relation 70141. Up to 17497 conditions per place. [2023-08-26 18:28:38,479 INFO L140 encePairwiseOnDemand]: 349/360 looper letters, 100 selfloop transitions, 18 changer transitions 0/119 dead transitions. [2023-08-26 18:28:38,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 119 transitions, 891 flow [2023-08-26 18:28:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 18:28:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 18:28:38,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1131 transitions. [2023-08-26 18:28:38,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31416666666666665 [2023-08-26 18:28:38,482 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1131 transitions. [2023-08-26 18:28:38,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1131 transitions. [2023-08-26 18:28:38,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:38,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1131 transitions. [2023-08-26 18:28:38,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.1) internal successors, (1131), 10 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:38,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 360.0) internal successors, (3960), 11 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:38,487 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 360.0) internal successors, (3960), 11 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:38,487 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 374 flow. Second operand 10 states and 1131 transitions. [2023-08-26 18:28:38,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 119 transitions, 891 flow [2023-08-26 18:28:38,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 119 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:28:38,673 INFO L231 Difference]: Finished difference. Result has 75 places, 73 transitions, 558 flow [2023-08-26 18:28:38,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=558, PETRI_PLACES=75, PETRI_TRANSITIONS=73} [2023-08-26 18:28:38,673 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -18 predicate places. [2023-08-26 18:28:38,673 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 73 transitions, 558 flow [2023-08-26 18:28:38,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:38,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:38,674 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 18:28:38,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:28:38,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:38,674 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1068130847, now seen corresponding path program 2 times [2023-08-26 18:28:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:38,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156549943] [2023-08-26 18:28:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:40,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:28:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156549943] [2023-08-26 18:28:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156549943] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:28:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879386304] [2023-08-26 18:28:40,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:40,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:28:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:40,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:28:40,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:28:40,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 360 [2023-08-26 18:28:40,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 558 flow. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:40,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:40,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 360 [2023-08-26 18:28:40,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:43,162 INFO L124 PetriNetUnfolderBase]: 15195/21757 cut-off events. [2023-08-26 18:28:43,162 INFO L125 PetriNetUnfolderBase]: For 36017/36017 co-relation queries the response was YES. [2023-08-26 18:28:43,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82790 conditions, 21757 events. 15195/21757 cut-off events. For 36017/36017 co-relation queries the response was YES. Maximal size of possible extension queue 1286. Compared 134882 event pairs, 2297 based on Foata normal form. 52/21533 useless extension candidates. Maximal degree in co-relation 82773. Up to 17585 conditions per place. [2023-08-26 18:28:43,269 INFO L140 encePairwiseOnDemand]: 347/360 looper letters, 115 selfloop transitions, 36 changer transitions 1/153 dead transitions. [2023-08-26 18:28:43,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 153 transitions, 1282 flow [2023-08-26 18:28:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:28:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:28:43,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1438 transitions. [2023-08-26 18:28:43,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3072649572649573 [2023-08-26 18:28:43,273 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1438 transitions. [2023-08-26 18:28:43,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1438 transitions. [2023-08-26 18:28:43,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:43,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1438 transitions. [2023-08-26 18:28:43,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.61538461538461) internal successors, (1438), 13 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:43,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 360.0) internal successors, (5040), 14 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:43,279 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 360.0) internal successors, (5040), 14 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:43,279 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 558 flow. Second operand 13 states and 1438 transitions. [2023-08-26 18:28:43,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 153 transitions, 1282 flow [2023-08-26 18:28:43,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 153 transitions, 1276 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-26 18:28:43,503 INFO L231 Difference]: Finished difference. Result has 93 places, 92 transitions, 877 flow [2023-08-26 18:28:43,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=877, PETRI_PLACES=93, PETRI_TRANSITIONS=92} [2023-08-26 18:28:43,504 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 0 predicate places. [2023-08-26 18:28:43,504 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 877 flow [2023-08-26 18:28:43,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 10 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:43,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:43,504 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 18:28:43,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:28:43,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:43,505 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1702209833, now seen corresponding path program 3 times [2023-08-26 18:28:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612723931] [2023-08-26 18:28:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:44,439 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 18:28:44,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:44,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612723931] [2023-08-26 18:28:44,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612723931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:44,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:44,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 18:28:44,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617148344] [2023-08-26 18:28:44,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:44,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 18:28:44,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:44,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 18:28:44,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-08-26 18:28:44,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 360 [2023-08-26 18:28:44,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 877 flow. Second operand has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:44,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:44,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 360 [2023-08-26 18:28:44,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:47,518 INFO L124 PetriNetUnfolderBase]: 15143/21744 cut-off events. [2023-08-26 18:28:47,518 INFO L125 PetriNetUnfolderBase]: For 51068/51068 co-relation queries the response was YES. [2023-08-26 18:28:47,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89215 conditions, 21744 events. 15143/21744 cut-off events. For 51068/51068 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 136156 event pairs, 1808 based on Foata normal form. 12/21480 useless extension candidates. Maximal degree in co-relation 89191. Up to 14254 conditions per place. [2023-08-26 18:28:47,640 INFO L140 encePairwiseOnDemand]: 350/360 looper letters, 137 selfloop transitions, 51 changer transitions 0/189 dead transitions. [2023-08-26 18:28:47,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 189 transitions, 1826 flow [2023-08-26 18:28:47,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:28:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:28:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1472 transitions. [2023-08-26 18:28:47,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3145299145299145 [2023-08-26 18:28:47,643 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1472 transitions. [2023-08-26 18:28:47,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1472 transitions. [2023-08-26 18:28:47,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:47,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1472 transitions. [2023-08-26 18:28:47,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.23076923076923) internal successors, (1472), 13 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:47,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 360.0) internal successors, (5040), 14 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:47,651 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 360.0) internal successors, (5040), 14 states have internal predecessors, (5040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:47,651 INFO L175 Difference]: Start difference. First operand has 93 places, 92 transitions, 877 flow. Second operand 13 states and 1472 transitions. [2023-08-26 18:28:47,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 189 transitions, 1826 flow [2023-08-26 18:28:48,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 189 transitions, 1806 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-26 18:28:48,096 INFO L231 Difference]: Finished difference. Result has 107 places, 110 transitions, 1236 flow [2023-08-26 18:28:48,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1236, PETRI_PLACES=107, PETRI_TRANSITIONS=110} [2023-08-26 18:28:48,097 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 14 predicate places. [2023-08-26 18:28:48,097 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 110 transitions, 1236 flow [2023-08-26 18:28:48,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:48,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:48,097 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 18:28:48,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:28:48,098 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:48,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -304274721, now seen corresponding path program 1 times [2023-08-26 18:28:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318851719] [2023-08-26 18:28:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:48,234 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 18:28:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318851719] [2023-08-26 18:28:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318851719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:48,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:48,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:28:48,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308476694] [2023-08-26 18:28:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:48,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:28:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:48,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:28:48,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:28:48,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 360 [2023-08-26 18:28:48,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 110 transitions, 1236 flow. Second operand has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:48,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:48,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 360 [2023-08-26 18:28:48,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:50,801 INFO L124 PetriNetUnfolderBase]: 12831/18464 cut-off events. [2023-08-26 18:28:50,801 INFO L125 PetriNetUnfolderBase]: For 65283/65283 co-relation queries the response was YES. [2023-08-26 18:28:50,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82927 conditions, 18464 events. 12831/18464 cut-off events. For 65283/65283 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 112361 event pairs, 4024 based on Foata normal form. 332/18612 useless extension candidates. Maximal degree in co-relation 82898. Up to 5733 conditions per place. [2023-08-26 18:28:50,886 INFO L140 encePairwiseOnDemand]: 346/360 looper letters, 115 selfloop transitions, 37 changer transitions 1/154 dead transitions. [2023-08-26 18:28:50,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 154 transitions, 1895 flow [2023-08-26 18:28:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:28:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:28:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-26 18:28:50,889 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3472222222222222 [2023-08-26 18:28:50,890 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-26 18:28:50,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-26 18:28:50,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:50,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-26 18:28:50,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:50,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:50,893 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:50,893 INFO L175 Difference]: Start difference. First operand has 107 places, 110 transitions, 1236 flow. Second operand 6 states and 750 transitions. [2023-08-26 18:28:50,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 154 transitions, 1895 flow [2023-08-26 18:28:51,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 154 transitions, 1833 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-26 18:28:51,346 INFO L231 Difference]: Finished difference. Result has 109 places, 121 transitions, 1512 flow [2023-08-26 18:28:51,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=1188, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=109, PETRI_TRANSITIONS=121} [2023-08-26 18:28:51,346 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 16 predicate places. [2023-08-26 18:28:51,346 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 121 transitions, 1512 flow [2023-08-26 18:28:51,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:51,347 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 18:28:51,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:28:51,347 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:51,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:51,347 INFO L85 PathProgramCache]: Analyzing trace with hash -195955991, now seen corresponding path program 1 times [2023-08-26 18:28:51,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:51,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860430974] [2023-08-26 18:28:51,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:51,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:51,478 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 18:28:51,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:51,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860430974] [2023-08-26 18:28:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860430974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:51,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:28:51,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882272028] [2023-08-26 18:28:51,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:51,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:28:51,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:28:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:28:51,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 360 [2023-08-26 18:28:51,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 121 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:51,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:51,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 360 [2023-08-26 18:28:51,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:53,125 INFO L124 PetriNetUnfolderBase]: 7967/12173 cut-off events. [2023-08-26 18:28:53,125 INFO L125 PetriNetUnfolderBase]: For 55139/55139 co-relation queries the response was YES. [2023-08-26 18:28:53,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58757 conditions, 12173 events. 7967/12173 cut-off events. For 55139/55139 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 77166 event pairs, 2127 based on Foata normal form. 64/12104 useless extension candidates. Maximal degree in co-relation 58727. Up to 11329 conditions per place. [2023-08-26 18:28:53,200 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 144 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2023-08-26 18:28:53,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 2050 flow [2023-08-26 18:28:53,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:28:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:28:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2023-08-26 18:28:53,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2023-08-26 18:28:53,202 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 465 transitions. [2023-08-26 18:28:53,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 465 transitions. [2023-08-26 18:28:53,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:53,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 465 transitions. [2023-08-26 18:28:53,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 360.0) internal successors, (1440), 4 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,204 INFO L175 Difference]: Start difference. First operand has 109 places, 121 transitions, 1512 flow. Second operand 3 states and 465 transitions. [2023-08-26 18:28:53,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 2050 flow [2023-08-26 18:28:53,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 155 transitions, 2026 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-26 18:28:53,493 INFO L231 Difference]: Finished difference. Result has 109 places, 125 transitions, 1523 flow [2023-08-26 18:28:53,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1523, PETRI_PLACES=109, PETRI_TRANSITIONS=125} [2023-08-26 18:28:53,494 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 16 predicate places. [2023-08-26 18:28:53,494 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 125 transitions, 1523 flow [2023-08-26 18:28:53,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:53,494 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 18:28:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:28:53,495 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:53,495 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:53,495 INFO L85 PathProgramCache]: Analyzing trace with hash -862348996, now seen corresponding path program 1 times [2023-08-26 18:28:53,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:53,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440229786] [2023-08-26 18:28:53,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:53,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:53,624 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 18:28:53,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:53,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440229786] [2023-08-26 18:28:53,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440229786] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:53,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:53,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:53,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689263625] [2023-08-26 18:28:53,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:53,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:53,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:53,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:53,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:53,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 360 [2023-08-26 18:28:53,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 125 transitions, 1523 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:53,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:53,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 360 [2023-08-26 18:28:53,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:54,380 INFO L124 PetriNetUnfolderBase]: 3116/5185 cut-off events. [2023-08-26 18:28:54,380 INFO L125 PetriNetUnfolderBase]: For 21923/21923 co-relation queries the response was YES. [2023-08-26 18:28:54,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26005 conditions, 5185 events. 3116/5185 cut-off events. For 21923/21923 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31586 event pairs, 529 based on Foata normal form. 120/5264 useless extension candidates. Maximal degree in co-relation 25973. Up to 3790 conditions per place. [2023-08-26 18:28:54,407 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 164 selfloop transitions, 9 changer transitions 1/180 dead transitions. [2023-08-26 18:28:54,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 180 transitions, 2270 flow [2023-08-26 18:28:54,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 619 transitions. [2023-08-26 18:28:54,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42986111111111114 [2023-08-26 18:28:54,409 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 619 transitions. [2023-08-26 18:28:54,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 619 transitions. [2023-08-26 18:28:54,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:54,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 619 transitions. [2023-08-26 18:28:54,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,412 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,412 INFO L175 Difference]: Start difference. First operand has 109 places, 125 transitions, 1523 flow. Second operand 4 states and 619 transitions. [2023-08-26 18:28:54,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 180 transitions, 2270 flow [2023-08-26 18:28:54,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 180 transitions, 2257 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 18:28:54,479 INFO L231 Difference]: Finished difference. Result has 112 places, 125 transitions, 1517 flow [2023-08-26 18:28:54,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1517, PETRI_PLACES=112, PETRI_TRANSITIONS=125} [2023-08-26 18:28:54,480 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 19 predicate places. [2023-08-26 18:28:54,480 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 125 transitions, 1517 flow [2023-08-26 18:28:54,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:54,480 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 18:28:54,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:28:54,481 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:54,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:54,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1307084626, now seen corresponding path program 1 times [2023-08-26 18:28:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:54,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462531186] [2023-08-26 18:28:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:54,619 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 18:28:54,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:54,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462531186] [2023-08-26 18:28:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462531186] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:54,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:28:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067507462] [2023-08-26 18:28:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:54,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:54,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:54,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:54,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:54,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 360 [2023-08-26 18:28:54,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 125 transitions, 1517 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:54,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:54,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 360 [2023-08-26 18:28:54,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:55,036 INFO L124 PetriNetUnfolderBase]: 1403/2349 cut-off events. [2023-08-26 18:28:55,036 INFO L125 PetriNetUnfolderBase]: For 8618/8618 co-relation queries the response was YES. [2023-08-26 18:28:55,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11334 conditions, 2349 events. 1403/2349 cut-off events. For 8618/8618 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12494 event pairs, 177 based on Foata normal form. 80/2424 useless extension candidates. Maximal degree in co-relation 11301. Up to 857 conditions per place. [2023-08-26 18:28:55,048 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 133 selfloop transitions, 13 changer transitions 13/163 dead transitions. [2023-08-26 18:28:55,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 163 transitions, 1872 flow [2023-08-26 18:28:55,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:28:55,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:28:55,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2023-08-26 18:28:55,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2023-08-26 18:28:55,050 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2023-08-26 18:28:55,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2023-08-26 18:28:55,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:55,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2023-08-26 18:28:55,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,053 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 360.0) internal successors, (2160), 6 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,053 INFO L175 Difference]: Start difference. First operand has 112 places, 125 transitions, 1517 flow. Second operand 5 states and 770 transitions. [2023-08-26 18:28:55,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 163 transitions, 1872 flow [2023-08-26 18:28:55,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 163 transitions, 1770 flow, removed 17 selfloop flow, removed 9 redundant places. [2023-08-26 18:28:55,068 INFO L231 Difference]: Finished difference. Result has 105 places, 84 transitions, 805 flow [2023-08-26 18:28:55,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=918, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=805, PETRI_PLACES=105, PETRI_TRANSITIONS=84} [2023-08-26 18:28:55,069 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 12 predicate places. [2023-08-26 18:28:55,069 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 84 transitions, 805 flow [2023-08-26 18:28:55,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:55,069 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 18:28:55,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:28:55,069 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:55,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:55,069 INFO L85 PathProgramCache]: Analyzing trace with hash -427847375, now seen corresponding path program 1 times [2023-08-26 18:28:55,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:55,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158381666] [2023-08-26 18:28:55,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:55,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:55,188 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 18:28:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158381666] [2023-08-26 18:28:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158381666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545727593] [2023-08-26 18:28:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:55,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:28:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:28:55,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:28:55,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 360 [2023-08-26 18:28:55,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 84 transitions, 805 flow. Second operand has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:55,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 360 [2023-08-26 18:28:55,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:55,764 INFO L124 PetriNetUnfolderBase]: 2760/4543 cut-off events. [2023-08-26 18:28:55,764 INFO L125 PetriNetUnfolderBase]: For 16381/16381 co-relation queries the response was YES. [2023-08-26 18:28:55,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20743 conditions, 4543 events. 2760/4543 cut-off events. For 16381/16381 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 26423 event pairs, 375 based on Foata normal form. 7/4541 useless extension candidates. Maximal degree in co-relation 20716. Up to 2385 conditions per place. [2023-08-26 18:28:55,785 INFO L140 encePairwiseOnDemand]: 357/360 looper letters, 166 selfloop transitions, 2 changer transitions 12/183 dead transitions. [2023-08-26 18:28:55,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 183 transitions, 2075 flow [2023-08-26 18:28:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:28:55,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:28:55,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 635 transitions. [2023-08-26 18:28:55,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4409722222222222 [2023-08-26 18:28:55,787 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 635 transitions. [2023-08-26 18:28:55,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 635 transitions. [2023-08-26 18:28:55,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:55,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 635 transitions. [2023-08-26 18:28:55,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,791 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 360.0) internal successors, (1800), 5 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,791 INFO L175 Difference]: Start difference. First operand has 105 places, 84 transitions, 805 flow. Second operand 4 states and 635 transitions. [2023-08-26 18:28:55,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 183 transitions, 2075 flow [2023-08-26 18:28:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 183 transitions, 1937 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-08-26 18:28:55,844 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 762 flow [2023-08-26 18:28:55,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=762, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2023-08-26 18:28:55,844 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 13 predicate places. [2023-08-26 18:28:55,844 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 762 flow [2023-08-26 18:28:55,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.5) internal successors, (578), 4 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:55,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:55,845 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 18:28:55,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:28:55,845 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:55,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:55,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1651032729, now seen corresponding path program 2 times [2023-08-26 18:28:55,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:55,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071031539] [2023-08-26 18:28:55,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:55,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:56,103 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 18:28:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071031539] [2023-08-26 18:28:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071031539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:56,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:56,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:28:56,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29012043] [2023-08-26 18:28:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:56,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:28:56,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:56,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:28:56,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:28:56,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 360 [2023-08-26 18:28:56,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 762 flow. Second operand has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:56,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 360 [2023-08-26 18:28:56,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:56,753 INFO L124 PetriNetUnfolderBase]: 2726/4771 cut-off events. [2023-08-26 18:28:56,754 INFO L125 PetriNetUnfolderBase]: For 14580/14598 co-relation queries the response was YES. [2023-08-26 18:28:56,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20799 conditions, 4771 events. 2726/4771 cut-off events. For 14580/14598 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 30197 event pairs, 1283 based on Foata normal form. 11/4695 useless extension candidates. Maximal degree in co-relation 20770. Up to 3431 conditions per place. [2023-08-26 18:28:56,777 INFO L140 encePairwiseOnDemand]: 353/360 looper letters, 121 selfloop transitions, 21 changer transitions 8/154 dead transitions. [2023-08-26 18:28:56,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 154 transitions, 1505 flow [2023-08-26 18:28:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:28:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:28:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2023-08-26 18:28:56,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3958333333333333 [2023-08-26 18:28:56,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2023-08-26 18:28:56,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2023-08-26 18:28:56,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:56,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2023-08-26 18:28:56,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 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 18:28:56,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,782 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,782 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 762 flow. Second operand 6 states and 855 transitions. [2023-08-26 18:28:56,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 154 transitions, 1505 flow [2023-08-26 18:28:56,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 154 transitions, 1497 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 18:28:56,840 INFO L231 Difference]: Finished difference. Result has 113 places, 92 transitions, 871 flow [2023-08-26 18:28:56,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=871, PETRI_PLACES=113, PETRI_TRANSITIONS=92} [2023-08-26 18:28:56,840 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, 20 predicate places. [2023-08-26 18:28:56,841 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 92 transitions, 871 flow [2023-08-26 18:28:56,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:56,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:56,841 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 18:28:56,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:28:56,841 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:56,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:56,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1529859519, now seen corresponding path program 3 times [2023-08-26 18:28:56,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:56,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234434652] [2023-08-26 18:28:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:56,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:28:57,002 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 18:28:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:28:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234434652] [2023-08-26 18:28:57,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234434652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:28:57,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:28:57,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:28:57,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017721938] [2023-08-26 18:28:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:28:57,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:28:57,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:28:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:28:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:28:57,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 360 [2023-08-26 18:28:57,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 92 transitions, 871 flow. Second operand has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:57,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:28:57,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 360 [2023-08-26 18:28:57,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:28:57,516 INFO L124 PetriNetUnfolderBase]: 2251/3659 cut-off events. [2023-08-26 18:28:57,516 INFO L125 PetriNetUnfolderBase]: For 13292/13370 co-relation queries the response was YES. [2023-08-26 18:28:57,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16414 conditions, 3659 events. 2251/3659 cut-off events. For 13292/13370 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 22125 event pairs, 221 based on Foata normal form. 147/3742 useless extension candidates. Maximal degree in co-relation 16382. Up to 1396 conditions per place. [2023-08-26 18:28:57,531 INFO L140 encePairwiseOnDemand]: 354/360 looper letters, 86 selfloop transitions, 17 changer transitions 40/145 dead transitions. [2023-08-26 18:28:57,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 1461 flow [2023-08-26 18:28:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:28:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:28:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 903 transitions. [2023-08-26 18:28:57,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41805555555555557 [2023-08-26 18:28:57,533 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 903 transitions. [2023-08-26 18:28:57,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 903 transitions. [2023-08-26 18:28:57,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:28:57,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 903 transitions. [2023-08-26 18:28:57,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 150.5) internal successors, (903), 6 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:57,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:57,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 360.0) internal successors, (2520), 7 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:57,536 INFO L175 Difference]: Start difference. First operand has 113 places, 92 transitions, 871 flow. Second operand 6 states and 903 transitions. [2023-08-26 18:28:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 1461 flow [2023-08-26 18:28:57,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 145 transitions, 1228 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-08-26 18:28:57,629 INFO L231 Difference]: Finished difference. Result has 90 places, 56 transitions, 406 flow [2023-08-26 18:28:57,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=360, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=90, PETRI_TRANSITIONS=56} [2023-08-26 18:28:57,629 INFO L281 CegarLoopForPetriNet]: 93 programPoint places, -3 predicate places. [2023-08-26 18:28:57,629 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 56 transitions, 406 flow [2023-08-26 18:28:57,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.5) internal successors, (849), 6 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:28:57,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:28:57,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:57,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:28:57,630 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 84 more)] === [2023-08-26 18:28:57,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:28:57,630 INFO L85 PathProgramCache]: Analyzing trace with hash -187016492, now seen corresponding path program 1 times [2023-08-26 18:28:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:28:57,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742729991] [2023-08-26 18:28:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:28:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:28:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:28:57,714 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:28:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:28:57,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:28:57,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:28:57,836 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONASSERT (86 of 87 remaining) [2023-08-26 18:28:57,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 87 remaining) [2023-08-26 18:28:57,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 87 remaining) [2023-08-26 18:28:57,839 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 87 remaining) [2023-08-26 18:28:57,840 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 87 remaining) [2023-08-26 18:28:57,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 87 remaining) [2023-08-26 18:28:57,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 87 remaining) [2023-08-26 18:28:57,841 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 87 remaining) [2023-08-26 18:28:57,842 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 87 remaining) [2023-08-26 18:28:57,843 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 87 remaining) [2023-08-26 18:28:57,844 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 87 remaining) [2023-08-26 18:28:57,845 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 87 remaining) [2023-08-26 18:28:57,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 87 remaining) [2023-08-26 18:28:57,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 87 remaining) [2023-08-26 18:28:57,846 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 87 remaining) [2023-08-26 18:28:57,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 18:28:57,846 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:28:57,852 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:28:57,852 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:28:57,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:28:57 BasicIcfg [2023-08-26 18:28:57,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:28:57,936 INFO L158 Benchmark]: Toolchain (without parser) took 67028.30ms. Allocated memory was 379.6MB in the beginning and 6.6GB in the end (delta: 6.3GB). Free memory was 354.4MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 18:28:57,936 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 379.6MB. Free memory was 356.5MB in the beginning and 356.4MB in the end (delta: 87.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:28:57,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.88ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 328.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:28:57,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.70ms. Allocated memory is still 379.6MB. Free memory was 328.9MB in the beginning and 326.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:28:57,937 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 379.6MB. Free memory was 326.3MB in the beginning and 324.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:28:57,937 INFO L158 Benchmark]: RCFGBuilder took 1133.11ms. Allocated memory was 379.6MB in the beginning and 480.2MB in the end (delta: 100.7MB). Free memory was 324.0MB in the beginning and 373.0MB in the end (delta: -49.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.0GB. [2023-08-26 18:28:57,937 INFO L158 Benchmark]: TraceAbstraction took 65411.04ms. Allocated memory was 480.2MB in the beginning and 6.6GB in the end (delta: 6.2GB). Free memory was 372.0MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 2.4GB. Max. memory is 16.0GB. [2023-08-26 18:28:57,938 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.10ms. Allocated memory is still 379.6MB. Free memory was 356.5MB in the beginning and 356.4MB in the end (delta: 87.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 394.88ms. Allocated memory is still 379.6MB. Free memory was 354.1MB in the beginning and 328.9MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 59.70ms. Allocated memory is still 379.6MB. Free memory was 328.9MB in the beginning and 326.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 379.6MB. Free memory was 326.3MB in the beginning and 324.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1133.11ms. Allocated memory was 379.6MB in the beginning and 480.2MB in the end (delta: 100.7MB). Free memory was 324.0MB in the beginning and 373.0MB in the end (delta: -49.0MB). Peak memory consumption was 54.4MB. Max. memory is 16.0GB. * TraceAbstraction took 65411.04ms. Allocated memory was 480.2MB in the beginning and 6.6GB in the end (delta: 6.2GB). Free memory was 372.0MB in the beginning and 4.1GB in the end (delta: -3.7GB). Peak memory consumption was 2.4GB. 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: 12.1s, 201 PlacesBefore, 93 PlacesAfterwards, 191 TransitionsBefore, 82 TransitionsAfterwards, 8638 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 165 TotalNumberOfCompositions, 39131 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12537, independent: 11902, independent conditional: 0, independent unconditional: 11902, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3699, independent: 3600, independent conditional: 0, independent unconditional: 3600, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12537, independent: 8302, independent conditional: 0, independent unconditional: 8302, dependent: 536, dependent conditional: 0, dependent unconditional: 536, unknown: 3699, unknown conditional: 0, unknown unconditional: 3699] , Statistics on independence cache: Total cache size (in pairs): 464, Positive cache size: 415, Positive conditional cache size: 0, Positive unconditional cache size: 415, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, 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_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p2_EBX = 0; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L744] 0 _Bool y$flush_delayed; [L745] 0 int y$mem_tmp; [L746] 0 _Bool y$r_buff0_thd0; [L747] 0 _Bool y$r_buff0_thd1; [L748] 0 _Bool y$r_buff0_thd2; [L749] 0 _Bool y$r_buff0_thd3; [L750] 0 _Bool y$r_buff0_thd4; [L751] 0 _Bool y$r_buff1_thd0; [L752] 0 _Bool y$r_buff1_thd1; [L753] 0 _Bool y$r_buff1_thd2; [L754] 0 _Bool y$r_buff1_thd3; [L755] 0 _Bool y$r_buff1_thd4; [L756] 0 _Bool y$read_delayed; [L757] 0 int *y$read_delayed_var; [L758] 0 int y$w_buff0; [L759] 0 _Bool y$w_buff0_used; [L760] 0 int y$w_buff1; [L761] 0 _Bool y$w_buff1_used; [L762] 0 _Bool weak$$choice0; [L763] 0 _Bool weak$$choice1; [L764] 0 _Bool weak$$choice2; [L864] 0 pthread_t t2417; [L865] FCALL, FORK 0 pthread_create(&t2417, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2417, ((void *)0), P0, ((void *)0))=10, t2417={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}] [L866] 0 pthread_t t2418; [L867] FCALL, FORK 0 pthread_create(&t2418, ((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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2418, ((void *)0), P1, ((void *)0))=11, t2417={7:0}, t2418={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}] [L768] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 1 y$flush_delayed = weak$$choice2 [L771] EXPR 1 \read(y) [L771] 1 y$mem_tmp = y [L772] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L773] 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)))) [L773] EXPR 1 \read(y) [L773] 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)))) [L773] 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)))) [L774] 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)))) [L775] 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)))) [L776] 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)))) [L777] 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)))) [L778] 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)))) [L779] 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)))) [L780] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L781] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L782] EXPR 1 \read(y) [L782] 1 __unbuffered_p0_EAX = y [L783] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L783] 1 y = y$flush_delayed ? y$mem_tmp : y [L784] 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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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}] [L787] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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}] [L799] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$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}] [L868] 0 pthread_t t2419; [L869] FCALL, FORK 0 pthread_create(&t2419, ((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=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2419, ((void *)0), P2, ((void *)0))=12, t2417={7:0}, t2418={8:0}, t2419={9: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}] [L870] 0 pthread_t t2420; [L811] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=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}] [L814] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 3 y$flush_delayed = weak$$choice2 [L817] EXPR 3 \read(y) [L817] 3 y$mem_tmp = y [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] EXPR 3 \read(y) [L818] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L818] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L819] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L820] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L821] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L822] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L824] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 \read(y) [L825] 3 __unbuffered_p2_EBX = y [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] EXPR 3 \read(y) [L826] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L826] 3 y = y$flush_delayed ? y$mem_tmp : y [L827] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$$choice1=1, weak$$choice2=0, 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}] [L871] FCALL, FORK 0 pthread_create(&t2420, ((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=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, pthread_create(&t2420, ((void *)0), P3, ((void *)0))=13, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=0, 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}] [L839] 4 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=0, 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}] [L842] 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) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] EXPR 4 \read(y) [L842] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L842] 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) [L842] 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) [L843] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L844] 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 [L845] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L846] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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$$choice1=1, weak$$choice2=0, 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}] [L792] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L832] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L834] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 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) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] EXPR 0 \read(y) [L877] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L877] 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) [L877] 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) [L878] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L879] 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 [L880] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L881] 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_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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, t2417={7:0}, t2418={8:0}, t2419={9:0}, t2420={5:0}, weak$$choice1=1, weak$$choice2=0, 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}] [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L888] 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", "safe027_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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, 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=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}] - 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: 869]: 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: 865]: 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: 867]: 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: 871]: 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: 65.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 915 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 915 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2571 IncrementalHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 224 mSolverCounterUnsat, 12 mSDtfsCounter, 2571 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1523occurred in iteration=15, InterpolantAutomatonStates: 104, 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.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 332 NumberOfCodeBlocks, 332 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 2703 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 18:28:57,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...