/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/mix040.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:05:19,373 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:05:19,466 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:05:19,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:05:19,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:05:19,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:05:19,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:05:19,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:05:19,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:05:19,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:05:19,513 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:05:19,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:05:19,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:05:19,514 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:05:19,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:05:19,514 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:05:19,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:05:19,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:05:19,515 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:05:19,515 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:05:19,515 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:05:19,516 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:05:19,516 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:05:19,517 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:05:19,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:05:19,517 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:05:19,517 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:05:19,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:19,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:05:19,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:05:19,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:05:19,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:05:19,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:05:19,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:05:19,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:05:19,520 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:05:19,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:05:19,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:05:19,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:05:19,901 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:05:19,902 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:05:19,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-26 12:05:21,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:05:21,525 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:05:21,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-26 12:05:21,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf6b2b67/494c51e32d704dbaa672aa9bdab3d6eb/FLAGeaa2df7c1 [2023-08-26 12:05:21,564 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf6b2b67/494c51e32d704dbaa672aa9bdab3d6eb [2023-08-26 12:05:21,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:05:21,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:05:21,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:21,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:05:21,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:05:21,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:21" (1/1) ... [2023-08-26 12:05:21,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592ccf8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:21, skipping insertion in model container [2023-08-26 12:05:21,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:05:21" (1/1) ... [2023-08-26 12:05:21,636 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:05:22,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:22,034 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:05:22,071 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:22,073 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:05:22,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:05:22,147 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:22,147 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:05:22,154 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:05:22,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22 WrapperNode [2023-08-26 12:05:22,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:05:22,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:22,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:05:22,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:05:22,162 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:05:22" (1/1) ... [2023-08-26 12:05:22,183 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:05:22" (1/1) ... [2023-08-26 12:05:22,208 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-08-26 12:05:22,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:05:22,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:05:22,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:05:22,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:05:22,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,229 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:05:22,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:05:22,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:05:22,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:05:22,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (1/1) ... [2023-08-26 12:05:22,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:05:22,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:05:22,285 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:05:22,289 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:05:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:05:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:05:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:05:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:05:22,316 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:05:22,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:05:22,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:05:22,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 12:05:22,317 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:05:22,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:05:22,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:05:22,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:05:22,319 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:05:22,452 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:05:22,454 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:05:22,788 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:05:22,914 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:05:22,914 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:05:22,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:22 BoogieIcfgContainer [2023-08-26 12:05:22,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:05:22,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:05:22,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:05:22,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:05:22,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:05:21" (1/3) ... [2023-08-26 12:05:22,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da880fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:22, skipping insertion in model container [2023-08-26 12:05:22,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:05:22" (2/3) ... [2023-08-26 12:05:22,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3da880fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:05:22, skipping insertion in model container [2023-08-26 12:05:22,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:05:22" (3/3) ... [2023-08-26 12:05:22,927 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-08-26 12:05:22,943 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:05:22,943 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-26 12:05:22,944 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:05:23,017 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:05:23,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 12:05:23,144 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 12:05:23,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 12:05:23,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-26 12:05:23,161 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-26 12:05:23,165 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:05:23,174 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 12:05:23,176 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-26 12:05:23,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-26 12:05:23,210 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-26 12:05:23,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:23,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 12:05:23,213 INFO L119 LiptonReduction]: Number of co-enabled transitions 3184 [2023-08-26 12:05:27,762 INFO L134 LiptonReduction]: Checked pairs total: 8173 [2023-08-26 12:05:27,762 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-26 12:05:27,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:05:27,781 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;@73ffea9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:05:27,781 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-26 12:05:27,783 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:05:27,783 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:05:27,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:27,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:27,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:05:27,785 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:27,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:27,789 INFO L85 PathProgramCache]: Analyzing trace with hash 600, now seen corresponding path program 1 times [2023-08-26 12:05:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888798627] [2023-08-26 12:05:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:27,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:27,896 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:05:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:27,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888798627] [2023-08-26 12:05:27,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888798627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:27,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:27,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:05:27,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670931736] [2023-08-26 12:05:27,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:27,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:05:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:05:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:05:27,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 283 [2023-08-26 12:05:27,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:05:27,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:27,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 283 [2023-08-26 12:05:27,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:28,591 INFO L124 PetriNetUnfolderBase]: 3632/5212 cut-off events. [2023-08-26 12:05:28,591 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-08-26 12:05:28,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10305 conditions, 5212 events. 3632/5212 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 27518 event pairs, 3632 based on Foata normal form. 180/4704 useless extension candidates. Maximal degree in co-relation 10293. Up to 4990 conditions per place. [2023-08-26 12:05:28,636 INFO L140 encePairwiseOnDemand]: 274/283 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2023-08-26 12:05:28,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 120 flow [2023-08-26 12:05:28,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:05:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:05:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2023-08-26 12:05:28,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123674911660777 [2023-08-26 12:05:28,649 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 290 transitions. [2023-08-26 12:05:28,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 290 transitions. [2023-08-26 12:05:28,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:28,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 290 transitions. [2023-08-26 12:05:28,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have 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:05:28,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:28,660 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:28,661 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 2 states and 290 transitions. [2023-08-26 12:05:28,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 120 flow [2023-08-26 12:05:28,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 12:05:28,666 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 66 flow [2023-08-26 12:05:28,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-08-26 12:05:28,671 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -11 predicate places. [2023-08-26 12:05:28,671 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 66 flow [2023-08-26 12:05:28,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have 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:05:28,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:28,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:28,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:05:28,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:28,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:28,673 INFO L85 PathProgramCache]: Analyzing trace with hash 619132286, now seen corresponding path program 1 times [2023-08-26 12:05:28,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:28,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193564333] [2023-08-26 12:05:28,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:28,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:29,062 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:05:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:29,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193564333] [2023-08-26 12:05:29,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193564333] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:29,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:29,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:05:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096947660] [2023-08-26 12:05:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:29,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:05:29,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:05:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:05:29,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 283 [2023-08-26 12:05:29,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:05:29,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:29,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 283 [2023-08-26 12:05:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:29,569 INFO L124 PetriNetUnfolderBase]: 2891/4507 cut-off events. [2023-08-26 12:05:29,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:05:29,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8604 conditions, 4507 events. 2891/4507 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 26352 event pairs, 668 based on Foata normal form. 0/4215 useless extension candidates. Maximal degree in co-relation 8601. Up to 2980 conditions per place. [2023-08-26 12:05:29,595 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 31 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2023-08-26 12:05:29,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 41 transitions, 164 flow [2023-08-26 12:05:29,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:05:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:05:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 12:05:29,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49352179034157834 [2023-08-26 12:05:29,598 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 12:05:29,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 12:05:29,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:29,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 12:05:29,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:29,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have 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:05:29,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have 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:05:29,603 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 66 flow. Second operand 3 states and 419 transitions. [2023-08-26 12:05:29,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 41 transitions, 164 flow [2023-08-26 12:05:29,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:05:29,605 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 64 flow [2023-08-26 12:05:29,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-26 12:05:29,606 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -10 predicate places. [2023-08-26 12:05:29,606 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 64 flow [2023-08-26 12:05:29,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:05:29,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:29,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:29,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:05:29,607 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:29,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:29,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1983796403, now seen corresponding path program 1 times [2023-08-26 12:05:29,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:29,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812247255] [2023-08-26 12:05:29,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:29,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:05:29,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:29,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812247255] [2023-08-26 12:05:29,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812247255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:29,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:29,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:05:29,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411972119] [2023-08-26 12:05:29,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:29,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:29,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:29,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:29,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:29,873 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:05:29,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:05:29,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:29,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:05:29,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:30,351 INFO L124 PetriNetUnfolderBase]: 3083/4339 cut-off events. [2023-08-26 12:05:30,351 INFO L125 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2023-08-26 12:05:30,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9062 conditions, 4339 events. 3083/4339 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 21404 event pairs, 1023 based on Foata normal form. 192/4485 useless extension candidates. Maximal degree in co-relation 9058. Up to 3481 conditions per place. [2023-08-26 12:05:30,379 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 34 selfloop transitions, 3 changer transitions 20/60 dead transitions. [2023-08-26 12:05:30,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 60 transitions, 256 flow [2023-08-26 12:05:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-26 12:05:30,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472791519434629 [2023-08-26 12:05:30,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-26 12:05:30,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-26 12:05:30,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:30,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-26 12:05:30,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:05:30,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:30,389 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:30,390 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 64 flow. Second operand 5 states and 669 transitions. [2023-08-26 12:05:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 60 transitions, 256 flow [2023-08-26 12:05:30,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:30,392 INFO L231 Difference]: Finished difference. Result has 43 places, 28 transitions, 87 flow [2023-08-26 12:05:30,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2023-08-26 12:05:30,393 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2023-08-26 12:05:30,394 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 28 transitions, 87 flow [2023-08-26 12:05:30,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have 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:05:30,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:30,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:30,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:05:30,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:30,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1368119547, now seen corresponding path program 1 times [2023-08-26 12:05:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:30,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847898450] [2023-08-26 12:05:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:30,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:30,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:30,579 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:05:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847898450] [2023-08-26 12:05:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847898450] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:30,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:30,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329113493] [2023-08-26 12:05:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:30,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:30,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:30,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:30,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:30,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 283 [2023-08-26 12:05:30,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 28 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:30,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:30,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 283 [2023-08-26 12:05:30,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:31,703 INFO L124 PetriNetUnfolderBase]: 8263/11440 cut-off events. [2023-08-26 12:05:31,703 INFO L125 PetriNetUnfolderBase]: For 4536/4536 co-relation queries the response was YES. [2023-08-26 12:05:31,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26946 conditions, 11440 events. 8263/11440 cut-off events. For 4536/4536 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 56250 event pairs, 1511 based on Foata normal form. 512/11952 useless extension candidates. Maximal degree in co-relation 26939. Up to 4961 conditions per place. [2023-08-26 12:05:31,763 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 48 selfloop transitions, 10 changer transitions 37/95 dead transitions. [2023-08-26 12:05:31,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 95 transitions, 471 flow [2023-08-26 12:05:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:05:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:05:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2023-08-26 12:05:31,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44926804644119134 [2023-08-26 12:05:31,766 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2023-08-26 12:05:31,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2023-08-26 12:05:31,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:31,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2023-08-26 12:05:31,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have 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:05:31,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:31,781 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:31,781 INFO L175 Difference]: Start difference. First operand has 43 places, 28 transitions, 87 flow. Second operand 7 states and 890 transitions. [2023-08-26 12:05:31,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 95 transitions, 471 flow [2023-08-26 12:05:31,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 95 transitions, 460 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:31,831 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 188 flow [2023-08-26 12:05:31,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-08-26 12:05:31,832 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 12:05:31,833 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 188 flow [2023-08-26 12:05:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:31,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:31,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:05:31,834 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:31,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:31,834 INFO L85 PathProgramCache]: Analyzing trace with hash 680016832, now seen corresponding path program 1 times [2023-08-26 12:05:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:31,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674822096] [2023-08-26 12:05:31,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:31,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:31,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:31,956 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:05:31,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:31,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674822096] [2023-08-26 12:05:31,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674822096] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:31,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:31,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:05:31,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726322590] [2023-08-26 12:05:31,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:31,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:31,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:31,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:31,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:05:31,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:05:31,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:31,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:05:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:33,000 INFO L124 PetriNetUnfolderBase]: 6341/9136 cut-off events. [2023-08-26 12:05:33,000 INFO L125 PetriNetUnfolderBase]: For 16389/16659 co-relation queries the response was YES. [2023-08-26 12:05:33,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28105 conditions, 9136 events. 6341/9136 cut-off events. For 16389/16659 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49848 event pairs, 2227 based on Foata normal form. 330/9270 useless extension candidates. Maximal degree in co-relation 28094. Up to 7108 conditions per place. [2023-08-26 12:05:33,070 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 43 selfloop transitions, 4 changer transitions 20/74 dead transitions. [2023-08-26 12:05:33,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 74 transitions, 466 flow [2023-08-26 12:05:33,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:33,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-26 12:05:33,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.472791519434629 [2023-08-26 12:05:33,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-26 12:05:33,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-26 12:05:33,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:33,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-26 12:05:33,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have 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:05:33,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:33,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:33,080 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 188 flow. Second operand 5 states and 669 transitions. [2023-08-26 12:05:33,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 74 transitions, 466 flow [2023-08-26 12:05:33,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:33,102 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 230 flow [2023-08-26 12:05:33,102 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-26 12:05:33,104 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 12:05:33,104 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 230 flow [2023-08-26 12:05:33,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have 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:05:33,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:33,105 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:05:33,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:05:33,105 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:33,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:33,106 INFO L85 PathProgramCache]: Analyzing trace with hash 675181237, now seen corresponding path program 1 times [2023-08-26 12:05:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:33,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241751059] [2023-08-26 12:05:33,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:33,262 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:05:33,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:33,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241751059] [2023-08-26 12:05:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241751059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:33,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:33,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062545905] [2023-08-26 12:05:33,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:33,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:33,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:33,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 283 [2023-08-26 12:05:33,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:33,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:33,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 283 [2023-08-26 12:05:33,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:34,489 INFO L124 PetriNetUnfolderBase]: 9625/13542 cut-off events. [2023-08-26 12:05:34,489 INFO L125 PetriNetUnfolderBase]: For 28297/28297 co-relation queries the response was YES. [2023-08-26 12:05:34,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43725 conditions, 13542 events. 9625/13542 cut-off events. For 28297/28297 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 72429 event pairs, 1691 based on Foata normal form. 336/13878 useless extension candidates. Maximal degree in co-relation 43711. Up to 5507 conditions per place. [2023-08-26 12:05:34,685 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 60 selfloop transitions, 21 changer transitions 31/112 dead transitions. [2023-08-26 12:05:34,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 112 transitions, 778 flow [2023-08-26 12:05:34,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:05:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:05:34,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 894 transitions. [2023-08-26 12:05:34,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512872286723877 [2023-08-26 12:05:34,689 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 894 transitions. [2023-08-26 12:05:34,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 894 transitions. [2023-08-26 12:05:34,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:34,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 894 transitions. [2023-08-26 12:05:34,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.71428571428571) internal successors, (894), 7 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have 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:05:34,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:34,696 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:34,696 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 230 flow. Second operand 7 states and 894 transitions. [2023-08-26 12:05:34,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 112 transitions, 778 flow [2023-08-26 12:05:34,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 112 transitions, 754 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:34,736 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 413 flow [2023-08-26 12:05:34,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=413, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-26 12:05:34,739 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 11 predicate places. [2023-08-26 12:05:34,742 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 413 flow [2023-08-26 12:05:34,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:34,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:34,743 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:05:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:05:34,743 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:34,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 677147443, now seen corresponding path program 1 times [2023-08-26 12:05:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:34,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033197256] [2023-08-26 12:05:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:34,947 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:05:34,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:34,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033197256] [2023-08-26 12:05:34,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033197256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:34,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:34,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:34,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932487504] [2023-08-26 12:05:34,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:34,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:34,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:34,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:34,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:34,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:05:34,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 413 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:34,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:34,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:05:34,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:35,863 INFO L124 PetriNetUnfolderBase]: 6052/9012 cut-off events. [2023-08-26 12:05:35,863 INFO L125 PetriNetUnfolderBase]: For 32690/33361 co-relation queries the response was YES. [2023-08-26 12:05:35,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31454 conditions, 9012 events. 6052/9012 cut-off events. For 32690/33361 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 54993 event pairs, 1352 based on Foata normal form. 782/9329 useless extension candidates. Maximal degree in co-relation 31436. Up to 6147 conditions per place. [2023-08-26 12:05:35,930 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 84 selfloop transitions, 10 changer transitions 7/118 dead transitions. [2023-08-26 12:05:35,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 118 transitions, 1103 flow [2023-08-26 12:05:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-26 12:05:35,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4600706713780919 [2023-08-26 12:05:35,933 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-26 12:05:35,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-26 12:05:35,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:35,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-26 12:05:35,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have 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:05:35,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:35,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:35,939 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 413 flow. Second operand 5 states and 651 transitions. [2023-08-26 12:05:35,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 118 transitions, 1103 flow [2023-08-26 12:05:35,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 118 transitions, 1081 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:35,970 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 478 flow [2023-08-26 12:05:35,970 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=478, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2023-08-26 12:05:35,971 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 12:05:35,971 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 478 flow [2023-08-26 12:05:35,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:35,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:35,972 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:05:35,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:05:35,972 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:35,972 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1804178859, now seen corresponding path program 1 times [2023-08-26 12:05:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986322009] [2023-08-26 12:05:35,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:36,113 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:05:36,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986322009] [2023-08-26 12:05:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986322009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:36,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:36,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:05:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218878532] [2023-08-26 12:05:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:36,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:05:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:05:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:05:36,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 283 [2023-08-26 12:05:36,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 478 flow. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:05:36,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:36,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 283 [2023-08-26 12:05:36,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:37,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][74], [Black: 189#(= ~x~0 0), 154#true, Black: 192#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 213#true, Black: 205#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 65#P2EXITtrue, Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 225#(= ~x~0 1), P0Thread1of1ForFork3InUse, Black: 197#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 142#L837true, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 121#P0EXITtrue, 72#L771true, 59#L3true, Black: 166#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(<= ~y~0 0), 171#true, Black: 179#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 199#(= ~y~0 1), Black: 175#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 173#(= ~__unbuffered_p3_EAX~0 0), Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-26 12:05:37,027 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,027 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,027 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,027 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][40], [Black: 189#(= ~x~0 0), 154#true, Black: 192#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 213#true, 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 205#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 65#P2EXITtrue, 225#(= ~x~0 1), Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork3InUse, Black: 197#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 103#P1EXITtrue, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 121#P0EXITtrue, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 59#L3true, Black: 166#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 53#L830true, Black: 163#(<= ~y~0 0), Black: 171#true, Black: 179#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 199#(= ~y~0 1), Black: 175#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 173#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-26 12:05:37,065 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,066 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-08-26 12:05:37,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([418] L830-->L837: Formula: (let ((.cse4 (not (= (mod v_~z$w_buff0_used~0_89 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd4~0_33 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd4~0_22 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_89 256) 0)))) (.cse2 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_90 256) 0)))) (.cse0 (and .cse4 .cse5))) (and (= (ite (or .cse0 .cse1) 0 v_~z$w_buff1_used~0_89) v_~z$w_buff1_used~0_88) (= v_~z~0_52 (ite .cse2 v_~z$w_buff0~0_41 (ite .cse1 v_~z$w_buff1~0_46 v_~z~0_53))) (= (ite (or (and (not (= (mod v_~z$w_buff1_used~0_88 256) 0)) .cse3) (and .cse4 (not (= (mod v_~z$r_buff0_thd4~0_32 256) 0)))) 0 v_~z$r_buff1_thd4~0_22) v_~z$r_buff1_thd4~0_21) (= (ite .cse2 0 v_~z$w_buff0_used~0_90) v_~z$w_buff0_used~0_89) (= v_~z$r_buff0_thd4~0_32 (ite .cse0 0 v_~z$r_buff0_thd4~0_33))))) InVars {~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_22, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_33, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_89, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_53} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_21, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_41, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_88, ~z$w_buff1~0=v_~z$w_buff1~0_46, ~z~0=v_~z~0_52} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, ~z$w_buff0_used~0, ~z$r_buff0_thd4~0, ~z$w_buff1_used~0, ~z~0][74], [Black: 189#(= ~x~0 0), 154#true, Black: 192#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 213#true, Black: 205#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 65#P2EXITtrue, 225#(= ~x~0 1), Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork3InUse, Black: 197#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 142#L837true, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 121#P0EXITtrue, 72#L771true, 83#L872true, Black: 166#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), Black: 163#(<= ~y~0 0), 171#true, Black: 179#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 199#(= ~y~0 1), Black: 175#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 173#(= ~__unbuffered_p3_EAX~0 0), Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))]) [2023-08-26 12:05:37,122 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,122 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,122 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,122 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([512] L771-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork1_#res.offset_7| 0) (= |v_P1Thread1of1ForFork1_#res.base_7| 0) (= (+ v_~__unbuffered_cnt~0_32 1) v_~__unbuffered_cnt~0_31)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base][40], [Black: 189#(= ~x~0 0), 154#true, Black: 192#(and (= ~x~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 213#true, 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 205#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 65#P2EXITtrue, 225#(= ~x~0 1), Black: 200#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), P0Thread1of1ForFork3InUse, Black: 197#true, P2Thread1of1ForFork0InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork2InUse, 103#P1EXITtrue, Black: 215#(= ~__unbuffered_cnt~0 0), Black: 218#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)), 121#P0EXITtrue, Black: 216#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), 83#L872true, Black: 166#(and (<= ~y~0 0) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 53#L830true, Black: 163#(<= ~y~0 0), Black: 171#true, Black: 179#(and (or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))) (not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0))), 199#(= ~y~0 1), Black: 175#(not (= |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 0)), Black: 173#(= ~__unbuffered_p3_EAX~0 0)]) [2023-08-26 12:05:37,150 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,150 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-26 12:05:37,277 INFO L124 PetriNetUnfolderBase]: 8386/12850 cut-off events. [2023-08-26 12:05:37,278 INFO L125 PetriNetUnfolderBase]: For 49352/50078 co-relation queries the response was YES. [2023-08-26 12:05:37,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55585 conditions, 12850 events. 8386/12850 cut-off events. For 49352/50078 co-relation queries the response was YES. Maximal size of possible extension queue 802. Compared 85029 event pairs, 3371 based on Foata normal form. 305/12490 useless extension candidates. Maximal degree in co-relation 55565. Up to 5849 conditions per place. [2023-08-26 12:05:37,339 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 58 selfloop transitions, 9 changer transitions 29/105 dead transitions. [2023-08-26 12:05:37,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 105 transitions, 954 flow [2023-08-26 12:05:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:05:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:05:37,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-26 12:05:37,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4713780918727915 [2023-08-26 12:05:37,342 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-26 12:05:37,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-26 12:05:37,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:37,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-26 12:05:37,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have 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:05:37,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:37,347 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 283.0) internal successors, (1698), 6 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have 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:05:37,347 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 478 flow. Second operand 5 states and 667 transitions. [2023-08-26 12:05:37,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 105 transitions, 954 flow [2023-08-26 12:05:37,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 105 transitions, 939 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:05:37,405 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 456 flow [2023-08-26 12:05:37,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=456, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-08-26 12:05:37,407 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 12:05:37,407 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 456 flow [2023-08-26 12:05:37,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have 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:05:37,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:37,408 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:05:37,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:05:37,408 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:37,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2075793467, now seen corresponding path program 1 times [2023-08-26 12:05:37,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:37,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831476076] [2023-08-26 12:05:37,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:37,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:37,565 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:05:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831476076] [2023-08-26 12:05:37,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831476076] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:37,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:37,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:37,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351236211] [2023-08-26 12:05:37,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:37,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:37,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:37,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:37,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:37,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:05:37,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 456 flow. Second operand has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have 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:05:37,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:37,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:05:37,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:38,454 INFO L124 PetriNetUnfolderBase]: 4320/6854 cut-off events. [2023-08-26 12:05:38,454 INFO L125 PetriNetUnfolderBase]: For 24592/25627 co-relation queries the response was YES. [2023-08-26 12:05:38,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28681 conditions, 6854 events. 4320/6854 cut-off events. For 24592/25627 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 44425 event pairs, 516 based on Foata normal form. 895/7525 useless extension candidates. Maximal degree in co-relation 28658. Up to 2958 conditions per place. [2023-08-26 12:05:38,495 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 114 selfloop transitions, 15 changer transitions 9/153 dead transitions. [2023-08-26 12:05:38,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 153 transitions, 1535 flow [2023-08-26 12:05:38,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:05:38,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:05:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 908 transitions. [2023-08-26 12:05:38,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45835436648157496 [2023-08-26 12:05:38,499 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 908 transitions. [2023-08-26 12:05:38,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 908 transitions. [2023-08-26 12:05:38,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:38,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 908 transitions. [2023-08-26 12:05:38,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:38,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:38,505 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:38,506 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 456 flow. Second operand 7 states and 908 transitions. [2023-08-26 12:05:38,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 153 transitions, 1535 flow [2023-08-26 12:05:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 153 transitions, 1481 flow, removed 15 selfloop flow, removed 4 redundant places. [2023-08-26 12:05:38,578 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 559 flow [2023-08-26 12:05:38,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=559, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-08-26 12:05:38,579 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-26 12:05:38,579 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 559 flow [2023-08-26 12:05:38,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.2) internal successors, (606), 5 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have 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:05:38,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:38,580 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:05:38,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:05:38,580 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:38,581 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1757656127, now seen corresponding path program 1 times [2023-08-26 12:05:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:38,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253903996] [2023-08-26 12:05:38,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:38,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:38,837 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:05:38,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:38,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253903996] [2023-08-26 12:05:38,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253903996] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:38,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:38,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:05:38,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189800036] [2023-08-26 12:05:38,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:38,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:05:38,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:38,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:05:38,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:05:38,842 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:05:38,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 559 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have 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:05:38,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:38,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:05:38,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:39,685 INFO L124 PetriNetUnfolderBase]: 3682/5913 cut-off events. [2023-08-26 12:05:39,685 INFO L125 PetriNetUnfolderBase]: For 23674/26093 co-relation queries the response was YES. [2023-08-26 12:05:39,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28403 conditions, 5913 events. 3682/5913 cut-off events. For 23674/26093 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 38525 event pairs, 245 based on Foata normal form. 887/6611 useless extension candidates. Maximal degree in co-relation 28380. Up to 2649 conditions per place. [2023-08-26 12:05:39,713 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 105 selfloop transitions, 23 changer transitions 42/184 dead transitions. [2023-08-26 12:05:39,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 184 transitions, 1873 flow [2023-08-26 12:05:39,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:05:39,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:05:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1167 transitions. [2023-08-26 12:05:39,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581861012956419 [2023-08-26 12:05:39,718 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1167 transitions. [2023-08-26 12:05:39,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1167 transitions. [2023-08-26 12:05:39,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:39,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1167 transitions. [2023-08-26 12:05:39,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.66666666666666) internal successors, (1167), 9 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have 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:05:39,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have 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:05:39,727 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 283.0) internal successors, (2830), 10 states have internal predecessors, (2830), 0 states have call successors, (0), 0 states have 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:05:39,727 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 559 flow. Second operand 9 states and 1167 transitions. [2023-08-26 12:05:39,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 184 transitions, 1873 flow [2023-08-26 12:05:40,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 184 transitions, 1824 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-08-26 12:05:40,039 INFO L231 Difference]: Finished difference. Result has 80 places, 69 transitions, 654 flow [2023-08-26 12:05:40,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=80, PETRI_TRANSITIONS=69} [2023-08-26 12:05:40,039 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2023-08-26 12:05:40,039 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 69 transitions, 654 flow [2023-08-26 12:05:40,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have 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:05:40,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:40,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:40,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:05:40,040 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:40,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1717382248, now seen corresponding path program 1 times [2023-08-26 12:05:40,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:40,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235613685] [2023-08-26 12:05:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:40,257 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:05:40,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:40,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235613685] [2023-08-26 12:05:40,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235613685] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:40,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:40,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:05:40,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986990035] [2023-08-26 12:05:40,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:40,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:05:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:05:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:05:40,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:05:40,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 69 transitions, 654 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have 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:05:40,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:40,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:05:40,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:40,973 INFO L124 PetriNetUnfolderBase]: 3451/5596 cut-off events. [2023-08-26 12:05:40,973 INFO L125 PetriNetUnfolderBase]: For 25344/26382 co-relation queries the response was YES. [2023-08-26 12:05:40,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27280 conditions, 5596 events. 3451/5596 cut-off events. For 25344/26382 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 37091 event pairs, 223 based on Foata normal form. 541/5950 useless extension candidates. Maximal degree in co-relation 27254. Up to 1687 conditions per place. [2023-08-26 12:05:40,992 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 62 selfloop transitions, 22 changer transitions 90/183 dead transitions. [2023-08-26 12:05:40,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 183 transitions, 1900 flow [2023-08-26 12:05:40,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:05:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:05:40,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1403 transitions. [2023-08-26 12:05:40,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45069065210407966 [2023-08-26 12:05:40,996 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1403 transitions. [2023-08-26 12:05:40,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1403 transitions. [2023-08-26 12:05:40,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:40,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1403 transitions. [2023-08-26 12:05:41,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 127.54545454545455) internal successors, (1403), 11 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have 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:05:41,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have 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:05:41,004 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 283.0) internal successors, (3396), 12 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have 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:05:41,004 INFO L175 Difference]: Start difference. First operand has 80 places, 69 transitions, 654 flow. Second operand 11 states and 1403 transitions. [2023-08-26 12:05:41,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 183 transitions, 1900 flow [2023-08-26 12:05:41,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 183 transitions, 1755 flow, removed 61 selfloop flow, removed 8 redundant places. [2023-08-26 12:05:41,320 INFO L231 Difference]: Finished difference. Result has 85 places, 51 transitions, 429 flow [2023-08-26 12:05:41,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=429, PETRI_PLACES=85, PETRI_TRANSITIONS=51} [2023-08-26 12:05:41,320 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 35 predicate places. [2023-08-26 12:05:41,320 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 51 transitions, 429 flow [2023-08-26 12:05:41,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have 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:05:41,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:41,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:41,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:05:41,321 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:41,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash -319853887, now seen corresponding path program 1 times [2023-08-26 12:05:41,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:41,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001838412] [2023-08-26 12:05:41,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:41,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:41,519 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:05:41,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:41,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001838412] [2023-08-26 12:05:41,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001838412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:41,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:41,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:05:41,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111124448] [2023-08-26 12:05:41,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:41,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:05:41,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:41,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:05:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:05:41,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 12:05:41,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 51 transitions, 429 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:41,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:41,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 12:05:41,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:41,754 INFO L124 PetriNetUnfolderBase]: 702/1217 cut-off events. [2023-08-26 12:05:41,754 INFO L125 PetriNetUnfolderBase]: For 4887/4887 co-relation queries the response was YES. [2023-08-26 12:05:41,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5911 conditions, 1217 events. 702/1217 cut-off events. For 4887/4887 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5807 event pairs, 108 based on Foata normal form. 1/1218 useless extension candidates. Maximal degree in co-relation 5886. Up to 670 conditions per place. [2023-08-26 12:05:41,760 INFO L140 encePairwiseOnDemand]: 272/283 looper letters, 63 selfloop transitions, 16 changer transitions 23/102 dead transitions. [2023-08-26 12:05:41,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 102 transitions, 1021 flow [2023-08-26 12:05:41,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:05:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:05:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-08-26 12:05:41,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43168433451118965 [2023-08-26 12:05:41,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-08-26 12:05:41,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-08-26 12:05:41,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:41,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-08-26 12:05:41,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have 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:05:41,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have 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:05:41,767 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 283.0) internal successors, (1981), 7 states have internal predecessors, (1981), 0 states have call successors, (0), 0 states have 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:05:41,767 INFO L175 Difference]: Start difference. First operand has 85 places, 51 transitions, 429 flow. Second operand 6 states and 733 transitions. [2023-08-26 12:05:41,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 102 transitions, 1021 flow [2023-08-26 12:05:41,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 102 transitions, 783 flow, removed 64 selfloop flow, removed 17 redundant places. [2023-08-26 12:05:41,782 INFO L231 Difference]: Finished difference. Result has 73 places, 55 transitions, 403 flow [2023-08-26 12:05:41,783 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=403, PETRI_PLACES=73, PETRI_TRANSITIONS=55} [2023-08-26 12:05:41,783 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-26 12:05:41,784 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 55 transitions, 403 flow [2023-08-26 12:05:41,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:05:41,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:41,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:41,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:05:41,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:41,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 722563205, now seen corresponding path program 2 times [2023-08-26 12:05:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737620129] [2023-08-26 12:05:41,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:41,959 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:05:41,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:41,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737620129] [2023-08-26 12:05:41,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737620129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:41,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:05:41,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700481817] [2023-08-26 12:05:41,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:41,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:05:41,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:41,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:05:41,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:05:41,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 283 [2023-08-26 12:05:41,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 55 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have 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:05:41,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:41,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 283 [2023-08-26 12:05:41,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:42,175 INFO L124 PetriNetUnfolderBase]: 474/817 cut-off events. [2023-08-26 12:05:42,176 INFO L125 PetriNetUnfolderBase]: For 2351/2351 co-relation queries the response was YES. [2023-08-26 12:05:42,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3559 conditions, 817 events. 474/817 cut-off events. For 2351/2351 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3270 event pairs, 51 based on Foata normal form. 1/818 useless extension candidates. Maximal degree in co-relation 3541. Up to 338 conditions per place. [2023-08-26 12:05:42,179 INFO L140 encePairwiseOnDemand]: 273/283 looper letters, 43 selfloop transitions, 7 changer transitions 54/104 dead transitions. [2023-08-26 12:05:42,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 104 transitions, 881 flow [2023-08-26 12:05:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:05:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:05:42,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2023-08-26 12:05:42,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4290762241292277 [2023-08-26 12:05:42,182 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2023-08-26 12:05:42,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2023-08-26 12:05:42,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:42,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2023-08-26 12:05:42,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have 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:05:42,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:42,188 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 283.0) internal successors, (2264), 8 states have internal predecessors, (2264), 0 states have call successors, (0), 0 states have 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:05:42,188 INFO L175 Difference]: Start difference. First operand has 73 places, 55 transitions, 403 flow. Second operand 7 states and 850 transitions. [2023-08-26 12:05:42,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 104 transitions, 881 flow [2023-08-26 12:05:42,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 104 transitions, 867 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-26 12:05:42,195 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 247 flow [2023-08-26 12:05:42,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=247, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2023-08-26 12:05:42,196 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 18 predicate places. [2023-08-26 12:05:42,196 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 247 flow [2023-08-26 12:05:42,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have 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:05:42,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:42,197 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:42,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:05:42,197 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:42,197 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:42,197 INFO L85 PathProgramCache]: Analyzing trace with hash -97191423, now seen corresponding path program 3 times [2023-08-26 12:05:42,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:42,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995296632] [2023-08-26 12:05:42,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:42,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:05:42,565 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:05:42,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:05:42,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995296632] [2023-08-26 12:05:42,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995296632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:05:42,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:05:42,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:05:42,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662175311] [2023-08-26 12:05:42,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:05:42,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:05:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:05:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:05:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:05:42,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 283 [2023-08-26 12:05:42,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 247 flow. Second operand has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:05:42,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:05:42,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 283 [2023-08-26 12:05:42,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:05:42,728 INFO L124 PetriNetUnfolderBase]: 108/220 cut-off events. [2023-08-26 12:05:42,729 INFO L125 PetriNetUnfolderBase]: For 879/884 co-relation queries the response was YES. [2023-08-26 12:05:42,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 220 events. 108/220 cut-off events. For 879/884 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 748 event pairs, 14 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 968. Up to 95 conditions per place. [2023-08-26 12:05:42,730 INFO L140 encePairwiseOnDemand]: 276/283 looper letters, 39 selfloop transitions, 4 changer transitions 23/70 dead transitions. [2023-08-26 12:05:42,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 586 flow [2023-08-26 12:05:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:05:42,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:05:42,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 981 transitions. [2023-08-26 12:05:42,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4333038869257951 [2023-08-26 12:05:42,733 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 981 transitions. [2023-08-26 12:05:42,733 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 981 transitions. [2023-08-26 12:05:42,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:05:42,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 981 transitions. [2023-08-26 12:05:42,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.625) internal successors, (981), 8 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have 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:05:42,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:05:42,738 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 283.0) internal successors, (2547), 9 states have internal predecessors, (2547), 0 states have call successors, (0), 0 states have 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:05:42,738 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 247 flow. Second operand 8 states and 981 transitions. [2023-08-26 12:05:42,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 586 flow [2023-08-26 12:05:42,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 468 flow, removed 11 selfloop flow, removed 19 redundant places. [2023-08-26 12:05:42,741 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 182 flow [2023-08-26 12:05:42,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2023-08-26 12:05:42,741 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-26 12:05:42,741 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 182 flow [2023-08-26 12:05:42,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 121.14285714285714) internal successors, (848), 7 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have 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:05:42,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:05:42,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:42,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:05:42,742 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P3Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2023-08-26 12:05:42,742 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:05:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 2577539, now seen corresponding path program 4 times [2023-08-26 12:05:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:05:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345012371] [2023-08-26 12:05:42,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:05:42,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:05:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:05:42,768 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:05:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:05:42,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:05:42,825 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:05:42,825 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining) [2023-08-26 12:05:42,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining) [2023-08-26 12:05:42,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2023-08-26 12:05:42,827 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2023-08-26 12:05:42,828 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining) [2023-08-26 12:05:42,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining) [2023-08-26 12:05:42,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining) [2023-08-26 12:05:42,829 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining) [2023-08-26 12:05:42,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:05:42,829 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:05:42,834 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:05:42,834 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:05:42,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:05:42 BasicIcfg [2023-08-26 12:05:42,894 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:05:42,894 INFO L158 Benchmark]: Toolchain (without parser) took 21324.19ms. Allocated memory was 377.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 352.4MB in the beginning and 1.3GB in the end (delta: -957.5MB). Peak memory consumption was 879.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,894 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 377.5MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:05:42,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.75ms. Allocated memory is still 377.5MB. Free memory was 352.0MB in the beginning and 329.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,895 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.80ms. Allocated memory is still 377.5MB. Free memory was 328.9MB in the beginning and 326.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,895 INFO L158 Benchmark]: Boogie Preprocessor took 32.00ms. Allocated memory is still 377.5MB. Free memory was 326.8MB in the beginning and 324.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,895 INFO L158 Benchmark]: RCFGBuilder took 675.96ms. Allocated memory is still 377.5MB. Free memory was 324.7MB in the beginning and 335.4MB in the end (delta: -10.6MB). Peak memory consumption was 22.9MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,895 INFO L158 Benchmark]: TraceAbstraction took 19973.73ms. Allocated memory was 377.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 334.4MB in the beginning and 1.3GB in the end (delta: -975.4MB). Peak memory consumption was 860.3MB. Max. memory is 16.0GB. [2023-08-26 12:05:42,897 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 377.5MB. Free memory is still 353.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 582.75ms. Allocated memory is still 377.5MB. Free memory was 352.0MB in the beginning and 329.4MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.80ms. Allocated memory is still 377.5MB. Free memory was 328.9MB in the beginning and 326.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.00ms. Allocated memory is still 377.5MB. Free memory was 326.8MB in the beginning and 324.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 675.96ms. Allocated memory is still 377.5MB. Free memory was 324.7MB in the beginning and 335.4MB in the end (delta: -10.6MB). Peak memory consumption was 22.9MB. Max. memory is 16.0GB. * TraceAbstraction took 19973.73ms. Allocated memory was 377.5MB in the beginning and 2.2GB in the end (delta: 1.8GB). Free memory was 334.4MB in the beginning and 1.3GB in the end (delta: -975.4MB). Peak memory consumption was 860.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 147 PlacesBefore, 50 PlacesAfterwards, 137 TransitionsBefore, 38 TransitionsAfterwards, 3184 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 2 ChoiceCompositions, 142 TotalNumberOfCompositions, 8173 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4126, independent: 3922, independent conditional: 0, independent unconditional: 3922, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1750, independent: 1719, independent conditional: 0, independent unconditional: 1719, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4126, independent: 2203, independent conditional: 0, independent unconditional: 2203, dependent: 173, dependent conditional: 0, dependent unconditional: 173, unknown: 1750, unknown conditional: 0, unknown unconditional: 1750] , Statistics on independence cache: Total cache size (in pairs): 162, Positive cache size: 148, Positive conditional cache size: 0, Positive unconditional cache size: 148, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=0, t1061={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=1, t1061={6:0}, t1062={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=2, t1061={6:0}, t1062={7:0}, t1063={8:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=3, t1061={6:0}, t1062={7:0}, t1063={8:0}, t1064={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={6:0}, t1062={7:0}, t1063={8:0}, t1064={5:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix040.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 175 locations, 15 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: 19.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 514 mSDsluCounter, 89 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1514 IncrementalHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 39 mSDtfsCounter, 1514 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=654occurred in iteration=10, InterpolantAutomatonStates: 87, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:05:42,921 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...