/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:09:55,172 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:09:55,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:09:55,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:09:55,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:09:55,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:09:55,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:09:55,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:09:55,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:09:55,305 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:09:55,306 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:09:55,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:09:55,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:09:55,308 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:09:55,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:09:55,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:09:55,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:09:55,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:09:55,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:09:55,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:09:55,309 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:09:55,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:09:55,310 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:09:55,311 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:09:55,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:09:55,311 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:09:55,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:09:55,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:55,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:09:55,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:09:55,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:09:55,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:09:55,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:09:55,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:09:55,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:09:55,314 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:09:55,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:09:55,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:09:55,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:09:55,643 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:09:55,643 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:09:55,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 12:09:56,906 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:09:57,209 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:09:57,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_rmo.oepc.i [2023-08-26 12:09:57,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cd2544a/8cd26e10e8e44add9778deefc8332f83/FLAG8d600792d [2023-08-26 12:09:57,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cd2544a/8cd26e10e8e44add9778deefc8332f83 [2023-08-26 12:09:57,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:09:57,241 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:09:57,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:57,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:09:57,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:09:57,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ea4efc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57, skipping insertion in model container [2023-08-26 12:09:57,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,290 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:09:57,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:57,699 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:09:57,725 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:57,726 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:09:57,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:57,831 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:57,831 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:57,837 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:09:57,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57 WrapperNode [2023-08-26 12:09:57,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:57,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:57,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:09:57,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:09:57,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,878 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,910 INFO L138 Inliner]: procedures = 176, calls = 83, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-26 12:09:57,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:57,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:09:57,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:09:57,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:09:57,920 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,943 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,945 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,949 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:09:57,950 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:09:57,950 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:09:57,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:09:57,951 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (1/1) ... [2023-08-26 12:09:57,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:57,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:09:57,980 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 12:09:57,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 12:09:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 12:09:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:09:58,011 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:09:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:09:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:09:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:09:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:09:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:09:58,012 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:09:58,012 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:09:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 12:09:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 12:09:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:09:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:09:58,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:09:58,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:09:58,015 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:09:58,210 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:09:58,212 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:09:58,714 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:09:59,369 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:09:59,370 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:09:59,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:59 BoogieIcfgContainer [2023-08-26 12:09:59,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:09:59,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:09:59,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:09:59,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:09:59,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:09:57" (1/3) ... [2023-08-26 12:09:59,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a43c1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:59, skipping insertion in model container [2023-08-26 12:09:59,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:57" (2/3) ... [2023-08-26 12:09:59,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a43c1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:59, skipping insertion in model container [2023-08-26 12:09:59,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:59" (3/3) ... [2023-08-26 12:09:59,380 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_rmo.oepc.i [2023-08-26 12:09:59,401 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:09:59,401 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-08-26 12:09:59,401 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:09:59,526 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:09:59,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 188 transitions, 391 flow [2023-08-26 12:09:59,670 INFO L124 PetriNetUnfolderBase]: 3/185 cut-off events. [2023-08-26 12:09:59,671 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:59,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 3/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 349 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:09:59,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 188 transitions, 391 flow [2023-08-26 12:09:59,686 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 185 transitions, 379 flow [2023-08-26 12:09:59,689 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:09:59,700 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 192 places, 185 transitions, 379 flow [2023-08-26 12:09:59,703 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 192 places, 185 transitions, 379 flow [2023-08-26 12:09:59,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 185 transitions, 379 flow [2023-08-26 12:09:59,744 INFO L124 PetriNetUnfolderBase]: 3/185 cut-off events. [2023-08-26 12:09:59,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:59,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 3/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 129. Up to 2 conditions per place. [2023-08-26 12:09:59,750 INFO L119 LiptonReduction]: Number of co-enabled transitions 8612 [2023-08-26 12:10:19,669 INFO L134 LiptonReduction]: Checked pairs total: 44570 [2023-08-26 12:10:19,669 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-26 12:10:19,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:10:19,689 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;@6c87ab66, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:10:19,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 100 error locations. [2023-08-26 12:10:19,690 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:10:19,691 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:10:19,691 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:19,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:19,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:10:19,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:19,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1203, now seen corresponding path program 1 times [2023-08-26 12:10:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514867956] [2023-08-26 12:10:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:19,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:19,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514867956] [2023-08-26 12:10:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514867956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:10:19,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651089899] [2023-08-26 12:10:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:10:19,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:19,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:10:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:10:19,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 341 [2023-08-26 12:10:19,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 88 transitions, 185 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:19,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:19,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 341 [2023-08-26 12:10:19,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:23,791 INFO L124 PetriNetUnfolderBase]: 16294/23361 cut-off events. [2023-08-26 12:10:23,791 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 12:10:23,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46288 conditions, 23361 events. 16294/23361 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2272. Compared 167648 event pairs, 16294 based on Foata normal form. 400/9766 useless extension candidates. Maximal degree in co-relation 46277. Up to 22831 conditions per place. [2023-08-26 12:10:23,970 INFO L140 encePairwiseOnDemand]: 303/341 looper letters, 43 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-26 12:10:23,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:23,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:10:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:10:23,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 331 transitions. [2023-08-26 12:10:23,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48533724340175954 [2023-08-26 12:10:23,985 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 331 transitions. [2023-08-26 12:10:23,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 331 transitions. [2023-08-26 12:10:23,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:23,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 331 transitions. [2023-08-26 12:10:23,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 165.5) internal successors, (331), 2 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,996 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 341.0) internal successors, (1023), 3 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:23,998 INFO L175 Difference]: Start difference. First operand has 97 places, 88 transitions, 185 flow. Second operand 2 states and 331 transitions. [2023-08-26 12:10:23,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 195 flow [2023-08-26 12:10:24,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:24,006 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:24,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-26 12:10:24,012 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -39 predicate places. [2023-08-26 12:10:24,013 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-26 12:10:24,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:24,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:24,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:10:24,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:24,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1189666, now seen corresponding path program 1 times [2023-08-26 12:10:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:24,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665328019] [2023-08-26 12:10:24,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:24,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:24,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:24,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:24,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665328019] [2023-08-26 12:10:24,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665328019] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:24,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:24,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:24,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925138750] [2023-08-26 12:10:24,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:24,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 341 [2023-08-26 12:10:24,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:24,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:24,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 341 [2023-08-26 12:10:24,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:26,280 INFO L124 PetriNetUnfolderBase]: 9290/13304 cut-off events. [2023-08-26 12:10:26,280 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:26,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26524 conditions, 13304 events. 9290/13304 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 78516 event pairs, 9290 based on Foata normal form. 0/7124 useless extension candidates. Maximal degree in co-relation 26521. Up to 13143 conditions per place. [2023-08-26 12:10:26,355 INFO L140 encePairwiseOnDemand]: 330/341 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-26 12:10:26,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 162 flow [2023-08-26 12:10:26,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:26,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-26 12:10:26,361 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3548387096774194 [2023-08-26 12:10:26,361 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-26 12:10:26,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-26 12:10:26,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:26,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-26 12:10:26,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,368 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,368 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 363 transitions. [2023-08-26 12:10:26,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 162 flow [2023-08-26 12:10:26,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:10:26,373 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 88 flow [2023-08-26 12:10:26,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-26 12:10:26,374 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:10:26,375 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 88 flow [2023-08-26 12:10:26,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:26,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 12:10:26,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:10:26,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:26,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1189678, now seen corresponding path program 1 times [2023-08-26 12:10:26,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:26,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307280013] [2023-08-26 12:10:26,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:26,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:26,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:26,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307280013] [2023-08-26 12:10:26,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307280013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:26,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:26,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:26,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985925225] [2023-08-26 12:10:26,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:26,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:26,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:26,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:26,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:26,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 341 [2023-08-26 12:10:26,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:26,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:26,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 341 [2023-08-26 12:10:26,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:27,519 INFO L124 PetriNetUnfolderBase]: 4162/6471 cut-off events. [2023-08-26 12:10:27,520 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:10:27,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12909 conditions, 6471 events. 4162/6471 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 39772 event pairs, 2573 based on Foata normal form. 0/5246 useless extension candidates. Maximal degree in co-relation 12905. Up to 3816 conditions per place. [2023-08-26 12:10:27,551 INFO L140 encePairwiseOnDemand]: 320/341 looper letters, 37 selfloop transitions, 10 changer transitions 1/49 dead transitions. [2023-08-26 12:10:27,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 49 transitions, 202 flow [2023-08-26 12:10:27,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-26 12:10:27,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35386119257087 [2023-08-26 12:10:27,553 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-26 12:10:27,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-26 12:10:27,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:27,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-26 12:10:27,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,557 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 88 flow. Second operand 3 states and 362 transitions. [2023-08-26 12:10:27,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 49 transitions, 202 flow [2023-08-26 12:10:27,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 49 transitions, 201 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:27,559 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 167 flow [2023-08-26 12:10:27,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 12:10:27,560 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:10:27,560 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 167 flow [2023-08-26 12:10:27,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:27,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:27,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:10:27,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:27,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:27,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1344831344, now seen corresponding path program 1 times [2023-08-26 12:10:27,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:27,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112072946] [2023-08-26 12:10:27,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:27,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:27,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:27,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:27,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112072946] [2023-08-26 12:10:27,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112072946] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:27,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:27,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:27,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22967530] [2023-08-26 12:10:27,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:27,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:27,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:27,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:27,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:27,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 341 [2023-08-26 12:10:27,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:27,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:27,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 341 [2023-08-26 12:10:27,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:28,873 INFO L124 PetriNetUnfolderBase]: 4703/7446 cut-off events. [2023-08-26 12:10:28,873 INFO L125 PetriNetUnfolderBase]: For 2637/2684 co-relation queries the response was YES. [2023-08-26 12:10:28,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20382 conditions, 7446 events. 4703/7446 cut-off events. For 2637/2684 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 46205 event pairs, 2059 based on Foata normal form. 23/6951 useless extension candidates. Maximal degree in co-relation 20377. Up to 6395 conditions per place. [2023-08-26 12:10:28,912 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 55 selfloop transitions, 5 changer transitions 0/67 dead transitions. [2023-08-26 12:10:28,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 365 flow [2023-08-26 12:10:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:28,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 12:10:28,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2023-08-26 12:10:28,914 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 12:10:28,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 12:10:28,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:28,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 12:10:28,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:28,917 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:28,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:28,918 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 167 flow. Second operand 3 states and 414 transitions. [2023-08-26 12:10:28,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 365 flow [2023-08-26 12:10:28,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:28,944 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 184 flow [2023-08-26 12:10:28,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-26 12:10:28,945 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -47 predicate places. [2023-08-26 12:10:28,945 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 184 flow [2023-08-26 12:10:28,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:28,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:28,946 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:28,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:10:28,946 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:28,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1344830978, now seen corresponding path program 1 times [2023-08-26 12:10:28,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:28,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179076871] [2023-08-26 12:10:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:28,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179076871] [2023-08-26 12:10:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179076871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:29,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876441382] [2023-08-26 12:10:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:29,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:29,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-26 12:10:29,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:29,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-26 12:10:29,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:29,890 INFO L124 PetriNetUnfolderBase]: 4349/7002 cut-off events. [2023-08-26 12:10:29,891 INFO L125 PetriNetUnfolderBase]: For 1972/2074 co-relation queries the response was YES. [2023-08-26 12:10:29,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18662 conditions, 7002 events. 4349/7002 cut-off events. For 1972/2074 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 45385 event pairs, 2107 based on Foata normal form. 18/5842 useless extension candidates. Maximal degree in co-relation 18656. Up to 4059 conditions per place. [2023-08-26 12:10:29,928 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 67 selfloop transitions, 3 changer transitions 0/79 dead transitions. [2023-08-26 12:10:29,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 441 flow [2023-08-26 12:10:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:29,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-26 12:10:29,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173998044965787 [2023-08-26 12:10:29,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-26 12:10:29,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-26 12:10:29,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:29,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-26 12:10:29,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,935 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 184 flow. Second operand 3 states and 427 transitions. [2023-08-26 12:10:29,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 441 flow [2023-08-26 12:10:29,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:29,939 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 192 flow [2023-08-26 12:10:29,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2023-08-26 12:10:29,941 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -45 predicate places. [2023-08-26 12:10:29,941 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 192 flow [2023-08-26 12:10:29,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:29,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:29,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:29,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:10:29,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:29,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:29,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1259903137, now seen corresponding path program 1 times [2023-08-26 12:10:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:29,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446844845] [2023-08-26 12:10:29,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:29,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:30,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:30,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:30,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446844845] [2023-08-26 12:10:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446844845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:30,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949108814] [2023-08-26 12:10:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:30,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:10:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:10:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:10:30,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 341 [2023-08-26 12:10:30,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:30,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:30,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 341 [2023-08-26 12:10:30,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:31,269 INFO L124 PetriNetUnfolderBase]: 5006/8078 cut-off events. [2023-08-26 12:10:31,269 INFO L125 PetriNetUnfolderBase]: For 2474/2474 co-relation queries the response was YES. [2023-08-26 12:10:31,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23297 conditions, 8078 events. 5006/8078 cut-off events. For 2474/2474 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 53002 event pairs, 1758 based on Foata normal form. 0/7313 useless extension candidates. Maximal degree in co-relation 23290. Up to 5176 conditions per place. [2023-08-26 12:10:31,311 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 63 selfloop transitions, 6 changer transitions 0/71 dead transitions. [2023-08-26 12:10:31,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 406 flow [2023-08-26 12:10:31,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:31,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-26 12:10:31,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3291788856304985 [2023-08-26 12:10:31,317 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-26 12:10:31,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-26 12:10:31,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:31,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-26 12:10:31,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,323 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,323 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 192 flow. Second operand 4 states and 449 transitions. [2023-08-26 12:10:31,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 406 flow [2023-08-26 12:10:31,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:31,327 INFO L231 Difference]: Finished difference. Result has 53 places, 50 transitions, 217 flow [2023-08-26 12:10:31,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=53, PETRI_TRANSITIONS=50} [2023-08-26 12:10:31,329 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -44 predicate places. [2023-08-26 12:10:31,332 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 50 transitions, 217 flow [2023-08-26 12:10:31,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:31,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:31,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:31,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:10:31,333 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:31,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:31,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1259903136, now seen corresponding path program 1 times [2023-08-26 12:10:31,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:31,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785060040] [2023-08-26 12:10:31,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:31,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:32,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:32,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785060040] [2023-08-26 12:10:32,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785060040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:32,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:32,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:32,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555574313] [2023-08-26 12:10:32,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:32,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:32,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:32,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 341 [2023-08-26 12:10:32,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 50 transitions, 217 flow. Second operand has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:32,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:32,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 341 [2023-08-26 12:10:32,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:33,363 INFO L124 PetriNetUnfolderBase]: 4899/7888 cut-off events. [2023-08-26 12:10:33,364 INFO L125 PetriNetUnfolderBase]: For 4514/4514 co-relation queries the response was YES. [2023-08-26 12:10:33,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24182 conditions, 7888 events. 4899/7888 cut-off events. For 4514/4514 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 50205 event pairs, 1727 based on Foata normal form. 74/7197 useless extension candidates. Maximal degree in co-relation 24174. Up to 4233 conditions per place. [2023-08-26 12:10:33,417 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 98 selfloop transitions, 9 changer transitions 0/109 dead transitions. [2023-08-26 12:10:33,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 663 flow [2023-08-26 12:10:33,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:10:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:10:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 826 transitions. [2023-08-26 12:10:33,421 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3027859237536657 [2023-08-26 12:10:33,421 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 826 transitions. [2023-08-26 12:10:33,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 826 transitions. [2023-08-26 12:10:33,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:33,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 826 transitions. [2023-08-26 12:10:33,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 103.25) internal successors, (826), 8 states have internal predecessors, (826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:33,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:33,428 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:33,429 INFO L175 Difference]: Start difference. First operand has 53 places, 50 transitions, 217 flow. Second operand 8 states and 826 transitions. [2023-08-26 12:10:33,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 663 flow [2023-08-26 12:10:33,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 649 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 12:10:33,443 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 235 flow [2023-08-26 12:10:33,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=235, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-08-26 12:10:33,443 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -41 predicate places. [2023-08-26 12:10:33,444 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 235 flow [2023-08-26 12:10:33,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:33,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:33,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:33,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:10:33,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:33,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:33,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1594450091, now seen corresponding path program 1 times [2023-08-26 12:10:33,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:33,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061686438] [2023-08-26 12:10:33,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:33,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:33,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061686438] [2023-08-26 12:10:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061686438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474271756] [2023-08-26 12:10:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:34,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:10:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:34,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:10:34,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:10:34,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 341 [2023-08-26 12:10:34,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 235 flow. Second operand has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:34,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:34,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 341 [2023-08-26 12:10:34,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:35,278 INFO L124 PetriNetUnfolderBase]: 4849/7829 cut-off events. [2023-08-26 12:10:35,278 INFO L125 PetriNetUnfolderBase]: For 4641/4641 co-relation queries the response was YES. [2023-08-26 12:10:35,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23750 conditions, 7829 events. 4849/7829 cut-off events. For 4641/4641 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 50261 event pairs, 2716 based on Foata normal form. 3/7064 useless extension candidates. Maximal degree in co-relation 23743. Up to 7378 conditions per place. [2023-08-26 12:10:35,328 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 77 selfloop transitions, 24 changer transitions 0/103 dead transitions. [2023-08-26 12:10:35,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 103 transitions, 673 flow [2023-08-26 12:10:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:35,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 710 transitions. [2023-08-26 12:10:35,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29744449099287806 [2023-08-26 12:10:35,332 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 710 transitions. [2023-08-26 12:10:35,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 710 transitions. [2023-08-26 12:10:35,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:35,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 710 transitions. [2023-08-26 12:10:35,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.42857142857143) internal successors, (710), 7 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,339 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 235 flow. Second operand 7 states and 710 transitions. [2023-08-26 12:10:35,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 103 transitions, 673 flow [2023-08-26 12:10:35,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 103 transitions, 666 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:35,354 INFO L231 Difference]: Finished difference. Result has 64 places, 73 transitions, 430 flow [2023-08-26 12:10:35,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=430, PETRI_PLACES=64, PETRI_TRANSITIONS=73} [2023-08-26 12:10:35,356 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -33 predicate places. [2023-08-26 12:10:35,356 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 73 transitions, 430 flow [2023-08-26 12:10:35,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.71428571428571) internal successors, (649), 7 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,356 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:35,357 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:35,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:10:35,357 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:35,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:35,357 INFO L85 PathProgramCache]: Analyzing trace with hash 316380510, now seen corresponding path program 1 times [2023-08-26 12:10:35,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:35,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640826048] [2023-08-26 12:10:35,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:35,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:35,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:35,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:35,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640826048] [2023-08-26 12:10:35,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640826048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:35,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:35,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:10:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719419765] [2023-08-26 12:10:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:35,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:35,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:35,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:35,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-26 12:10:35,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 73 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:35,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:35,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-26 12:10:35,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:36,687 INFO L124 PetriNetUnfolderBase]: 6478/10361 cut-off events. [2023-08-26 12:10:36,687 INFO L125 PetriNetUnfolderBase]: For 11730/12120 co-relation queries the response was YES. [2023-08-26 12:10:36,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32769 conditions, 10361 events. 6478/10361 cut-off events. For 11730/12120 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 73072 event pairs, 2002 based on Foata normal form. 120/9488 useless extension candidates. Maximal degree in co-relation 32759. Up to 5786 conditions per place. [2023-08-26 12:10:36,732 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 80 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2023-08-26 12:10:36,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 716 flow [2023-08-26 12:10:36,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 12:10:36,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4095796676441838 [2023-08-26 12:10:36,734 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 12:10:36,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 12:10:36,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:36,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 12:10:36,736 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:10:36,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:36,738 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:36,738 INFO L175 Difference]: Start difference. First operand has 64 places, 73 transitions, 430 flow. Second operand 3 states and 419 transitions. [2023-08-26 12:10:36,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 716 flow [2023-08-26 12:10:36,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 103 transitions, 709 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:36,821 INFO L231 Difference]: Finished difference. Result has 66 places, 74 transitions, 440 flow [2023-08-26 12:10:36,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=66, PETRI_TRANSITIONS=74} [2023-08-26 12:10:36,822 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -31 predicate places. [2023-08-26 12:10:36,822 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 74 transitions, 440 flow [2023-08-26 12:10:36,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:36,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:36,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:36,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:10:36,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:36,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1357013678, now seen corresponding path program 1 times [2023-08-26 12:10:36,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:36,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178544301] [2023-08-26 12:10:36,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:36,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:37,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:37,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178544301] [2023-08-26 12:10:37,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178544301] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:37,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:37,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:37,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083393848] [2023-08-26 12:10:37,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:37,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:37,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:37,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:37,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:37,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 341 [2023-08-26 12:10:37,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 74 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:37,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:37,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 341 [2023-08-26 12:10:37,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:38,152 INFO L124 PetriNetUnfolderBase]: 5780/9550 cut-off events. [2023-08-26 12:10:38,152 INFO L125 PetriNetUnfolderBase]: For 10757/10879 co-relation queries the response was YES. [2023-08-26 12:10:38,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30383 conditions, 9550 events. 5780/9550 cut-off events. For 10757/10879 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 68283 event pairs, 1938 based on Foata normal form. 34/8732 useless extension candidates. Maximal degree in co-relation 30371. Up to 6660 conditions per place. [2023-08-26 12:10:38,231 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 71 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-26 12:10:38,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 98 transitions, 734 flow [2023-08-26 12:10:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2023-08-26 12:10:38,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046920821114369 [2023-08-26 12:10:38,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 414 transitions. [2023-08-26 12:10:38,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 414 transitions. [2023-08-26 12:10:38,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:38,234 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 414 transitions. [2023-08-26 12:10:38,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:38,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:38,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:38,237 INFO L175 Difference]: Start difference. First operand has 66 places, 74 transitions, 440 flow. Second operand 3 states and 414 transitions. [2023-08-26 12:10:38,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 98 transitions, 734 flow [2023-08-26 12:10:38,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 98 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:38,337 INFO L231 Difference]: Finished difference. Result has 68 places, 74 transitions, 454 flow [2023-08-26 12:10:38,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=68, PETRI_TRANSITIONS=74} [2023-08-26 12:10:38,339 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -29 predicate places. [2023-08-26 12:10:38,339 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 74 transitions, 454 flow [2023-08-26 12:10:38,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:38,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:38,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 12:10:38,340 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:38,340 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1304159458, now seen corresponding path program 1 times [2023-08-26 12:10:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:38,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20985332] [2023-08-26 12:10:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:38,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:38,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20985332] [2023-08-26 12:10:38,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20985332] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:38,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:38,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:10:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389394840] [2023-08-26 12:10:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:38,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:10:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:38,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:10:38,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:10:38,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 341 [2023-08-26 12:10:38,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 74 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:38,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:38,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 341 [2023-08-26 12:10:38,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:39,660 INFO L124 PetriNetUnfolderBase]: 6270/10179 cut-off events. [2023-08-26 12:10:39,660 INFO L125 PetriNetUnfolderBase]: For 13367/13528 co-relation queries the response was YES. [2023-08-26 12:10:39,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33867 conditions, 10179 events. 6270/10179 cut-off events. For 13367/13528 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 70855 event pairs, 3331 based on Foata normal form. 77/9377 useless extension candidates. Maximal degree in co-relation 33854. Up to 8560 conditions per place. [2023-08-26 12:10:39,718 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 83 selfloop transitions, 5 changer transitions 1/109 dead transitions. [2023-08-26 12:10:39,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 109 transitions, 840 flow [2023-08-26 12:10:39,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:10:39,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:10:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-08-26 12:10:39,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40762463343108507 [2023-08-26 12:10:39,719 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-08-26 12:10:39,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-08-26 12:10:39,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:39,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-08-26 12:10:39,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:39,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:39,722 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:39,722 INFO L175 Difference]: Start difference. First operand has 68 places, 74 transitions, 454 flow. Second operand 3 states and 417 transitions. [2023-08-26 12:10:39,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 109 transitions, 840 flow [2023-08-26 12:10:39,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:10:39,791 INFO L231 Difference]: Finished difference. Result has 69 places, 75 transitions, 469 flow [2023-08-26 12:10:39,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=469, PETRI_PLACES=69, PETRI_TRANSITIONS=75} [2023-08-26 12:10:39,791 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -28 predicate places. [2023-08-26 12:10:39,791 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 75 transitions, 469 flow [2023-08-26 12:10:39,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:39,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:39,792 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:39,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 12:10:39,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:39,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash -402211426, now seen corresponding path program 1 times [2023-08-26 12:10:39,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:39,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860309521] [2023-08-26 12:10:39,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:39,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:39,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860309521] [2023-08-26 12:10:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860309521] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:39,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:39,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:10:39,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299920008] [2023-08-26 12:10:39,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:39,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:10:39,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:39,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:10:39,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:10:39,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 341 [2023-08-26 12:10:39,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 75 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:39,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:39,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 341 [2023-08-26 12:10:39,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:40,918 INFO L124 PetriNetUnfolderBase]: 5243/8457 cut-off events. [2023-08-26 12:10:40,918 INFO L125 PetriNetUnfolderBase]: For 10388/10448 co-relation queries the response was YES. [2023-08-26 12:10:40,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28755 conditions, 8457 events. 5243/8457 cut-off events. For 10388/10448 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 55897 event pairs, 2204 based on Foata normal form. 117/8067 useless extension candidates. Maximal degree in co-relation 28741. Up to 2968 conditions per place. [2023-08-26 12:10:40,971 INFO L140 encePairwiseOnDemand]: 324/341 looper letters, 84 selfloop transitions, 20 changer transitions 0/107 dead transitions. [2023-08-26 12:10:40,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 107 transitions, 871 flow [2023-08-26 12:10:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:10:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:10:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 454 transitions. [2023-08-26 12:10:40,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33284457478005863 [2023-08-26 12:10:40,973 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 454 transitions. [2023-08-26 12:10:40,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 454 transitions. [2023-08-26 12:10:40,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:40,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 454 transitions. [2023-08-26 12:10:40,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.5) internal successors, (454), 4 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:40,977 INFO L175 Difference]: Start difference. First operand has 69 places, 75 transitions, 469 flow. Second operand 4 states and 454 transitions. [2023-08-26 12:10:40,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 107 transitions, 871 flow [2023-08-26 12:10:41,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 856 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:41,085 INFO L231 Difference]: Finished difference. Result has 73 places, 85 transitions, 631 flow [2023-08-26 12:10:41,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=73, PETRI_TRANSITIONS=85} [2023-08-26 12:10:41,086 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -24 predicate places. [2023-08-26 12:10:41,086 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 85 transitions, 631 flow [2023-08-26 12:10:41,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:41,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:41,087 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 12:10:41,087 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:41,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:41,087 INFO L85 PathProgramCache]: Analyzing trace with hash 64988045, now seen corresponding path program 1 times [2023-08-26 12:10:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:41,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664786963] [2023-08-26 12:10:41,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:41,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:43,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664786963] [2023-08-26 12:10:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664786963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 12:10:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256728007] [2023-08-26 12:10:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 12:10:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 12:10:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 12:10:43,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 341 [2023-08-26 12:10:43,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 85 transitions, 631 flow. Second operand has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:43,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:43,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 341 [2023-08-26 12:10:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:45,238 INFO L124 PetriNetUnfolderBase]: 8269/13169 cut-off events. [2023-08-26 12:10:45,238 INFO L125 PetriNetUnfolderBase]: For 20582/20718 co-relation queries the response was YES. [2023-08-26 12:10:45,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49354 conditions, 13169 events. 8269/13169 cut-off events. For 20582/20718 co-relation queries the response was YES. Maximal size of possible extension queue 858. Compared 92803 event pairs, 2216 based on Foata normal form. 65/12976 useless extension candidates. Maximal degree in co-relation 49339. Up to 8583 conditions per place. [2023-08-26 12:10:45,328 INFO L140 encePairwiseOnDemand]: 322/341 looper letters, 146 selfloop transitions, 80 changer transitions 2/231 dead transitions. [2023-08-26 12:10:45,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 231 transitions, 1955 flow [2023-08-26 12:10:45,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 12:10:45,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 12:10:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1108 transitions. [2023-08-26 12:10:45,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2953878965609171 [2023-08-26 12:10:45,332 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1108 transitions. [2023-08-26 12:10:45,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1108 transitions. [2023-08-26 12:10:45,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:45,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1108 transitions. [2023-08-26 12:10:45,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 100.72727272727273) internal successors, (1108), 11 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:45,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:45,340 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:45,340 INFO L175 Difference]: Start difference. First operand has 73 places, 85 transitions, 631 flow. Second operand 11 states and 1108 transitions. [2023-08-26 12:10:45,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 231 transitions, 1955 flow [2023-08-26 12:10:45,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 231 transitions, 1942 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:45,567 INFO L231 Difference]: Finished difference. Result has 87 places, 151 transitions, 1442 flow [2023-08-26 12:10:45,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1442, PETRI_PLACES=87, PETRI_TRANSITIONS=151} [2023-08-26 12:10:45,567 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2023-08-26 12:10:45,567 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 151 transitions, 1442 flow [2023-08-26 12:10:45,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 88.75) internal successors, (710), 8 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:45,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:45,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:45,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 12:10:45,568 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:45,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:45,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1150793027, now seen corresponding path program 2 times [2023-08-26 12:10:45,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:45,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418329014] [2023-08-26 12:10:45,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:46,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418329014] [2023-08-26 12:10:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418329014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:46,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:10:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741795152] [2023-08-26 12:10:46,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:46,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:10:46,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:10:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:10:46,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 341 [2023-08-26 12:10:46,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 151 transitions, 1442 flow. Second operand has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:46,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:46,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 341 [2023-08-26 12:10:46,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:48,450 INFO L124 PetriNetUnfolderBase]: 12541/20102 cut-off events. [2023-08-26 12:10:48,450 INFO L125 PetriNetUnfolderBase]: For 60151/60480 co-relation queries the response was YES. [2023-08-26 12:10:48,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88777 conditions, 20102 events. 12541/20102 cut-off events. For 60151/60480 co-relation queries the response was YES. Maximal size of possible extension queue 1404. Compared 154199 event pairs, 3691 based on Foata normal form. 122/19862 useless extension candidates. Maximal degree in co-relation 88755. Up to 9841 conditions per place. [2023-08-26 12:10:48,636 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 232 selfloop transitions, 43 changer transitions 0/278 dead transitions. [2023-08-26 12:10:48,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 278 transitions, 3084 flow [2023-08-26 12:10:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:10:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:10:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 722 transitions. [2023-08-26 12:10:48,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3024717218265605 [2023-08-26 12:10:48,639 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 722 transitions. [2023-08-26 12:10:48,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 722 transitions. [2023-08-26 12:10:48,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:48,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 722 transitions. [2023-08-26 12:10:48,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.14285714285714) internal successors, (722), 7 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:48,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:48,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:48,644 INFO L175 Difference]: Start difference. First operand has 87 places, 151 transitions, 1442 flow. Second operand 7 states and 722 transitions. [2023-08-26 12:10:48,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 278 transitions, 3084 flow [2023-08-26 12:10:49,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 278 transitions, 2939 flow, removed 72 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:49,789 INFO L231 Difference]: Finished difference. Result has 96 places, 179 transitions, 1763 flow [2023-08-26 12:10:49,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1763, PETRI_PLACES=96, PETRI_TRANSITIONS=179} [2023-08-26 12:10:49,790 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -1 predicate places. [2023-08-26 12:10:49,790 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 179 transitions, 1763 flow [2023-08-26 12:10:49,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.0) internal successors, (658), 7 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:49,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:49,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 12:10:49,791 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:49,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:49,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1281841479, now seen corresponding path program 3 times [2023-08-26 12:10:49,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:49,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435178058] [2023-08-26 12:10:49,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:51,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435178058] [2023-08-26 12:10:51,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435178058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:51,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:51,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-26 12:10:51,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977742235] [2023-08-26 12:10:51,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:51,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-26 12:10:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-26 12:10:51,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-26 12:10:51,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 341 [2023-08-26 12:10:51,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 179 transitions, 1763 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 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:10:51,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:51,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 341 [2023-08-26 12:10:51,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:10:54,602 INFO L124 PetriNetUnfolderBase]: 14937/24116 cut-off events. [2023-08-26 12:10:54,602 INFO L125 PetriNetUnfolderBase]: For 76248/76541 co-relation queries the response was YES. [2023-08-26 12:10:54,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108687 conditions, 24116 events. 14937/24116 cut-off events. For 76248/76541 co-relation queries the response was YES. Maximal size of possible extension queue 1794. Compared 193155 event pairs, 4244 based on Foata normal form. 119/23764 useless extension candidates. Maximal degree in co-relation 108661. Up to 12464 conditions per place. [2023-08-26 12:10:54,807 INFO L140 encePairwiseOnDemand]: 331/341 looper letters, 243 selfloop transitions, 114 changer transitions 8/368 dead transitions. [2023-08-26 12:10:54,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 368 transitions, 4208 flow [2023-08-26 12:10:54,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 12:10:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 12:10:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 906 transitions. [2023-08-26 12:10:54,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29521016617790813 [2023-08-26 12:10:54,810 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 906 transitions. [2023-08-26 12:10:54,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 906 transitions. [2023-08-26 12:10:54,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:10:54,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 906 transitions. [2023-08-26 12:10:54,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.66666666666667) internal successors, (906), 9 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,816 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:54,816 INFO L175 Difference]: Start difference. First operand has 96 places, 179 transitions, 1763 flow. Second operand 9 states and 906 transitions. [2023-08-26 12:10:54,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 368 transitions, 4208 flow [2023-08-26 12:10:56,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 368 transitions, 4199 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-26 12:10:56,031 INFO L231 Difference]: Finished difference. Result has 108 places, 244 transitions, 3011 flow [2023-08-26 12:10:56,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1754, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3011, PETRI_PLACES=108, PETRI_TRANSITIONS=244} [2023-08-26 12:10:56,032 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 11 predicate places. [2023-08-26 12:10:56,032 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 244 transitions, 3011 flow [2023-08-26 12:10:56,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 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:10:56,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:10:56,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:10:56,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 12:10:56,033 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:10:56,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:10:56,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1035772113, now seen corresponding path program 1 times [2023-08-26 12:10:56,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:10:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531727597] [2023-08-26 12:10:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:10:56,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:10:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:10:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:10:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:10:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531727597] [2023-08-26 12:10:56,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531727597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:10:56,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:10:56,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:10:56,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77621307] [2023-08-26 12:10:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:10:56,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:10:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:10:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:10:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:10:56,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 341 [2023-08-26 12:10:56,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 244 transitions, 3011 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:10:56,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:10:56,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 341 [2023-08-26 12:10:56,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:01,598 INFO L124 PetriNetUnfolderBase]: 16688/26957 cut-off events. [2023-08-26 12:11:01,598 INFO L125 PetriNetUnfolderBase]: For 151110/151499 co-relation queries the response was YES. [2023-08-26 12:11:01,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138316 conditions, 26957 events. 16688/26957 cut-off events. For 151110/151499 co-relation queries the response was YES. Maximal size of possible extension queue 1994. Compared 218515 event pairs, 7003 based on Foata normal form. 240/26456 useless extension candidates. Maximal degree in co-relation 138284. Up to 21154 conditions per place. [2023-08-26 12:11:01,858 INFO L140 encePairwiseOnDemand]: 331/341 looper letters, 290 selfloop transitions, 58 changer transitions 2/365 dead transitions. [2023-08-26 12:11:01,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 365 transitions, 4910 flow [2023-08-26 12:11:01,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:01,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:01,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2023-08-26 12:11:01,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36656891495601174 [2023-08-26 12:11:01,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 625 transitions. [2023-08-26 12:11:01,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 625 transitions. [2023-08-26 12:11:01,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:01,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 625 transitions. [2023-08-26 12:11:01,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,865 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:01,866 INFO L175 Difference]: Start difference. First operand has 108 places, 244 transitions, 3011 flow. Second operand 5 states and 625 transitions. [2023-08-26 12:11:01,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 365 transitions, 4910 flow [2023-08-26 12:11:03,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 365 transitions, 4843 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:03,978 INFO L231 Difference]: Finished difference. Result has 113 places, 272 transitions, 3555 flow [2023-08-26 12:11:03,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2962, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3555, PETRI_PLACES=113, PETRI_TRANSITIONS=272} [2023-08-26 12:11:03,980 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 16 predicate places. [2023-08-26 12:11:03,980 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 272 transitions, 3555 flow [2023-08-26 12:11:03,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:03,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:03,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:03,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 12:11:03,981 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:03,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:03,981 INFO L85 PathProgramCache]: Analyzing trace with hash 416348371, now seen corresponding path program 1 times [2023-08-26 12:11:03,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:03,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86930518] [2023-08-26 12:11:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:03,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:04,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:04,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86930518] [2023-08-26 12:11:04,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86930518] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:04,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:04,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:11:04,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007562487] [2023-08-26 12:11:04,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:04,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 12:11:04,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:04,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 12:11:04,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-26 12:11:04,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 341 [2023-08-26 12:11:04,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 272 transitions, 3555 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:04,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:04,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 341 [2023-08-26 12:11:04,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:07,765 INFO L124 PetriNetUnfolderBase]: 12683/20686 cut-off events. [2023-08-26 12:11:07,766 INFO L125 PetriNetUnfolderBase]: For 119460/119689 co-relation queries the response was YES. [2023-08-26 12:11:07,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108076 conditions, 20686 events. 12683/20686 cut-off events. For 119460/119689 co-relation queries the response was YES. Maximal size of possible extension queue 1406. Compared 162351 event pairs, 4326 based on Foata normal form. 656/21004 useless extension candidates. Maximal degree in co-relation 108040. Up to 8601 conditions per place. [2023-08-26 12:11:07,960 INFO L140 encePairwiseOnDemand]: 324/341 looper letters, 299 selfloop transitions, 63 changer transitions 2/367 dead transitions. [2023-08-26 12:11:07,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 367 transitions, 5415 flow [2023-08-26 12:11:07,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:11:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:11:07,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 647 transitions. [2023-08-26 12:11:07,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31622678396871945 [2023-08-26 12:11:07,963 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 647 transitions. [2023-08-26 12:11:07,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 647 transitions. [2023-08-26 12:11:07,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:07,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 647 transitions. [2023-08-26 12:11:07,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:07,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:07,968 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 341.0) internal successors, (2387), 7 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:07,968 INFO L175 Difference]: Start difference. First operand has 113 places, 272 transitions, 3555 flow. Second operand 6 states and 647 transitions. [2023-08-26 12:11:07,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 367 transitions, 5415 flow [2023-08-26 12:11:09,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 367 transitions, 5306 flow, removed 35 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:09,063 INFO L231 Difference]: Finished difference. Result has 119 places, 292 transitions, 4056 flow [2023-08-26 12:11:09,063 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3493, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4056, PETRI_PLACES=119, PETRI_TRANSITIONS=292} [2023-08-26 12:11:09,063 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 22 predicate places. [2023-08-26 12:11:09,064 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 292 transitions, 4056 flow [2023-08-26 12:11:09,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:09,064 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:09,064 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:09,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 12:11:09,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:09,065 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:09,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1535426138, now seen corresponding path program 1 times [2023-08-26 12:11:09,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:09,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412390055] [2023-08-26 12:11:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:09,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:10,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:10,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412390055] [2023-08-26 12:11:10,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412390055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:10,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:10,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:10,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558112702] [2023-08-26 12:11:10,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:10,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:11:10,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:10,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:11:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:11:10,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 341 [2023-08-26 12:11:10,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 292 transitions, 4056 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 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:11:10,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:10,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 341 [2023-08-26 12:11:10,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:15,502 INFO L124 PetriNetUnfolderBase]: 17023/28211 cut-off events. [2023-08-26 12:11:15,502 INFO L125 PetriNetUnfolderBase]: For 191234/191696 co-relation queries the response was YES. [2023-08-26 12:11:15,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154160 conditions, 28211 events. 17023/28211 cut-off events. For 191234/191696 co-relation queries the response was YES. Maximal size of possible extension queue 2050. Compared 239715 event pairs, 4909 based on Foata normal form. 217/27620 useless extension candidates. Maximal degree in co-relation 154123. Up to 15706 conditions per place. [2023-08-26 12:11:15,785 INFO L140 encePairwiseOnDemand]: 332/341 looper letters, 303 selfloop transitions, 130 changer transitions 0/448 dead transitions. [2023-08-26 12:11:15,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 448 transitions, 6914 flow [2023-08-26 12:11:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 621 transitions. [2023-08-26 12:11:15,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36422287390029323 [2023-08-26 12:11:15,788 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 621 transitions. [2023-08-26 12:11:15,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 621 transitions. [2023-08-26 12:11:15,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:15,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 621 transitions. [2023-08-26 12:11:15,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.2) internal successors, (621), 5 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:15,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:15,792 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:15,792 INFO L175 Difference]: Start difference. First operand has 119 places, 292 transitions, 4056 flow. Second operand 5 states and 621 transitions. [2023-08-26 12:11:15,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 448 transitions, 6914 flow [2023-08-26 12:11:18,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 448 transitions, 6798 flow, removed 17 selfloop flow, removed 3 redundant places. [2023-08-26 12:11:18,393 INFO L231 Difference]: Finished difference. Result has 122 places, 350 transitions, 5203 flow [2023-08-26 12:11:18,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3997, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=5203, PETRI_PLACES=122, PETRI_TRANSITIONS=350} [2023-08-26 12:11:18,393 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 25 predicate places. [2023-08-26 12:11:18,394 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 350 transitions, 5203 flow [2023-08-26 12:11:18,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 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:11:18,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:18,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:18,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 12:11:18,394 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:18,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:18,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1638476478, now seen corresponding path program 2 times [2023-08-26 12:11:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020183759] [2023-08-26 12:11:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:19,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:19,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020183759] [2023-08-26 12:11:19,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020183759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:19,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:19,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:19,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078468645] [2023-08-26 12:11:19,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:19,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:19,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:19,579 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 341 [2023-08-26 12:11:19,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 350 transitions, 5203 flow. Second operand has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:19,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:19,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 341 [2023-08-26 12:11:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:25,780 INFO L124 PetriNetUnfolderBase]: 19356/32015 cut-off events. [2023-08-26 12:11:25,780 INFO L125 PetriNetUnfolderBase]: For 229102/229354 co-relation queries the response was YES. [2023-08-26 12:11:25,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184376 conditions, 32015 events. 19356/32015 cut-off events. For 229102/229354 co-relation queries the response was YES. Maximal size of possible extension queue 2378. Compared 277044 event pairs, 4170 based on Foata normal form. 794/32186 useless extension candidates. Maximal degree in co-relation 184336. Up to 11053 conditions per place. [2023-08-26 12:11:26,047 INFO L140 encePairwiseOnDemand]: 321/341 looper letters, 155 selfloop transitions, 373 changer transitions 160/691 dead transitions. [2023-08-26 12:11:26,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 691 transitions, 11592 flow [2023-08-26 12:11:26,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-26 12:11:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-26 12:11:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1422 transitions. [2023-08-26 12:11:26,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29786342689568496 [2023-08-26 12:11:26,051 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1422 transitions. [2023-08-26 12:11:26,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1422 transitions. [2023-08-26 12:11:26,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:26,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1422 transitions. [2023-08-26 12:11:26,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 101.57142857142857) internal successors, (1422), 14 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:26,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:26,060 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:26,060 INFO L175 Difference]: Start difference. First operand has 122 places, 350 transitions, 5203 flow. Second operand 14 states and 1422 transitions. [2023-08-26 12:11:26,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 691 transitions, 11592 flow [2023-08-26 12:11:29,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 691 transitions, 11565 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-26 12:11:29,138 INFO L231 Difference]: Finished difference. Result has 140 places, 444 transitions, 7901 flow [2023-08-26 12:11:29,138 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=5186, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=7901, PETRI_PLACES=140, PETRI_TRANSITIONS=444} [2023-08-26 12:11:29,139 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 43 predicate places. [2023-08-26 12:11:29,139 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 444 transitions, 7901 flow [2023-08-26 12:11:29,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.66666666666667) internal successors, (825), 9 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:29,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:29,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:29,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 12:11:29,139 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:29,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:29,140 INFO L85 PathProgramCache]: Analyzing trace with hash 21900208, now seen corresponding path program 1 times [2023-08-26 12:11:29,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:29,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469155798] [2023-08-26 12:11:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:29,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:29,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:29,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469155798] [2023-08-26 12:11:29,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469155798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:29,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:29,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:11:29,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968730328] [2023-08-26 12:11:29,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:29,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:11:29,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:29,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:11:29,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:11:29,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 341 [2023-08-26 12:11:29,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 444 transitions, 7901 flow. Second operand has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:29,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:29,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 341 [2023-08-26 12:11:29,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:34,024 INFO L124 PetriNetUnfolderBase]: 13514/22211 cut-off events. [2023-08-26 12:11:34,024 INFO L125 PetriNetUnfolderBase]: For 203235/203458 co-relation queries the response was YES. [2023-08-26 12:11:34,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135131 conditions, 22211 events. 13514/22211 cut-off events. For 203235/203458 co-relation queries the response was YES. Maximal size of possible extension queue 1463. Compared 179275 event pairs, 2695 based on Foata normal form. 901/22994 useless extension candidates. Maximal degree in co-relation 135085. Up to 11078 conditions per place. [2023-08-26 12:11:34,162 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 104 selfloop transitions, 16 changer transitions 434/556 dead transitions. [2023-08-26 12:11:34,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 556 transitions, 10603 flow [2023-08-26 12:11:34,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:11:34,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:11:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2023-08-26 12:11:34,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2987536656891496 [2023-08-26 12:11:34,164 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2023-08-26 12:11:34,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2023-08-26 12:11:34,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:34,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2023-08-26 12:11:34,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:34,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:34,169 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 341.0) internal successors, (3069), 9 states have internal predecessors, (3069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:34,169 INFO L175 Difference]: Start difference. First operand has 140 places, 444 transitions, 7901 flow. Second operand 8 states and 815 transitions. [2023-08-26 12:11:34,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 556 transitions, 10603 flow [2023-08-26 12:11:37,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 556 transitions, 10095 flow, removed 157 selfloop flow, removed 5 redundant places. [2023-08-26 12:11:37,479 INFO L231 Difference]: Finished difference. Result has 135 places, 101 transitions, 1514 flow [2023-08-26 12:11:37,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=7337, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1514, PETRI_PLACES=135, PETRI_TRANSITIONS=101} [2023-08-26 12:11:37,479 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 38 predicate places. [2023-08-26 12:11:37,480 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 101 transitions, 1514 flow [2023-08-26 12:11:37,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.66666666666667) internal successors, (852), 9 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:37,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:37,480 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:37,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 12:11:37,481 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:37,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:37,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1613445460, now seen corresponding path program 1 times [2023-08-26 12:11:37,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115366353] [2023-08-26 12:11:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:37,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:37,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115366353] [2023-08-26 12:11:37,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115366353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:37,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:37,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:11:37,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991697780] [2023-08-26 12:11:37,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:37,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:11:37,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:37,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:11:37,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:11:37,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 12:11:37,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 101 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:37,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:37,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 12:11:37,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:37,969 INFO L124 PetriNetUnfolderBase]: 909/1689 cut-off events. [2023-08-26 12:11:37,970 INFO L125 PetriNetUnfolderBase]: For 20832/21009 co-relation queries the response was YES. [2023-08-26 12:11:37,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9914 conditions, 1689 events. 909/1689 cut-off events. For 20832/21009 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10239 event pairs, 165 based on Foata normal form. 102/1752 useless extension candidates. Maximal degree in co-relation 9871. Up to 1287 conditions per place. [2023-08-26 12:11:37,980 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 100 selfloop transitions, 4 changer transitions 3/141 dead transitions. [2023-08-26 12:11:37,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 141 transitions, 2202 flow [2023-08-26 12:11:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:11:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:11:37,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-26 12:11:37,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38514173998044965 [2023-08-26 12:11:37,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-26 12:11:37,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-26 12:11:37,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:37,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-26 12:11:37,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:37,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:37,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 341.0) internal successors, (1364), 4 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:37,984 INFO L175 Difference]: Start difference. First operand has 135 places, 101 transitions, 1514 flow. Second operand 3 states and 394 transitions. [2023-08-26 12:11:37,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 141 transitions, 2202 flow [2023-08-26 12:11:38,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 141 transitions, 1911 flow, removed 60 selfloop flow, removed 20 redundant places. [2023-08-26 12:11:38,015 INFO L231 Difference]: Finished difference. Result has 92 places, 99 transitions, 1244 flow [2023-08-26 12:11:38,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1244, PETRI_PLACES=92, PETRI_TRANSITIONS=99} [2023-08-26 12:11:38,016 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -5 predicate places. [2023-08-26 12:11:38,016 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 99 transitions, 1244 flow [2023-08-26 12:11:38,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:38,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:38,016 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:38,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-26 12:11:38,017 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:38,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:38,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2016653068, now seen corresponding path program 1 times [2023-08-26 12:11:38,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:38,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190712148] [2023-08-26 12:11:38,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:38,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:39,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190712148] [2023-08-26 12:11:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190712148] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-26 12:11:39,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42987012] [2023-08-26 12:11:39,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:39,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 12:11:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:39,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 12:11:39,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-26 12:11:39,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 341 [2023-08-26 12:11:39,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 99 transitions, 1244 flow. Second operand has 11 states, 11 states have (on average 85.54545454545455) internal successors, (941), 11 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:39,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:39,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 341 [2023-08-26 12:11:39,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:40,007 INFO L124 PetriNetUnfolderBase]: 1050/1859 cut-off events. [2023-08-26 12:11:40,007 INFO L125 PetriNetUnfolderBase]: For 16243/16255 co-relation queries the response was YES. [2023-08-26 12:11:40,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10897 conditions, 1859 events. 1050/1859 cut-off events. For 16243/16255 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 10509 event pairs, 285 based on Foata normal form. 5/1844 useless extension candidates. Maximal degree in co-relation 10867. Up to 877 conditions per place. [2023-08-26 12:11:40,018 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 73 selfloop transitions, 42 changer transitions 0/117 dead transitions. [2023-08-26 12:11:40,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 117 transitions, 1586 flow [2023-08-26 12:11:40,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:11:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:11:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 629 transitions. [2023-08-26 12:11:40,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2635106828655216 [2023-08-26 12:11:40,020 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 629 transitions. [2023-08-26 12:11:40,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 629 transitions. [2023-08-26 12:11:40,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:40,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 629 transitions. [2023-08-26 12:11:40,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 89.85714285714286) internal successors, (629), 7 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,022 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,023 INFO L175 Difference]: Start difference. First operand has 92 places, 99 transitions, 1244 flow. Second operand 7 states and 629 transitions. [2023-08-26 12:11:40,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 117 transitions, 1586 flow [2023-08-26 12:11:40,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 117 transitions, 1558 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-26 12:11:40,035 INFO L231 Difference]: Finished difference. Result has 97 places, 99 transitions, 1341 flow [2023-08-26 12:11:40,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1341, PETRI_PLACES=97, PETRI_TRANSITIONS=99} [2023-08-26 12:11:40,036 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places. [2023-08-26 12:11:40,036 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 99 transitions, 1341 flow [2023-08-26 12:11:40,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 85.54545454545455) internal successors, (941), 11 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:40,036 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-26 12:11:40,037 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:40,037 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 257530005, now seen corresponding path program 1 times [2023-08-26 12:11:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846315896] [2023-08-26 12:11:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:40,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:40,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846315896] [2023-08-26 12:11:40,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846315896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:11:40,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281062649] [2023-08-26 12:11:40,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:40,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:11:40,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:40,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:11:40,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:11:40,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 12:11:40,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 99 transitions, 1341 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:40,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 12:11:40,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:40,420 INFO L124 PetriNetUnfolderBase]: 475/992 cut-off events. [2023-08-26 12:11:40,420 INFO L125 PetriNetUnfolderBase]: For 7622/7678 co-relation queries the response was YES. [2023-08-26 12:11:40,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5439 conditions, 992 events. 475/992 cut-off events. For 7622/7678 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5872 event pairs, 53 based on Foata normal form. 124/1095 useless extension candidates. Maximal degree in co-relation 5409. Up to 360 conditions per place. [2023-08-26 12:11:40,425 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 108 selfloop transitions, 7 changer transitions 3/148 dead transitions. [2023-08-26 12:11:40,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 148 transitions, 2101 flow [2023-08-26 12:11:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 12:11:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 12:11:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 524 transitions. [2023-08-26 12:11:40,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3841642228739003 [2023-08-26 12:11:40,427 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 524 transitions. [2023-08-26 12:11:40,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 524 transitions. [2023-08-26 12:11:40,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:40,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 524 transitions. [2023-08-26 12:11:40,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,429 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,429 INFO L175 Difference]: Start difference. First operand has 97 places, 99 transitions, 1341 flow. Second operand 4 states and 524 transitions. [2023-08-26 12:11:40,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 148 transitions, 2101 flow [2023-08-26 12:11:40,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 148 transitions, 1898 flow, removed 16 selfloop flow, removed 12 redundant places. [2023-08-26 12:11:40,441 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 1134 flow [2023-08-26 12:11:40,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1134, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2023-08-26 12:11:40,442 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -8 predicate places. [2023-08-26 12:11:40,442 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 1134 flow [2023-08-26 12:11:40,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:40,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-26 12:11:40,442 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:40,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -102729529, now seen corresponding path program 1 times [2023-08-26 12:11:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:40,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941731838] [2023-08-26 12:11:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:11:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 12:11:40,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:11:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941731838] [2023-08-26 12:11:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941731838] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:11:40,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:11:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:11:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715624192] [2023-08-26 12:11:40,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:11:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:11:40,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:11:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:11:40,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:11:40,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 341 [2023-08-26 12:11:40,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 1134 flow. Second operand has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:11:40,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 341 [2023-08-26 12:11:40,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:11:40,896 INFO L124 PetriNetUnfolderBase]: 401/829 cut-off events. [2023-08-26 12:11:40,896 INFO L125 PetriNetUnfolderBase]: For 5267/5315 co-relation queries the response was YES. [2023-08-26 12:11:40,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4700 conditions, 829 events. 401/829 cut-off events. For 5267/5315 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 4866 event pairs, 44 based on Foata normal form. 58/869 useless extension candidates. Maximal degree in co-relation 4674. Up to 358 conditions per place. [2023-08-26 12:11:40,901 INFO L140 encePairwiseOnDemand]: 336/341 looper letters, 57 selfloop transitions, 10 changer transitions 69/148 dead transitions. [2023-08-26 12:11:40,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 148 transitions, 1926 flow [2023-08-26 12:11:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:11:40,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:11:40,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 644 transitions. [2023-08-26 12:11:40,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37771260997067446 [2023-08-26 12:11:40,904 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 644 transitions. [2023-08-26 12:11:40,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 644 transitions. [2023-08-26 12:11:40,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:11:40,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 644 transitions. [2023-08-26 12:11:40,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,909 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 1134 flow. Second operand 5 states and 644 transitions. [2023-08-26 12:11:40,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 148 transitions, 1926 flow [2023-08-26 12:11:40,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1747 flow, removed 32 selfloop flow, removed 7 redundant places. [2023-08-26 12:11:40,919 INFO L231 Difference]: Finished difference. Result has 87 places, 53 transitions, 532 flow [2023-08-26 12:11:40,919 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=87, PETRI_TRANSITIONS=53} [2023-08-26 12:11:40,919 INFO L281 CegarLoopForPetriNet]: 97 programPoint places, -10 predicate places. [2023-08-26 12:11:40,920 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 53 transitions, 532 flow [2023-08-26 12:11:40,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:11:40,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:11:40,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:40,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-26 12:11:40,920 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 97 more)] === [2023-08-26 12:11:40,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:11:40,920 INFO L85 PathProgramCache]: Analyzing trace with hash -169700026, now seen corresponding path program 1 times [2023-08-26 12:11:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:11:40,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003966880] [2023-08-26 12:11:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:11:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:11:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:41,005 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:11:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:11:41,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:11:41,136 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:11:41,137 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (99 of 100 remaining) [2023-08-26 12:11:41,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 100 remaining) [2023-08-26 12:11:41,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 100 remaining) [2023-08-26 12:11:41,139 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 100 remaining) [2023-08-26 12:11:41,140 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 100 remaining) [2023-08-26 12:11:41,141 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 100 remaining) [2023-08-26 12:11:41,142 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 100 remaining) [2023-08-26 12:11:41,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 100 remaining) [2023-08-26 12:11:41,144 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 100 remaining) [2023-08-26 12:11:41,145 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 100 remaining) [2023-08-26 12:11:41,146 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 100 remaining) [2023-08-26 12:11:41,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 100 remaining) [2023-08-26 12:11:41,147 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 100 remaining) [2023-08-26 12:11:41,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-26 12:11:41,147 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:11:41,153 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:11:41,153 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:11:41,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:11:41 BasicIcfg [2023-08-26 12:11:41,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:11:41,252 INFO L158 Benchmark]: Toolchain (without parser) took 104011.03ms. Allocated memory was 358.6MB in the beginning and 9.4GB in the end (delta: 9.0GB). Free memory was 333.4MB in the beginning and 6.9GB in the end (delta: -6.5GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 12:11:41,252 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 334.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:11:41,252 INFO L158 Benchmark]: CACSL2BoogieTranslator took 596.11ms. Allocated memory is still 358.6MB. Free memory was 332.9MB in the beginning and 307.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:41,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.63ms. Allocated memory is still 358.6MB. Free memory was 307.2MB in the beginning and 304.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:11:41,252 INFO L158 Benchmark]: Boogie Preprocessor took 37.32ms. Allocated memory is still 358.6MB. Free memory was 304.6MB in the beginning and 302.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:41,253 INFO L158 Benchmark]: RCFGBuilder took 1421.65ms. Allocated memory was 358.6MB in the beginning and 484.4MB in the end (delta: 125.8MB). Free memory was 302.0MB in the beginning and 428.5MB in the end (delta: -126.5MB). Peak memory consumption was 71.2MB. Max. memory is 16.0GB. [2023-08-26 12:11:41,253 INFO L158 Benchmark]: TraceAbstraction took 101876.82ms. Allocated memory was 484.4MB in the beginning and 9.4GB in the end (delta: 8.9GB). Free memory was 428.5MB in the beginning and 6.9GB in the end (delta: -6.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-26 12:11:41,254 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.15ms. Allocated memory is still 358.6MB. Free memory is still 334.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 596.11ms. Allocated memory is still 358.6MB. Free memory was 332.9MB in the beginning and 307.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 72.63ms. Allocated memory is still 358.6MB. Free memory was 307.2MB in the beginning and 304.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.32ms. Allocated memory is still 358.6MB. Free memory was 304.6MB in the beginning and 302.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 1421.65ms. Allocated memory was 358.6MB in the beginning and 484.4MB in the end (delta: 125.8MB). Free memory was 302.0MB in the beginning and 428.5MB in the end (delta: -126.5MB). Peak memory consumption was 71.2MB. Max. memory is 16.0GB. * TraceAbstraction took 101876.82ms. Allocated memory was 484.4MB in the beginning and 9.4GB in the end (delta: 8.9GB). Free memory was 428.5MB in the beginning and 6.9GB in the end (delta: -6.4GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.0s, 192 PlacesBefore, 97 PlacesAfterwards, 185 TransitionsBefore, 88 TransitionsAfterwards, 8612 CoEnabledTransitionPairs, 7 FixpointIterations, 62 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 153 TotalNumberOfCompositions, 44570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10000, independent: 9303, independent conditional: 0, independent unconditional: 9303, dependent: 697, dependent conditional: 0, dependent unconditional: 697, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3178, independent: 3059, independent conditional: 0, independent unconditional: 3059, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 10000, independent: 6244, independent conditional: 0, independent unconditional: 6244, dependent: 578, dependent conditional: 0, dependent unconditional: 578, unknown: 3178, unknown conditional: 0, unknown unconditional: 3178] , Statistics on independence cache: Total cache size (in pairs): 482, Positive cache size: 429, Positive conditional cache size: 0, Positive unconditional cache size: 429, Negative cache size: 53, Negative conditional cache size: 0, Negative unconditional cache size: 53, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p2_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1813; [L851] FCALL, FORK 0 pthread_create(&t1813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1813, ((void *)0), P0, ((void *)0))=-1, t1813={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] EXPR 1 \read(y) [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 pthread_t t1814; [L853] FCALL, FORK 0 pthread_create(&t1814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1814, ((void *)0), P1, ((void *)0))=0, t1813={6:0}, t1814={7:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L854] 0 pthread_t t1815; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L789] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L792] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] FCALL, FORK 0 pthread_create(&t1815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1815, ((void *)0), P2, ((void *)0))=1, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 y$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(y) [L812] 3 y$mem_tmp = y [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] EXPR 3 \read(y) [L813] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L813] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L814] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L815] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L816] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L817] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L819] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L825] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L828] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L861] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1813={6:0}, t1814={7:0}, t1815={5:0}, weak$$choice1=0, weak$$choice2=255, x=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 y$flush_delayed = weak$$choice2 [L871] EXPR 0 \read(y) [L871] 0 y$mem_tmp = y [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] EXPR 0 \read(y) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L872] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L873] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L874] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L875] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L876] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L878] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L880] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L880] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L880] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 x == 2 && y == 2 [L881] EXPR 0 \read(y) [L881] EXPR 0 x == 2 && y == 2 [L881] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] EXPR 0 \read(y) [L882] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L882] 0 y = y$flush_delayed ? y$mem_tmp : y [L883] 0 y$flush_delayed = (_Bool)0 [L885] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe001_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 248 locations, 100 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: 101.6s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 67.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 20.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1059 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1059 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 388 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2615 IncrementalHoareTripleChecker+Invalid, 3003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 388 mSolverCounterUnsat, 31 mSDtfsCounter, 2615 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7901occurred in iteration=19, InterpolantAutomatonStates: 130, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 325 NumberOfCodeBlocks, 325 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 3468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:11:41,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...