/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:09:43,149 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:09:43,266 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:09:43,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:09:43,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:09:43,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:09:43,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:09:43,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:09:43,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:09:43,309 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:09:43,310 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:09:43,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:09:43,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:09:43,311 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:09:43,311 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:09:43,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:09:43,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:09:43,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:09:43,312 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:09:43,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:09:43,313 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:09:43,314 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:09:43,314 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:09:43,314 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:09:43,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:09:43,315 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:09:43,315 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:09:43,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:43,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:09:43,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:09:43,317 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:09:43,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:09:43,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:09:43,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:09:43,686 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:09:43,688 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:09:43,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2023-08-26 12:09:45,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:09:45,780 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:09:45,781 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.oepc.i [2023-08-26 12:09:45,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5de179d0/4a0952140cd648aca46a3e09777435fb/FLAG3ac4438ae [2023-08-26 12:09:45,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5de179d0/4a0952140cd648aca46a3e09777435fb [2023-08-26 12:09:45,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:09:45,824 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:09:45,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:45,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:09:45,831 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:09:45,832 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:45" (1/1) ... [2023-08-26 12:09:45,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb83e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:45, skipping insertion in model container [2023-08-26 12:09:45,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:45" (1/1) ... [2023-08-26 12:09:45,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:09:46,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:46,346 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:09:46,363 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:46,365 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:46,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:46,523 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:46,523 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:46,541 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:09:46,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46 WrapperNode [2023-08-26 12:09:46,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:46,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:46,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:09:46,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:09:46,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,605 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-26 12:09:46,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:46,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:09:46,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:09:46,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:09:46,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,657 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,682 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,687 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:09:46,688 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:09:46,688 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:09:46,688 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:09:46,689 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (1/1) ... [2023-08-26 12:09:46,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:46,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:09:46,735 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:09:46,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:09:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:09:46,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:09:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:09:46,830 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:09:46,830 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:09:46,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:09:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:09:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:09:46,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:09:46,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:09:46,834 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:09:47,149 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:09:47,151 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:09:47,928 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:09:48,884 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:09:48,884 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:09:48,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:48 BoogieIcfgContainer [2023-08-26 12:09:48,887 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:09:48,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:09:48,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:09:48,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:09:48,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:09:45" (1/3) ... [2023-08-26 12:09:48,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a965bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:48, skipping insertion in model container [2023-08-26 12:09:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:46" (2/3) ... [2023-08-26 12:09:48,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a965bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:48, skipping insertion in model container [2023-08-26 12:09:48,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:48" (3/3) ... [2023-08-26 12:09:48,894 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.oepc.i [2023-08-26 12:09:48,911 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:09:48,912 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-08-26 12:09:48,912 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:09:49,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:09:49,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 192 transitions, 399 flow [2023-08-26 12:09:49,295 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-08-26 12:09:49,296 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 395 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2023-08-26 12:09:49,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 192 transitions, 399 flow [2023-08-26 12:09:49,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 189 transitions, 387 flow [2023-08-26 12:09:49,313 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:09:49,347 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 189 transitions, 387 flow [2023-08-26 12:09:49,349 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 189 transitions, 387 flow [2023-08-26 12:09:49,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 189 transitions, 387 flow [2023-08-26 12:09:49,420 INFO L124 PetriNetUnfolderBase]: 3/189 cut-off events. [2023-08-26 12:09:49,420 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:49,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 3/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 390 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 133. Up to 2 conditions per place. [2023-08-26 12:09:49,426 INFO L119 LiptonReduction]: Number of co-enabled transitions 9468 [2023-08-26 12:10:09,841 INFO L134 LiptonReduction]: Checked pairs total: 49348 [2023-08-26 12:10:09,841 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-08-26 12:10:09,853 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:10:09,858 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;@3d3f0751, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:10:09,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 108 error locations. [2023-08-26 12:10:09,860 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:10:09,860 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:10:09,860 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:09,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:09,861 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:10:09,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:09,865 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1367, now seen corresponding path program 1 times [2023-08-26 12:10:09,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:09,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893281478] [2023-08-26 12:10:09,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:09,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:09,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:09,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893281478] [2023-08-26 12:10:09,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893281478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:09,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:09,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:10:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590239109] [2023-08-26 12:10:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:10,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:10:10,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:10,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:10:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:10:10,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 350 [2023-08-26 12:10:10,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 197 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:10,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:10,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 350 [2023-08-26 12:10:10,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:14,187 INFO L124 PetriNetUnfolderBase]: 16294/23006 cut-off events. [2023-08-26 12:10:14,187 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 12:10:14,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45933 conditions, 23006 events. 16294/23006 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 159960 event pairs, 16294 based on Foata normal form. 0/9396 useless extension candidates. Maximal degree in co-relation 45922. Up to 22831 conditions per place. [2023-08-26 12:10:14,336 INFO L140 encePairwiseOnDemand]: 307/350 looper letters, 43 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2023-08-26 12:10:14,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 193 flow [2023-08-26 12:10:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:10:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:10:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 336 transitions. [2023-08-26 12:10:14,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-08-26 12:10:14,352 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 336 transitions. [2023-08-26 12:10:14,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 336 transitions. [2023-08-26 12:10:14,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:14,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 336 transitions. [2023-08-26 12:10:14,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.0) internal successors, (336), 2 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,364 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 350.0) internal successors, (1050), 3 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,365 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 197 flow. Second operand 2 states and 336 transitions. [2023-08-26 12:10:14,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 193 flow [2023-08-26 12:10:14,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:14,372 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 104 flow [2023-08-26 12:10:14,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-26 12:10:14,378 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -45 predicate places. [2023-08-26 12:10:14,379 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 104 flow [2023-08-26 12:10:14,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:14,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:10:14,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:14,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1350377, now seen corresponding path program 1 times [2023-08-26 12:10:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:14,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550036471] [2023-08-26 12:10:14,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:14,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:14,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550036471] [2023-08-26 12:10:14,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550036471] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:14,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:14,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417058803] [2023-08-26 12:10:14,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:14,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:14,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:14,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:14,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:14,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 350 [2023-08-26 12:10:14,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:14,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:14,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 350 [2023-08-26 12:10:14,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:17,044 INFO L124 PetriNetUnfolderBase]: 9290/13144 cut-off events. [2023-08-26 12:10:17,044 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:17,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26364 conditions, 13144 events. 9290/13144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 74472 event pairs, 9290 based on Foata normal form. 0/7348 useless extension candidates. Maximal degree in co-relation 26361. Up to 13143 conditions per place. [2023-08-26 12:10:17,168 INFO L140 encePairwiseOnDemand]: 339/350 looper letters, 37 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-08-26 12:10:17,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 160 flow [2023-08-26 12:10:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:17,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 12:10:17,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3457142857142857 [2023-08-26 12:10:17,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 12:10:17,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 12:10:17,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:17,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 12:10:17,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,178 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,178 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 104 flow. Second operand 3 states and 363 transitions. [2023-08-26 12:10:17,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 160 flow [2023-08-26 12:10:17,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:10:17,183 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 86 flow [2023-08-26 12:10:17,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-26 12:10:17,184 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2023-08-26 12:10:17,184 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 86 flow [2023-08-26 12:10:17,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:17,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:17,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:10:17,192 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:17,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:17,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1350376, now seen corresponding path program 1 times [2023-08-26 12:10:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522352536] [2023-08-26 12:10:17,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:17,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522352536] [2023-08-26 12:10:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522352536] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:17,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:17,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127802587] [2023-08-26 12:10:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:17,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:17,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:17,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 350 [2023-08-26 12:10:17,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:17,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:17,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 350 [2023-08-26 12:10:17,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:18,910 INFO L124 PetriNetUnfolderBase]: 3992/6226 cut-off events. [2023-08-26 12:10:18,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:18,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12419 conditions, 6226 events. 3992/6226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 38200 event pairs, 2403 based on Foata normal form. 0/5076 useless extension candidates. Maximal degree in co-relation 12415. Up to 3571 conditions per place. [2023-08-26 12:10:18,939 INFO L140 encePairwiseOnDemand]: 329/350 looper letters, 37 selfloop transitions, 10 changer transitions 0/48 dead transitions. [2023-08-26 12:10:18,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 198 flow [2023-08-26 12:10:18,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:18,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 12:10:18,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3438095238095238 [2023-08-26 12:10:18,941 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 12:10:18,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 12:10:18,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:18,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 12:10:18,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,946 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,946 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 86 flow. Second operand 3 states and 361 transitions. [2023-08-26 12:10:18,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 198 flow [2023-08-26 12:10:18,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 48 transitions, 197 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:18,947 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 167 flow [2023-08-26 12:10:18,948 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-26 12:10:18,948 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -53 predicate places. [2023-08-26 12:10:18,949 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 167 flow [2023-08-26 12:10:18,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:18,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:18,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:18,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:10:18,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:18,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:18,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1333264218, now seen corresponding path program 1 times [2023-08-26 12:10:18,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:18,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783323026] [2023-08-26 12:10:18,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:18,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783323026] [2023-08-26 12:10:19,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783323026] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:19,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360711632] [2023-08-26 12:10:19,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:19,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 350 [2023-08-26 12:10:19,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 350 [2023-08-26 12:10:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:20,407 INFO L124 PetriNetUnfolderBase]: 3585/5958 cut-off events. [2023-08-26 12:10:20,407 INFO L125 PetriNetUnfolderBase]: For 2396/2519 co-relation queries the response was YES. [2023-08-26 12:10:20,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16227 conditions, 5958 events. 3585/5958 cut-off events. For 2396/2519 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 40775 event pairs, 1405 based on Foata normal form. 0/5514 useless extension candidates. Maximal degree in co-relation 16222. Up to 3285 conditions per place. [2023-08-26 12:10:20,450 INFO L140 encePairwiseOnDemand]: 346/350 looper letters, 63 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-26 12:10:20,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 405 flow [2023-08-26 12:10:20,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-26 12:10:20,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4085714285714286 [2023-08-26 12:10:20,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-26 12:10:20,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-26 12:10:20,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:20,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-26 12:10:20,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,476 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,476 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 167 flow. Second operand 3 states and 429 transitions. [2023-08-26 12:10:20,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 405 flow [2023-08-26 12:10:20,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 73 transitions, 373 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:20,506 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:20,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:10:20,507 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -52 predicate places. [2023-08-26 12:10:20,507 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 160 flow [2023-08-26 12:10:20,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:20,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:20,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:10:20,508 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:20,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1333263986, now seen corresponding path program 1 times [2023-08-26 12:10:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:20,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941480074] [2023-08-26 12:10:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:20,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:20,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941480074] [2023-08-26 12:10:20,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941480074] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:20,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:20,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:20,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713521698] [2023-08-26 12:10:20,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:20,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:20,621 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 350 [2023-08-26 12:10:20,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:20,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:20,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 350 [2023-08-26 12:10:20,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:21,851 INFO L124 PetriNetUnfolderBase]: 4768/7453 cut-off events. [2023-08-26 12:10:21,851 INFO L125 PetriNetUnfolderBase]: For 2349/2426 co-relation queries the response was YES. [2023-08-26 12:10:21,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20099 conditions, 7453 events. 4768/7453 cut-off events. For 2349/2426 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 46895 event pairs, 1663 based on Foata normal form. 9/6356 useless extension candidates. Maximal degree in co-relation 20093. Up to 6275 conditions per place. [2023-08-26 12:10:21,886 INFO L140 encePairwiseOnDemand]: 346/350 looper letters, 64 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2023-08-26 12:10:21,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 73 transitions, 396 flow [2023-08-26 12:10:21,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:21,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-26 12:10:21,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40285714285714286 [2023-08-26 12:10:21,910 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-26 12:10:21,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-26 12:10:21,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:21,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-26 12:10:21,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,914 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 160 flow. Second operand 3 states and 423 transitions. [2023-08-26 12:10:21,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 73 transitions, 396 flow [2023-08-26 12:10:21,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 73 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:21,917 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 173 flow [2023-08-26 12:10:21,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-26 12:10:21,919 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -51 predicate places. [2023-08-26 12:10:21,919 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 173 flow [2023-08-26 12:10:21,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:21,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:21,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:21,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:10:21,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:21,921 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:21,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1579623327, now seen corresponding path program 1 times [2023-08-26 12:10:21,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:21,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251630346] [2023-08-26 12:10:21,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:21,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:22,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:22,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251630346] [2023-08-26 12:10:22,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251630346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:22,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:22,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762683416] [2023-08-26 12:10:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:22,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:22,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:22,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 350 [2023-08-26 12:10:22,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:22,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:22,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 350 [2023-08-26 12:10:22,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:23,340 INFO L124 PetriNetUnfolderBase]: 4651/7267 cut-off events. [2023-08-26 12:10:23,341 INFO L125 PetriNetUnfolderBase]: For 1147/1147 co-relation queries the response was YES. [2023-08-26 12:10:23,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20542 conditions, 7267 events. 4651/7267 cut-off events. For 1147/1147 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 44668 event pairs, 1954 based on Foata normal form. 0/6178 useless extension candidates. Maximal degree in co-relation 20535. Up to 4798 conditions per place. [2023-08-26 12:10:23,390 INFO L140 encePairwiseOnDemand]: 348/350 looper letters, 76 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2023-08-26 12:10:23,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 80 transitions, 448 flow [2023-08-26 12:10:23,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:23,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 12:10:23,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3457142857142857 [2023-08-26 12:10:23,392 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 12:10:23,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 12:10:23,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:23,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 12:10:23,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,397 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,397 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 173 flow. Second operand 3 states and 363 transitions. [2023-08-26 12:10:23,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 80 transitions, 448 flow [2023-08-26 12:10:23,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 444 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:23,400 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 170 flow [2023-08-26 12:10:23,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-08-26 12:10:23,401 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -51 predicate places. [2023-08-26 12:10:23,402 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 170 flow [2023-08-26 12:10:23,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:23,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:23,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:10:23,403 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:23,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1618488498, now seen corresponding path program 1 times [2023-08-26 12:10:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579129710] [2023-08-26 12:10:23,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:23,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:23,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:23,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579129710] [2023-08-26 12:10:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579129710] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:23,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526658585] [2023-08-26 12:10:23,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:23,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:23,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:23,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:23,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:23,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 350 [2023-08-26 12:10:23,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:23,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 350 [2023-08-26 12:10:23,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:25,589 INFO L124 PetriNetUnfolderBase]: 7022/11066 cut-off events. [2023-08-26 12:10:25,589 INFO L125 PetriNetUnfolderBase]: For 2415/2415 co-relation queries the response was YES. [2023-08-26 12:10:25,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31003 conditions, 11066 events. 7022/11066 cut-off events. For 2415/2415 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 73429 event pairs, 3297 based on Foata normal form. 70/9744 useless extension candidates. Maximal degree in co-relation 30996. Up to 6123 conditions per place. [2023-08-26 12:10:25,660 INFO L140 encePairwiseOnDemand]: 345/350 looper letters, 75 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-26 12:10:25,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 458 flow [2023-08-26 12:10:25,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 480 transitions. [2023-08-26 12:10:25,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2023-08-26 12:10:25,662 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 480 transitions. [2023-08-26 12:10:25,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 480 transitions. [2023-08-26 12:10:25,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:25,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 480 transitions. [2023-08-26 12:10:25,664 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,666 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,667 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,667 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 170 flow. Second operand 4 states and 480 transitions. [2023-08-26 12:10:25,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 458 flow [2023-08-26 12:10:25,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:25,670 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 192 flow [2023-08-26 12:10:25,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-26 12:10:25,671 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -48 predicate places. [2023-08-26 12:10:25,671 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 192 flow [2023-08-26 12:10:25,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:25,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:25,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:10:25,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:25,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:25,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1940212164, now seen corresponding path program 2 times [2023-08-26 12:10:25,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510586509] [2023-08-26 12:10:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:25,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:25,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:25,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510586509] [2023-08-26 12:10:25,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510586509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:25,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:25,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52514176] [2023-08-26 12:10:25,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:25,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:25,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:25,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:25,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:25,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 350 [2023-08-26 12:10:25,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 192 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:25,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:25,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 350 [2023-08-26 12:10:25,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:27,128 INFO L124 PetriNetUnfolderBase]: 6880/10854 cut-off events. [2023-08-26 12:10:27,129 INFO L125 PetriNetUnfolderBase]: For 3562/3562 co-relation queries the response was YES. [2023-08-26 12:10:27,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30971 conditions, 10854 events. 6880/10854 cut-off events. For 3562/3562 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 71841 event pairs, 3483 based on Foata normal form. 70/9531 useless extension candidates. Maximal degree in co-relation 30963. Up to 8368 conditions per place. [2023-08-26 12:10:27,181 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 75 selfloop transitions, 3 changer transitions 0/80 dead transitions. [2023-08-26 12:10:27,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 80 transitions, 464 flow [2023-08-26 12:10:27,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:27,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-26 12:10:27,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3414285714285714 [2023-08-26 12:10:27,184 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-26 12:10:27,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-26 12:10:27,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:27,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-26 12:10:27,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,187 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,188 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 192 flow. Second operand 4 states and 478 transitions. [2023-08-26 12:10:27,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 80 transitions, 464 flow [2023-08-26 12:10:27,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 80 transitions, 455 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:27,190 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 183 flow [2023-08-26 12:10:27,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2023-08-26 12:10:27,191 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -49 predicate places. [2023-08-26 12:10:27,191 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 183 flow [2023-08-26 12:10:27,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:27,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:27,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:10:27,191 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:27,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:27,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1678982160, now seen corresponding path program 1 times [2023-08-26 12:10:27,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:27,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367236561] [2023-08-26 12:10:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:27,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:27,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367236561] [2023-08-26 12:10:27,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367236561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:27,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:27,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:27,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407964374] [2023-08-26 12:10:27,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:27,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:10:27,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:27,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:10:27,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:10:27,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 350 [2023-08-26 12:10:27,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 183 flow. Second operand has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:27,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 350 [2023-08-26 12:10:27,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:29,288 INFO L124 PetriNetUnfolderBase]: 6608/10527 cut-off events. [2023-08-26 12:10:29,288 INFO L125 PetriNetUnfolderBase]: For 3236/3236 co-relation queries the response was YES. [2023-08-26 12:10:29,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30226 conditions, 10527 events. 6608/10527 cut-off events. For 3236/3236 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 70146 event pairs, 2156 based on Foata normal form. 22/9157 useless extension candidates. Maximal degree in co-relation 30219. Up to 9140 conditions per place. [2023-08-26 12:10:29,328 INFO L140 encePairwiseOnDemand]: 342/350 looper letters, 81 selfloop transitions, 19 changer transitions 0/102 dead transitions. [2023-08-26 12:10:29,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 624 flow [2023-08-26 12:10:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 705 transitions. [2023-08-26 12:10:29,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28775510204081634 [2023-08-26 12:10:29,330 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 705 transitions. [2023-08-26 12:10:29,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 705 transitions. [2023-08-26 12:10:29,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:29,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 705 transitions. [2023-08-26 12:10:29,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 100.71428571428571) internal successors, (705), 7 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,336 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 183 flow. Second operand 7 states and 705 transitions. [2023-08-26 12:10:29,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 624 flow [2023-08-26 12:10:29,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 102 transitions, 613 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:29,339 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 318 flow [2023-08-26 12:10:29,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2023-08-26 12:10:29,339 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -42 predicate places. [2023-08-26 12:10:29,340 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 318 flow [2023-08-26 12:10:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.71428571428571) internal successors, (642), 7 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:29,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:29,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:10:29,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:29,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash 766911449, now seen corresponding path program 1 times [2023-08-26 12:10:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651087434] [2023-08-26 12:10:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:29,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651087434] [2023-08-26 12:10:29,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651087434] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220192010] [2023-08-26 12:10:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:29,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:29,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:29,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:29,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 350 [2023-08-26 12:10:29,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:29,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 350 [2023-08-26 12:10:29,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:31,159 INFO L124 PetriNetUnfolderBase]: 8506/13388 cut-off events. [2023-08-26 12:10:31,159 INFO L125 PetriNetUnfolderBase]: For 5030/5030 co-relation queries the response was YES. [2023-08-26 12:10:31,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41945 conditions, 13388 events. 8506/13388 cut-off events. For 5030/5030 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 90829 event pairs, 4790 based on Foata normal form. 35/11785 useless extension candidates. Maximal degree in co-relation 41935. Up to 10855 conditions per place. [2023-08-26 12:10:31,216 INFO L140 encePairwiseOnDemand]: 339/350 looper letters, 69 selfloop transitions, 22 changer transitions 0/93 dead transitions. [2023-08-26 12:10:31,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 93 transitions, 634 flow [2023-08-26 12:10:31,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:31,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 489 transitions. [2023-08-26 12:10:31,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3492857142857143 [2023-08-26 12:10:31,218 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 489 transitions. [2023-08-26 12:10:31,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 489 transitions. [2023-08-26 12:10:31,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:31,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 489 transitions. [2023-08-26 12:10:31,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,222 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,222 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 318 flow. Second operand 4 states and 489 transitions. [2023-08-26 12:10:31,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 93 transitions, 634 flow [2023-08-26 12:10:31,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 93 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:31,253 INFO L231 Difference]: Finished difference. Result has 63 places, 75 transitions, 466 flow [2023-08-26 12:10:31,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=466, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2023-08-26 12:10:31,254 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -39 predicate places. [2023-08-26 12:10:31,254 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 466 flow [2023-08-26 12:10:31,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:31,255 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:10:31,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:31,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:31,255 INFO L85 PathProgramCache]: Analyzing trace with hash 509001555, now seen corresponding path program 2 times [2023-08-26 12:10:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365973255] [2023-08-26 12:10:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:31,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365973255] [2023-08-26 12:10:31,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365973255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:31,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:31,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:31,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510237243] [2023-08-26 12:10:31,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:31,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:31,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:31,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 350 [2023-08-26 12:10:31,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 466 flow. Second operand has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:31,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 350 [2023-08-26 12:10:31,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:34,725 INFO L124 PetriNetUnfolderBase]: 13685/21754 cut-off events. [2023-08-26 12:10:34,725 INFO L125 PetriNetUnfolderBase]: For 15321/15321 co-relation queries the response was YES. [2023-08-26 12:10:34,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75292 conditions, 21754 events. 13685/21754 cut-off events. For 15321/15321 co-relation queries the response was YES. Maximal size of possible extension queue 1530. Compared 165216 event pairs, 5631 based on Foata normal form. 119/20584 useless extension candidates. Maximal degree in co-relation 75280. Up to 10376 conditions per place. [2023-08-26 12:10:34,974 INFO L140 encePairwiseOnDemand]: 341/350 looper letters, 105 selfloop transitions, 29 changer transitions 0/136 dead transitions. [2023-08-26 12:10:34,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 136 transitions, 1044 flow [2023-08-26 12:10:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:10:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:10:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions. [2023-08-26 12:10:34,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35828571428571426 [2023-08-26 12:10:34,977 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions. [2023-08-26 12:10:34,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions. [2023-08-26 12:10:34,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:34,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions. [2023-08-26 12:10:34,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:34,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:34,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:34,982 INFO L175 Difference]: Start difference. First operand has 63 places, 75 transitions, 466 flow. Second operand 5 states and 627 transitions. [2023-08-26 12:10:34,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 136 transitions, 1044 flow [2023-08-26 12:10:35,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 136 transitions, 1017 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:35,181 INFO L231 Difference]: Finished difference. Result has 67 places, 86 transitions, 624 flow [2023-08-26 12:10:35,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=624, PETRI_PLACES=67, PETRI_TRANSITIONS=86} [2023-08-26 12:10:35,181 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -35 predicate places. [2023-08-26 12:10:35,181 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 86 transitions, 624 flow [2023-08-26 12:10:35,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.6) internal successors, (558), 5 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:35,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:35,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:10:35,182 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:35,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:35,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1692370755, now seen corresponding path program 3 times [2023-08-26 12:10:35,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:35,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907835633] [2023-08-26 12:10:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:35,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:35,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907835633] [2023-08-26 12:10:35,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907835633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:35,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:35,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:10:35,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244704382] [2023-08-26 12:10:35,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:35,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:10:35,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:35,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:10:35,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:10:35,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 350 [2023-08-26 12:10:35,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 86 transitions, 624 flow. Second operand has 9 states, 9 states have (on average 92.44444444444444) internal successors, (832), 9 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:35,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 350 [2023-08-26 12:10:35,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:40,326 INFO L124 PetriNetUnfolderBase]: 13746/22224 cut-off events. [2023-08-26 12:10:40,326 INFO L125 PetriNetUnfolderBase]: For 26042/26042 co-relation queries the response was YES. [2023-08-26 12:10:40,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82736 conditions, 22224 events. 13746/22224 cut-off events. For 26042/26042 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 170957 event pairs, 2637 based on Foata normal form. 42/20952 useless extension candidates. Maximal degree in co-relation 82722. Up to 8876 conditions per place. [2023-08-26 12:10:40,537 INFO L140 encePairwiseOnDemand]: 339/350 looper letters, 175 selfloop transitions, 85 changer transitions 0/262 dead transitions. [2023-08-26 12:10:40,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 262 transitions, 2256 flow [2023-08-26 12:10:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 12:10:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 12:10:40,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1343 transitions. [2023-08-26 12:10:40,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29516483516483516 [2023-08-26 12:10:40,541 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1343 transitions. [2023-08-26 12:10:40,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1343 transitions. [2023-08-26 12:10:40,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:40,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1343 transitions. [2023-08-26 12:10:40,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 103.3076923076923) internal successors, (1343), 13 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 350.0) internal successors, (4900), 14 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,551 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 350.0) internal successors, (4900), 14 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,551 INFO L175 Difference]: Start difference. First operand has 67 places, 86 transitions, 624 flow. Second operand 13 states and 1343 transitions. [2023-08-26 12:10:40,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 262 transitions, 2256 flow [2023-08-26 12:10:40,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 262 transitions, 2243 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:40,766 INFO L231 Difference]: Finished difference. Result has 82 places, 137 transitions, 1356 flow [2023-08-26 12:10:40,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1356, PETRI_PLACES=82, PETRI_TRANSITIONS=137} [2023-08-26 12:10:40,767 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -20 predicate places. [2023-08-26 12:10:40,767 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 137 transitions, 1356 flow [2023-08-26 12:10:40,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 92.44444444444444) internal successors, (832), 9 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:40,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:40,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:10:40,768 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:40,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:40,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1366434214, now seen corresponding path program 1 times [2023-08-26 12:10:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107721871] [2023-08-26 12:10:40,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:40,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:40,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107721871] [2023-08-26 12:10:40,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107721871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:40,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:40,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:40,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497568811] [2023-08-26 12:10:40,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:40,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:40,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:40,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:40,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:40,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 350 [2023-08-26 12:10:40,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 137 transitions, 1356 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:40,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 350 [2023-08-26 12:10:40,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:43,342 INFO L124 PetriNetUnfolderBase]: 10799/17711 cut-off events. [2023-08-26 12:10:43,342 INFO L125 PetriNetUnfolderBase]: For 46628/46628 co-relation queries the response was YES. [2023-08-26 12:10:43,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77141 conditions, 17711 events. 10799/17711 cut-off events. For 46628/46628 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 133608 event pairs, 3874 based on Foata normal form. 429/17263 useless extension candidates. Maximal degree in co-relation 77123. Up to 7032 conditions per place. [2023-08-26 12:10:43,497 INFO L140 encePairwiseOnDemand]: 332/350 looper letters, 127 selfloop transitions, 41 changer transitions 0/170 dead transitions. [2023-08-26 12:10:43,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 170 transitions, 1963 flow [2023-08-26 12:10:43,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 12:10:43,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3242857142857143 [2023-08-26 12:10:43,500 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 12:10:43,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 12:10:43,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:43,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 12:10:43,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:43,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:43,504 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:43,504 INFO L175 Difference]: Start difference. First operand has 82 places, 137 transitions, 1356 flow. Second operand 4 states and 454 transitions. [2023-08-26 12:10:43,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 170 transitions, 1963 flow [2023-08-26 12:10:44,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 170 transitions, 1936 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:44,120 INFO L231 Difference]: Finished difference. Result has 86 places, 154 transitions, 1727 flow [2023-08-26 12:10:44,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1331, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1727, PETRI_PLACES=86, PETRI_TRANSITIONS=154} [2023-08-26 12:10:44,121 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -16 predicate places. [2023-08-26 12:10:44,121 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 154 transitions, 1727 flow [2023-08-26 12:10:44,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:44,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:44,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:44,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:10:44,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:44,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:44,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1396772951, now seen corresponding path program 1 times [2023-08-26 12:10:44,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:44,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877800761] [2023-08-26 12:10:44,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:44,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:44,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:44,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877800761] [2023-08-26 12:10:44,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877800761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:44,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:44,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:44,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130541931] [2023-08-26 12:10:44,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:44,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:44,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:44,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:44,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 350 [2023-08-26 12:10:44,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 154 transitions, 1727 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:44,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:44,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 350 [2023-08-26 12:10:44,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:47,022 INFO L124 PetriNetUnfolderBase]: 10550/17415 cut-off events. [2023-08-26 12:10:47,023 INFO L125 PetriNetUnfolderBase]: For 63575/63900 co-relation queries the response was YES. [2023-08-26 12:10:47,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82768 conditions, 17415 events. 10550/17415 cut-off events. For 63575/63900 co-relation queries the response was YES. Maximal size of possible extension queue 1163. Compared 133965 event pairs, 4889 based on Foata normal form. 122/16623 useless extension candidates. Maximal degree in co-relation 82748. Up to 12257 conditions per place. [2023-08-26 12:10:47,213 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 176 selfloop transitions, 7 changer transitions 0/234 dead transitions. [2023-08-26 12:10:47,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 234 transitions, 2928 flow [2023-08-26 12:10:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-08-26 12:10:47,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40190476190476193 [2023-08-26 12:10:47,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-08-26 12:10:47,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-08-26 12:10:47,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:47,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-08-26 12:10:47,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:47,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:47,218 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:47,218 INFO L175 Difference]: Start difference. First operand has 86 places, 154 transitions, 1727 flow. Second operand 3 states and 422 transitions. [2023-08-26 12:10:47,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 234 transitions, 2928 flow [2023-08-26 12:10:47,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 234 transitions, 2919 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:47,719 INFO L231 Difference]: Finished difference. Result has 88 places, 154 transitions, 1745 flow [2023-08-26 12:10:47,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1722, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1745, PETRI_PLACES=88, PETRI_TRANSITIONS=154} [2023-08-26 12:10:47,720 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -14 predicate places. [2023-08-26 12:10:47,720 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 154 transitions, 1745 flow [2023-08-26 12:10:47,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:47,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:47,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:47,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:10:47,721 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:47,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 590211939, now seen corresponding path program 1 times [2023-08-26 12:10:47,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:47,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117920078] [2023-08-26 12:10:47,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:47,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:47,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117920078] [2023-08-26 12:10:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117920078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:47,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685335559] [2023-08-26 12:10:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:47,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:10:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:10:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:10:47,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 350 [2023-08-26 12:10:47,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 154 transitions, 1745 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:47,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:47,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 350 [2023-08-26 12:10:47,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:50,582 INFO L124 PetriNetUnfolderBase]: 7803/13123 cut-off events. [2023-08-26 12:10:50,582 INFO L125 PetriNetUnfolderBase]: For 46817/46817 co-relation queries the response was YES. [2023-08-26 12:10:50,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65300 conditions, 13123 events. 7803/13123 cut-off events. For 46817/46817 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 97247 event pairs, 2412 based on Foata normal form. 429/13114 useless extension candidates. Maximal degree in co-relation 65278. Up to 5168 conditions per place. [2023-08-26 12:10:50,785 INFO L140 encePairwiseOnDemand]: 331/350 looper letters, 162 selfloop transitions, 36 changer transitions 0/200 dead transitions. [2023-08-26 12:10:50,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 200 transitions, 2535 flow [2023-08-26 12:10:50,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:10:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:10:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 649 transitions. [2023-08-26 12:10:50,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30904761904761907 [2023-08-26 12:10:50,788 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 649 transitions. [2023-08-26 12:10:50,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 649 transitions. [2023-08-26 12:10:50,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:50,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 649 transitions. [2023-08-26 12:10:50,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.16666666666667) internal successors, (649), 6 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:50,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:50,792 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 350.0) internal successors, (2450), 7 states have internal predecessors, (2450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:50,792 INFO L175 Difference]: Start difference. First operand has 88 places, 154 transitions, 1745 flow. Second operand 6 states and 649 transitions. [2023-08-26 12:10:50,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 200 transitions, 2535 flow [2023-08-26 12:10:51,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 200 transitions, 2507 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:51,131 INFO L231 Difference]: Finished difference. Result has 93 places, 160 transitions, 1966 flow [2023-08-26 12:10:51,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1731, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1966, PETRI_PLACES=93, PETRI_TRANSITIONS=160} [2023-08-26 12:10:51,132 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -9 predicate places. [2023-08-26 12:10:51,132 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 160 transitions, 1966 flow [2023-08-26 12:10:51,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:51,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:51,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:51,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:10:51,133 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:51,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:51,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1109908477, now seen corresponding path program 1 times [2023-08-26 12:10:51,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:51,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375437403] [2023-08-26 12:10:51,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:51,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375437403] [2023-08-26 12:10:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375437403] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758132807] [2023-08-26 12:10:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:51,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:51,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:51,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:51,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 350 [2023-08-26 12:10:51,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 160 transitions, 1966 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:51,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:51,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 350 [2023-08-26 12:10:51,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:54,736 INFO L124 PetriNetUnfolderBase]: 11926/19507 cut-off events. [2023-08-26 12:10:54,737 INFO L125 PetriNetUnfolderBase]: For 111101/113223 co-relation queries the response was YES. [2023-08-26 12:10:54,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98574 conditions, 19507 events. 11926/19507 cut-off events. For 111101/113223 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 154596 event pairs, 2895 based on Foata normal form. 1024/19758 useless extension candidates. Maximal degree in co-relation 98551. Up to 10511 conditions per place. [2023-08-26 12:10:54,946 INFO L140 encePairwiseOnDemand]: 347/350 looper letters, 199 selfloop transitions, 3 changer transitions 3/254 dead transitions. [2023-08-26 12:10:54,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 254 transitions, 3461 flow [2023-08-26 12:10:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 12:10:54,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40095238095238095 [2023-08-26 12:10:54,948 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 12:10:54,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 12:10:54,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:54,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 12:10:54,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,951 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,951 INFO L175 Difference]: Start difference. First operand has 93 places, 160 transitions, 1966 flow. Second operand 3 states and 421 transitions. [2023-08-26 12:10:54,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 254 transitions, 3461 flow [2023-08-26 12:10:55,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 254 transitions, 3359 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-26 12:10:55,619 INFO L231 Difference]: Finished difference. Result has 91 places, 159 transitions, 1898 flow [2023-08-26 12:10:55,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1898, PETRI_PLACES=91, PETRI_TRANSITIONS=159} [2023-08-26 12:10:55,620 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -11 predicate places. [2023-08-26 12:10:55,620 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 159 transitions, 1898 flow [2023-08-26 12:10:55,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:55,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:55,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:55,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:10:55,620 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:10:55,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash -344407866, now seen corresponding path program 1 times [2023-08-26 12:10:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:55,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135556095] [2023-08-26 12:10:55,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:55,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:56,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135556095] [2023-08-26 12:10:56,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135556095] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:56,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:56,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647929715] [2023-08-26 12:10:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:56,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:10:56,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:56,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:10:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:10:56,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 350 [2023-08-26 12:10:56,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 159 transitions, 1898 flow. Second operand has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:56,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:56,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 350 [2023-08-26 12:10:56,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:00,682 INFO L124 PetriNetUnfolderBase]: 16234/26780 cut-off events. [2023-08-26 12:11:00,682 INFO L125 PetriNetUnfolderBase]: For 96641/96701 co-relation queries the response was YES. [2023-08-26 12:11:00,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135084 conditions, 26780 events. 16234/26780 cut-off events. For 96641/96701 co-relation queries the response was YES. Maximal size of possible extension queue 1961. Compared 225773 event pairs, 3217 based on Foata normal form. 84/25932 useless extension candidates. Maximal degree in co-relation 135060. Up to 13740 conditions per place. [2023-08-26 12:11:01,045 INFO L140 encePairwiseOnDemand]: 341/350 looper letters, 278 selfloop transitions, 20 changer transitions 1/301 dead transitions. [2023-08-26 12:11:01,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 301 transitions, 4150 flow [2023-08-26 12:11:01,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 724 transitions. [2023-08-26 12:11:01,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29551020408163264 [2023-08-26 12:11:01,048 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 724 transitions. [2023-08-26 12:11:01,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 724 transitions. [2023-08-26 12:11:01,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:01,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 724 transitions. [2023-08-26 12:11:01,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.42857142857143) internal successors, (724), 7 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,054 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 350.0) internal successors, (2800), 8 states have internal predecessors, (2800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,055 INFO L175 Difference]: Start difference. First operand has 91 places, 159 transitions, 1898 flow. Second operand 7 states and 724 transitions. [2023-08-26 12:11:01,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 301 transitions, 4150 flow [2023-08-26 12:11:02,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 301 transitions, 4133 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:02,990 INFO L231 Difference]: Finished difference. Result has 99 places, 166 transitions, 2042 flow [2023-08-26 12:11:02,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2042, PETRI_PLACES=99, PETRI_TRANSITIONS=166} [2023-08-26 12:11:02,990 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -3 predicate places. [2023-08-26 12:11:02,991 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 166 transitions, 2042 flow [2023-08-26 12:11:02,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.14285714285714) internal successors, (659), 7 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:02,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:02,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:02,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:11:02,991 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:02,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:02,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2067641488, now seen corresponding path program 2 times [2023-08-26 12:11:02,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:02,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648293290] [2023-08-26 12:11:02,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:02,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:04,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:04,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648293290] [2023-08-26 12:11:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648293290] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:04,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:04,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:11:04,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030464676] [2023-08-26 12:11:04,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:04,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:11:04,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:11:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:11:04,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 350 [2023-08-26 12:11:04,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 166 transitions, 2042 flow. Second operand has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:04,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:04,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 350 [2023-08-26 12:11:04,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:10,815 INFO L124 PetriNetUnfolderBase]: 18336/30273 cut-off events. [2023-08-26 12:11:10,815 INFO L125 PetriNetUnfolderBase]: For 117682/117730 co-relation queries the response was YES. [2023-08-26 12:11:11,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156337 conditions, 30273 events. 18336/30273 cut-off events. For 117682/117730 co-relation queries the response was YES. Maximal size of possible extension queue 2286. Compared 259959 event pairs, 2736 based on Foata normal form. 217/29438 useless extension candidates. Maximal degree in co-relation 156310. Up to 19410 conditions per place. [2023-08-26 12:11:11,193 INFO L140 encePairwiseOnDemand]: 332/350 looper letters, 246 selfloop transitions, 52 changer transitions 11/311 dead transitions. [2023-08-26 12:11:11,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 311 transitions, 4119 flow [2023-08-26 12:11:11,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 12:11:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 12:11:11,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1194 transitions. [2023-08-26 12:11:11,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2842857142857143 [2023-08-26 12:11:11,198 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1194 transitions. [2023-08-26 12:11:11,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1194 transitions. [2023-08-26 12:11:11,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:11,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1194 transitions. [2023-08-26 12:11:11,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.5) internal successors, (1194), 12 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:11,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:11,206 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 350.0) internal successors, (4550), 13 states have internal predecessors, (4550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:11,207 INFO L175 Difference]: Start difference. First operand has 99 places, 166 transitions, 2042 flow. Second operand 12 states and 1194 transitions. [2023-08-26 12:11:11,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 311 transitions, 4119 flow [2023-08-26 12:11:13,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 311 transitions, 4081 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:13,282 INFO L231 Difference]: Finished difference. Result has 114 places, 185 transitions, 2488 flow [2023-08-26 12:11:13,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2013, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2488, PETRI_PLACES=114, PETRI_TRANSITIONS=185} [2023-08-26 12:11:13,282 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 12 predicate places. [2023-08-26 12:11:13,282 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 185 transitions, 2488 flow [2023-08-26 12:11:13,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.5) internal successors, (895), 10 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:13,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:13,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:13,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:11:13,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:13,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1116704010, now seen corresponding path program 1 times [2023-08-26 12:11:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779656748] [2023-08-26 12:11:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:13,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779656748] [2023-08-26 12:11:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779656748] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578009774] [2023-08-26 12:11:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:13,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:13,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 350 [2023-08-26 12:11:13,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 185 transitions, 2488 flow. Second operand has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:13,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:13,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 350 [2023-08-26 12:11:13,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:17,332 INFO L124 PetriNetUnfolderBase]: 14454/22519 cut-off events. [2023-08-26 12:11:17,332 INFO L125 PetriNetUnfolderBase]: For 116311/116329 co-relation queries the response was YES. [2023-08-26 12:11:17,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123692 conditions, 22519 events. 14454/22519 cut-off events. For 116311/116329 co-relation queries the response was YES. Maximal size of possible extension queue 1439. Compared 168184 event pairs, 2888 based on Foata normal form. 969/23486 useless extension candidates. Maximal degree in co-relation 123658. Up to 8907 conditions per place. [2023-08-26 12:11:17,427 INFO L140 encePairwiseOnDemand]: 336/350 looper letters, 46 selfloop transitions, 9 changer transitions 173/230 dead transitions. [2023-08-26 12:11:17,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 230 transitions, 3295 flow [2023-08-26 12:11:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:11:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:11:17,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 823 transitions. [2023-08-26 12:11:17,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29392857142857143 [2023-08-26 12:11:17,430 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 823 transitions. [2023-08-26 12:11:17,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 823 transitions. [2023-08-26 12:11:17,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:17,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 823 transitions. [2023-08-26 12:11:17,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 102.875) internal successors, (823), 8 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:17,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:17,435 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 350.0) internal successors, (3150), 9 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:17,435 INFO L175 Difference]: Start difference. First operand has 114 places, 185 transitions, 2488 flow. Second operand 8 states and 823 transitions. [2023-08-26 12:11:17,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 230 transitions, 3295 flow [2023-08-26 12:11:19,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 230 transitions, 3113 flow, removed 27 selfloop flow, removed 7 redundant places. [2023-08-26 12:11:19,423 INFO L231 Difference]: Finished difference. Result has 106 places, 49 transitions, 496 flow [2023-08-26 12:11:19,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=2236, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=496, PETRI_PLACES=106, PETRI_TRANSITIONS=49} [2023-08-26 12:11:19,424 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, 4 predicate places. [2023-08-26 12:11:19,424 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 49 transitions, 496 flow [2023-08-26 12:11:19,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:19,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:19,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:19,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:11:19,424 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:19,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:19,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1333568151, now seen corresponding path program 1 times [2023-08-26 12:11:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:19,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963747685] [2023-08-26 12:11:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963747685] [2023-08-26 12:11:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963747685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:19,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50809838] [2023-08-26 12:11:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:19,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:19,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:19,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:19,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 350 [2023-08-26 12:11:19,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 49 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:19,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:19,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 350 [2023-08-26 12:11:19,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:20,107 INFO L124 PetriNetUnfolderBase]: 862/1547 cut-off events. [2023-08-26 12:11:20,107 INFO L125 PetriNetUnfolderBase]: For 9771/10034 co-relation queries the response was YES. [2023-08-26 12:11:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7639 conditions, 1547 events. 862/1547 cut-off events. For 9771/10034 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 8701 event pairs, 169 based on Foata normal form. 148/1676 useless extension candidates. Maximal degree in co-relation 7608. Up to 1241 conditions per place. [2023-08-26 12:11:20,117 INFO L140 encePairwiseOnDemand]: 345/350 looper letters, 64 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-08-26 12:11:20,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 880 flow [2023-08-26 12:11:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:20,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-26 12:11:20,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37523809523809526 [2023-08-26 12:11:20,120 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-26 12:11:20,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-26 12:11:20,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:20,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-26 12:11:20,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 350.0) internal successors, (1400), 4 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,123 INFO L175 Difference]: Start difference. First operand has 106 places, 49 transitions, 496 flow. Second operand 3 states and 394 transitions. [2023-08-26 12:11:20,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 880 flow [2023-08-26 12:11:20,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 77 transitions, 794 flow, removed 19 selfloop flow, removed 14 redundant places. [2023-08-26 12:11:20,133 INFO L231 Difference]: Finished difference. Result has 73 places, 52 transitions, 462 flow [2023-08-26 12:11:20,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=73, PETRI_TRANSITIONS=52} [2023-08-26 12:11:20,134 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -29 predicate places. [2023-08-26 12:11:20,134 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 52 transitions, 462 flow [2023-08-26 12:11:20,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:20,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:20,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:11:20,135 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:20,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2005887596, now seen corresponding path program 1 times [2023-08-26 12:11:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:20,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214069185] [2023-08-26 12:11:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:20,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:20,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:20,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:20,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214069185] [2023-08-26 12:11:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214069185] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:20,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:20,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474191027] [2023-08-26 12:11:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:20,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 350 [2023-08-26 12:11:20,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 52 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:20,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 350 [2023-08-26 12:11:20,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:20,593 INFO L124 PetriNetUnfolderBase]: 470/930 cut-off events. [2023-08-26 12:11:20,594 INFO L125 PetriNetUnfolderBase]: For 3595/3709 co-relation queries the response was YES. [2023-08-26 12:11:20,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 930 events. 470/930 cut-off events. For 3595/3709 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5075 event pairs, 67 based on Foata normal form. 141/1061 useless extension candidates. Maximal degree in co-relation 4562. Up to 424 conditions per place. [2023-08-26 12:11:20,599 INFO L140 encePairwiseOnDemand]: 345/350 looper letters, 68 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-08-26 12:11:20,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 850 flow [2023-08-26 12:11:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-26 12:11:20,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3742857142857143 [2023-08-26 12:11:20,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-26 12:11:20,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-26 12:11:20,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:20,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-26 12:11:20,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 350.0) internal successors, (1750), 5 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,604 INFO L175 Difference]: Start difference. First operand has 73 places, 52 transitions, 462 flow. Second operand 4 states and 524 transitions. [2023-08-26 12:11:20,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 850 flow [2023-08-26 12:11:20,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 830 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:20,609 INFO L231 Difference]: Finished difference. Result has 74 places, 50 transitions, 430 flow [2023-08-26 12:11:20,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2023-08-26 12:11:20,609 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -28 predicate places. [2023-08-26 12:11:20,609 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 430 flow [2023-08-26 12:11:20,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,609 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:20,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:20,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:11:20,610 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:20,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1033379385, now seen corresponding path program 1 times [2023-08-26 12:11:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497715927] [2023-08-26 12:11:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:20,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:20,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:20,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497715927] [2023-08-26 12:11:20,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497715927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:20,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:20,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890339914] [2023-08-26 12:11:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:20,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:20,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:20,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:20,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:20,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 350 [2023-08-26 12:11:20,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 430 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:20,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:20,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 350 [2023-08-26 12:11:20,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:21,099 INFO L124 PetriNetUnfolderBase]: 386/756 cut-off events. [2023-08-26 12:11:21,099 INFO L125 PetriNetUnfolderBase]: For 3328/3432 co-relation queries the response was YES. [2023-08-26 12:11:21,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3920 conditions, 756 events. 386/756 cut-off events. For 3328/3432 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4058 event pairs, 53 based on Foata normal form. 95/845 useless extension candidates. Maximal degree in co-relation 3898. Up to 339 conditions per place. [2023-08-26 12:11:21,102 INFO L140 encePairwiseOnDemand]: 345/350 looper letters, 57 selfloop transitions, 10 changer transitions 9/83 dead transitions. [2023-08-26 12:11:21,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 858 flow [2023-08-26 12:11:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:21,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 12:11:21,104 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.368 [2023-08-26 12:11:21,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 12:11:21,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 12:11:21,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:21,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 12:11:21,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:21,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:21,107 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 350.0) internal successors, (2100), 6 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:21,107 INFO L175 Difference]: Start difference. First operand has 74 places, 50 transitions, 430 flow. Second operand 5 states and 644 transitions. [2023-08-26 12:11:21,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 858 flow [2023-08-26 12:11:21,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 83 transitions, 778 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-08-26 12:11:21,111 INFO L231 Difference]: Finished difference. Result has 73 places, 45 transitions, 365 flow [2023-08-26 12:11:21,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=350, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=365, PETRI_PLACES=73, PETRI_TRANSITIONS=45} [2023-08-26 12:11:21,111 INFO L281 CegarLoopForPetriNet]: 102 programPoint places, -29 predicate places. [2023-08-26 12:11:21,111 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 45 transitions, 365 flow [2023-08-26 12:11:21,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:21,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:21,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:21,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:11:21,112 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 105 more)] === [2023-08-26 12:11:21,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1923991002, now seen corresponding path program 1 times [2023-08-26 12:11:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:21,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305433296] [2023-08-26 12:11:21,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:21,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:21,238 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:11:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:21,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:11:21,385 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:11:21,386 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (107 of 108 remaining) [2023-08-26 12:11:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (106 of 108 remaining) [2023-08-26 12:11:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (105 of 108 remaining) [2023-08-26 12:11:21,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (104 of 108 remaining) [2023-08-26 12:11:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 108 remaining) [2023-08-26 12:11:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 108 remaining) [2023-08-26 12:11:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 108 remaining) [2023-08-26 12:11:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 108 remaining) [2023-08-26 12:11:21,392 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 108 remaining) [2023-08-26 12:11:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 108 remaining) [2023-08-26 12:11:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 108 remaining) [2023-08-26 12:11:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 108 remaining) [2023-08-26 12:11:21,396 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 108 remaining) [2023-08-26 12:11:21,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 108 remaining) [2023-08-26 12:11:21,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 108 remaining) [2023-08-26 12:11:21,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 108 remaining) [2023-08-26 12:11:21,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 108 remaining) [2023-08-26 12:11:21,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 108 remaining) [2023-08-26 12:11:21,400 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 108 remaining) [2023-08-26 12:11:21,401 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 108 remaining) [2023-08-26 12:11:21,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 108 remaining) [2023-08-26 12:11:21,402 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 108 remaining) [2023-08-26 12:11:21,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 12:11:21,402 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:21,409 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:11:21,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:11:21,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:11:21 BasicIcfg [2023-08-26 12:11:21,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:11:21,503 INFO L158 Benchmark]: Toolchain (without parser) took 95678.84ms. Allocated memory was 381.7MB in the beginning and 5.8GB in the end (delta: 5.4GB). Free memory was 354.1MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-26 12:11:21,503 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 381.7MB. Free memory is still 357.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:11:21,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.50ms. Allocated memory is still 381.7MB. Free memory was 354.1MB in the beginning and 327.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:21,504 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.62ms. Allocated memory is still 381.7MB. Free memory was 327.8MB in the beginning and 324.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:21,504 INFO L158 Benchmark]: Boogie Preprocessor took 73.94ms. Allocated memory is still 381.7MB. Free memory was 324.8MB in the beginning and 322.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:21,504 INFO L158 Benchmark]: RCFGBuilder took 2198.39ms. Allocated memory was 381.7MB in the beginning and 490.7MB in the end (delta: 109.1MB). Free memory was 322.2MB in the beginning and 372.8MB in the end (delta: -50.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. [2023-08-26 12:11:21,504 INFO L158 Benchmark]: TraceAbstraction took 92614.40ms. Allocated memory was 490.7MB in the beginning and 5.8GB in the end (delta: 5.3GB). Free memory was 371.7MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-26 12:11:21,505 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 381.7MB. Free memory is still 357.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 714.50ms. Allocated memory is still 381.7MB. Free memory was 354.1MB in the beginning and 327.8MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.62ms. Allocated memory is still 381.7MB. Free memory was 327.8MB in the beginning and 324.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 73.94ms. Allocated memory is still 381.7MB. Free memory was 324.8MB in the beginning and 322.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 2198.39ms. Allocated memory was 381.7MB in the beginning and 490.7MB in the end (delta: 109.1MB). Free memory was 322.2MB in the beginning and 372.8MB in the end (delta: -50.6MB). Peak memory consumption was 68.9MB. Max. memory is 16.0GB. * TraceAbstraction took 92614.40ms. Allocated memory was 490.7MB in the beginning and 5.8GB in the end (delta: 5.3GB). Free memory was 371.7MB in the beginning and 3.9GB in the end (delta: -3.6GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.5s, 196 PlacesBefore, 102 PlacesAfterwards, 189 TransitionsBefore, 94 TransitionsAfterwards, 9468 CoEnabledTransitionPairs, 7 FixpointIterations, 64 TrivialSequentialCompositions, 85 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 49348 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9877, independent: 9157, independent conditional: 0, independent unconditional: 9157, dependent: 720, dependent conditional: 0, dependent unconditional: 720, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3342, independent: 3218, independent conditional: 0, independent unconditional: 3218, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9877, independent: 5939, independent conditional: 0, independent unconditional: 5939, dependent: 596, dependent conditional: 0, dependent unconditional: 596, unknown: 3342, unknown conditional: 0, unknown unconditional: 3342] , Statistics on independence cache: Total cache size (in pairs): 388, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L851] 0 pthread_t t1801; [L852] FCALL, FORK 0 pthread_create(&t1801, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1801, ((void *)0), P0, ((void *)0))=-2, t1801={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 pthread_t t1802; [L854] FCALL, FORK 0 pthread_create(&t1802, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1802, ((void *)0), P1, ((void *)0))=-1, t1801={7:0}, t1802={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t1803; [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] 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)))) [L764] EXPR 1 \read(y) [L764] 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)))) [L764] 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)))) [L765] 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)))) [L766] 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)))) [L767] 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)))) [L768] 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)))) [L769] 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)))) [L770] 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)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] FCALL, FORK 0 pthread_create(&t1803, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1803, ((void *)0), P2, ((void *)0))=0, t1801={7:0}, t1802={8:0}, t1803={5:0}, weak$$choice0=6, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L811] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L812] 3 y$flush_delayed = weak$$choice2 [L813] EXPR 3 \read(y) [L813] 3 y$mem_tmp = y [L814] 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) [L814] EXPR 3 \read(y) [L814] 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) [L814] 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) [L815] 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)) [L816] 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)) [L817] 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)) [L818] 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)) [L819] 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)) [L820] 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)) [L821] EXPR 3 \read(y) [L821] 3 __unbuffered_p2_EAX = y [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] EXPR 3 \read(y) [L822] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L822] 3 y = y$flush_delayed ? y$mem_tmp : y [L823] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L826] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 \read(y) [L829] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L829] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L830] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L831] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L832] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L833] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] 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) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] EXPR 0 \read(y) [L862] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L862] 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) [L862] 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) [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 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 [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L866] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1801={7:0}, t1802={8:0}, t1803={5:0}, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L869] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L870] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L871] 0 y$flush_delayed = weak$$choice2 [L872] EXPR 0 \read(y) [L872] 0 y$mem_tmp = y [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] EXPR 0 \read(y) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L874] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L875] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L876] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L877] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L879] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] EXPR 0 x == 2 && y == 2 [L882] EXPR 0 \read(y) [L882] EXPR 0 x == 2 && y == 2 [L882] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L883] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L883] 0 y = y$flush_delayed ? y$mem_tmp : y [L884] 0 y$flush_delayed = (_Bool)0 [L886] 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", "safe001_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 854]: 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: 852]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 256 locations, 108 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: 92.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 63.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1047 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1047 mSDsluCounter, 32 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1964 IncrementalHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 26 mSDtfsCounter, 1964 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2488occurred in iteration=18, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 2267 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:11:21,536 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...