/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:22:19,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:22:19,854 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 18:22:19,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:22:19,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:22:19,882 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:22:19,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:22:19,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:22:19,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:22:19,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:22:19,886 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:22:19,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:22:19,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:22:19,887 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:22:19,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:22:19,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:22:19,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:22:19,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:22:19,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:22:19,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:22:19,888 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:22:19,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:22:19,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:22:19,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:22:19,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:22:19,889 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:22:19,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:22:19,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:22:19,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:22:19,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:22:19,891 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 18:22:20,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:22:20,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:22:20,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:22:20,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:22:20,151 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:22:20,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-26 18:22:21,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:22:21,325 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:22:21,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe009_power.oepc.i [2023-08-26 18:22:21,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e667468fa/347084c5fbb7403c894d5c5900336b69/FLAGb146528de [2023-08-26 18:22:21,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e667468fa/347084c5fbb7403c894d5c5900336b69 [2023-08-26 18:22:21,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:22:21,351 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:22:21,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:22:21,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:22:21,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:22:21,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e50b8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21, skipping insertion in model container [2023-08-26 18:22:21,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,385 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:22:21,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:22:21,705 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:22:21,727 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:22:21,729 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 18:22:21,773 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:22:21,799 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:22:21,799 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:22:21,804 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:22:21,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21 WrapperNode [2023-08-26 18:22:21,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:22:21,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:22:21,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:22:21,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:22:21,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,862 INFO L138 Inliner]: procedures = 176, calls = 77, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-08-26 18:22:21,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:22:21,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:22:21,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:22:21,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:22:21,869 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:22:21,913 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:22:21,913 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:22:21,913 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:22:21,914 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (1/1) ... [2023-08-26 18:22:21,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:22:21,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:22:21,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 18:22:21,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 18:22:21,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:22:21,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:22:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:22:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:22:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:22:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:22:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:22:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:22:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:22:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:22:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:22:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:22:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:22:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:22:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:22:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:22:21,972 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 18:22:22,105 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:22:22,106 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:22:22,449 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:22:22,982 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:22:22,982 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:22:22,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:22:22 BoogieIcfgContainer [2023-08-26 18:22:22,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:22:22,985 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:22:22,985 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:22:22,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:22:22,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:22:21" (1/3) ... [2023-08-26 18:22:22,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482a9ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:22:22, skipping insertion in model container [2023-08-26 18:22:22,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:22:21" (2/3) ... [2023-08-26 18:22:22,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@482a9ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:22:22, skipping insertion in model container [2023-08-26 18:22:22,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:22:22" (3/3) ... [2023-08-26 18:22:22,989 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_power.oepc.i [2023-08-26 18:22:23,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:22:23,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-08-26 18:22:23,000 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:22:23,100 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:22:23,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 179 transitions, 373 flow [2023-08-26 18:22:23,206 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-08-26 18:22:23,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:22:23,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 305 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-26 18:22:23,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 179 transitions, 373 flow [2023-08-26 18:22:23,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 176 transitions, 361 flow [2023-08-26 18:22:23,224 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:22:23,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 176 transitions, 361 flow [2023-08-26 18:22:23,236 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 176 transitions, 361 flow [2023-08-26 18:22:23,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 176 transitions, 361 flow [2023-08-26 18:22:23,283 INFO L124 PetriNetUnfolderBase]: 3/176 cut-off events. [2023-08-26 18:22:23,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:22:23,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 176 events. 3/176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 306 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2023-08-26 18:22:23,287 INFO L119 LiptonReduction]: Number of co-enabled transitions 7232 [2023-08-26 18:22:41,516 INFO L134 LiptonReduction]: Checked pairs total: 43519 [2023-08-26 18:22:41,516 INFO L136 LiptonReduction]: Total number of compositions: 151 [2023-08-26 18:22:41,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:22:41,532 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;@c35f2e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:22:41,532 INFO L358 AbstractCegarLoop]: Starting to check reachability of 84 error locations. [2023-08-26 18:22:41,533 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:22:41,533 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 18:22:41,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:22:41,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:41,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:22:41,534 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:41,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1181, now seen corresponding path program 1 times [2023-08-26 18:22:41,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:41,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810737754] [2023-08-26 18:22:41,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:41,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810737754] [2023-08-26 18:22:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810737754] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:22:41,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915882066] [2023-08-26 18:22:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:41,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:22:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:22:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:22:41,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 330 [2023-08-26 18:22:41,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 171 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 18:22:41,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:41,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 330 [2023-08-26 18:22:41,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:44,654 INFO L124 PetriNetUnfolderBase]: 15264/21832 cut-off events. [2023-08-26 18:22:44,654 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-26 18:22:44,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43329 conditions, 21832 events. 15264/21832 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2221. Compared 151101 event pairs, 15264 based on Foata normal form. 0/9092 useless extension candidates. Maximal degree in co-relation 43318. Up to 21401 conditions per place. [2023-08-26 18:22:44,755 INFO L140 encePairwiseOnDemand]: 298/330 looper letters, 42 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-26 18:22:44,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 187 flow [2023-08-26 18:22:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:22:44,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:22:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 324 transitions. [2023-08-26 18:22:44,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2023-08-26 18:22:44,767 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 324 transitions. [2023-08-26 18:22:44,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 324 transitions. [2023-08-26 18:22:44,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:44,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 324 transitions. [2023-08-26 18:22:44,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 162.0) internal successors, (324), 2 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:44,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:44,775 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 330.0) internal successors, (990), 3 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:44,776 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 171 flow. Second operand 2 states and 324 transitions. [2023-08-26 18:22:44,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 187 flow [2023-08-26 18:22:44,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:22:44,781 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2023-08-26 18:22:44,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-08-26 18:22:44,784 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -34 predicate places. [2023-08-26 18:22:44,784 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2023-08-26 18:22:44,785 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 18:22:44,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:44,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:22:44,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:22:44,785 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:44,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:44,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1168874, now seen corresponding path program 1 times [2023-08-26 18:22:44,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:44,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709528441] [2023-08-26 18:22:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:44,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:44,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:44,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709528441] [2023-08-26 18:22:44,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709528441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:44,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:44,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:22:44,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177076655] [2023-08-26 18:22:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:44,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:22:44,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:22:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:22:44,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 330 [2023-08-26 18:22:44,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 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 18:22:44,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:44,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 330 [2023-08-26 18:22:44,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:47,092 INFO L124 PetriNetUnfolderBase]: 11628/17099 cut-off events. [2023-08-26 18:22:47,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:22:47,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34183 conditions, 17099 events. 11628/17099 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 110324 event pairs, 7867 based on Foata normal form. 0/9695 useless extension candidates. Maximal degree in co-relation 34180. Up to 11418 conditions per place. [2023-08-26 18:22:47,157 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 52 selfloop transitions, 9 changer transitions 0/62 dead transitions. [2023-08-26 18:22:47,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 252 flow [2023-08-26 18:22:47,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-26 18:22:47,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2023-08-26 18:22:47,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-26 18:22:47,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-26 18:22:47,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:47,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-26 18:22:47,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 18:22:47,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:47,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:47,163 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 374 transitions. [2023-08-26 18:22:47,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 252 flow [2023-08-26 18:22:47,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 62 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:22:47,164 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 172 flow [2023-08-26 18:22:47,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-26 18:22:47,165 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -33 predicate places. [2023-08-26 18:22:47,165 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 172 flow [2023-08-26 18:22:47,165 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 18:22:47,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:47,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:22:47,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:22:47,166 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:47,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:47,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1168875, now seen corresponding path program 1 times [2023-08-26 18:22:47,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:47,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982135387] [2023-08-26 18:22:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:47,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:47,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:47,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982135387] [2023-08-26 18:22:47,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982135387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:47,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:47,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:22:47,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865775299] [2023-08-26 18:22:47,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:47,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:22:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:47,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:22:47,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:22:47,248 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 330 [2023-08-26 18:22:47,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 172 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 18:22:47,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:47,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 330 [2023-08-26 18:22:47,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:47,947 INFO L124 PetriNetUnfolderBase]: 2959/4719 cut-off events. [2023-08-26 18:22:47,947 INFO L125 PetriNetUnfolderBase]: For 1514/1514 co-relation queries the response was YES. [2023-08-26 18:22:47,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12982 conditions, 4719 events. 2959/4719 cut-off events. For 1514/1514 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 28806 event pairs, 2245 based on Foata normal form. 1422/5780 useless extension candidates. Maximal degree in co-relation 12977. Up to 4318 conditions per place. [2023-08-26 18:22:47,964 INFO L140 encePairwiseOnDemand]: 319/330 looper letters, 37 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 18:22:47,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 228 flow [2023-08-26 18:22:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 18:22:47,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3606060606060606 [2023-08-26 18:22:47,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 18:22:47,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 18:22:47,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:47,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 18:22:47,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:47,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:47,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:47,969 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 172 flow. Second operand 3 states and 357 transitions. [2023-08-26 18:22:47,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 228 flow [2023-08-26 18:22:47,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:47,977 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 136 flow [2023-08-26 18:22:47,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 18:22:47,977 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -43 predicate places. [2023-08-26 18:22:47,977 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 136 flow [2023-08-26 18:22:47,978 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 18:22:47,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:47,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:47,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:22:47,978 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:47,978 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1041365642, now seen corresponding path program 1 times [2023-08-26 18:22:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780419294] [2023-08-26 18:22:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780419294] [2023-08-26 18:22:48,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780419294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:48,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:48,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:22:48,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606306475] [2023-08-26 18:22:48,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:48,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:22:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:22:48,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:22:48,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 330 [2023-08-26 18:22:48,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:48,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:48,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 330 [2023-08-26 18:22:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:49,144 INFO L124 PetriNetUnfolderBase]: 2756/4530 cut-off events. [2023-08-26 18:22:49,145 INFO L125 PetriNetUnfolderBase]: For 771/807 co-relation queries the response was YES. [2023-08-26 18:22:49,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11395 conditions, 4530 events. 2756/4530 cut-off events. For 771/807 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 29325 event pairs, 1022 based on Foata normal form. 0/3660 useless extension candidates. Maximal degree in co-relation 11390. Up to 3723 conditions per place. [2023-08-26 18:22:49,159 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 55 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-26 18:22:49,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 332 flow [2023-08-26 18:22:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:49,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:22:49,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42323232323232324 [2023-08-26 18:22:49,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:22:49,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:22:49,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:49,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:22:49,162 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 18:22:49,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:49,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:49,163 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 136 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:22:49,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 332 flow [2023-08-26 18:22:49,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:22:49,165 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 169 flow [2023-08-26 18:22:49,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2023-08-26 18:22:49,165 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -41 predicate places. [2023-08-26 18:22:49,165 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 44 transitions, 169 flow [2023-08-26 18:22:49,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:49,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:49,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:49,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:22:49,166 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:49,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:49,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2077404718, now seen corresponding path program 1 times [2023-08-26 18:22:49,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:49,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922956956] [2023-08-26 18:22:49,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:49,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:49,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922956956] [2023-08-26 18:22:49,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922956956] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:49,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:49,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:22:49,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951089848] [2023-08-26 18:22:49,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:49,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:22:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:49,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:22:49,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:22:49,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 330 [2023-08-26 18:22:49,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 44 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:49,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:49,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 330 [2023-08-26 18:22:49,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:50,410 INFO L124 PetriNetUnfolderBase]: 2725/4452 cut-off events. [2023-08-26 18:22:50,410 INFO L125 PetriNetUnfolderBase]: For 1474/1502 co-relation queries the response was YES. [2023-08-26 18:22:50,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12135 conditions, 4452 events. 2725/4452 cut-off events. For 1474/1502 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 28888 event pairs, 691 based on Foata normal form. 8/3815 useless extension candidates. Maximal degree in co-relation 12129. Up to 3364 conditions per place. [2023-08-26 18:22:50,424 INFO L140 encePairwiseOnDemand]: 327/330 looper letters, 56 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2023-08-26 18:22:50,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 65 transitions, 357 flow [2023-08-26 18:22:50,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:50,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:50,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-26 18:22:50,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42323232323232324 [2023-08-26 18:22:50,426 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-26 18:22:50,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-26 18:22:50,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:50,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-26 18:22:50,427 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 18:22:50,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:50,429 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:50,429 INFO L175 Difference]: Start difference. First operand has 48 places, 44 transitions, 169 flow. Second operand 3 states and 419 transitions. [2023-08-26 18:22:50,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 65 transitions, 357 flow [2023-08-26 18:22:50,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 65 transitions, 353 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:22:50,431 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 176 flow [2023-08-26 18:22:50,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:22:50,431 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -39 predicate places. [2023-08-26 18:22:50,431 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 176 flow [2023-08-26 18:22:50,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:50,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:50,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:50,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:22:50,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:50,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:50,432 INFO L85 PathProgramCache]: Analyzing trace with hash 344572663, now seen corresponding path program 1 times [2023-08-26 18:22:50,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064188577] [2023-08-26 18:22:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:50,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064188577] [2023-08-26 18:22:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064188577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151802080] [2023-08-26 18:22:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:50,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:22:50,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:22:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:22:50,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 330 [2023-08-26 18:22:50,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 176 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:50,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:50,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 330 [2023-08-26 18:22:50,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:51,289 INFO L124 PetriNetUnfolderBase]: 2985/4763 cut-off events. [2023-08-26 18:22:51,289 INFO L125 PetriNetUnfolderBase]: For 1767/1767 co-relation queries the response was YES. [2023-08-26 18:22:51,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13739 conditions, 4763 events. 2985/4763 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 29424 event pairs, 1456 based on Foata normal form. 0/4207 useless extension candidates. Maximal degree in co-relation 13732. Up to 2948 conditions per place. [2023-08-26 18:22:51,305 INFO L140 encePairwiseOnDemand]: 328/330 looper letters, 71 selfloop transitions, 4 changer transitions 0/76 dead transitions. [2023-08-26 18:22:51,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 76 transitions, 438 flow [2023-08-26 18:22:51,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:51,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-08-26 18:22:51,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36464646464646466 [2023-08-26 18:22:51,310 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-08-26 18:22:51,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-08-26 18:22:51,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:51,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-08-26 18:22:51,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:51,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:51,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:51,315 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 176 flow. Second operand 3 states and 361 transitions. [2023-08-26 18:22:51,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 76 transitions, 438 flow [2023-08-26 18:22:51,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:51,319 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 184 flow [2023-08-26 18:22:51,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-08-26 18:22:51,321 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -38 predicate places. [2023-08-26 18:22:51,324 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 184 flow [2023-08-26 18:22:51,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:51,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:51,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:51,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:22:51,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:51,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:51,325 INFO L85 PathProgramCache]: Analyzing trace with hash -2077404974, now seen corresponding path program 1 times [2023-08-26 18:22:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150397729] [2023-08-26 18:22:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:51,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:51,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:51,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:51,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150397729] [2023-08-26 18:22:51,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150397729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:51,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:51,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:22:51,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757272227] [2023-08-26 18:22:51,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:51,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:22:51,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:51,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:22:51,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:22:51,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 330 [2023-08-26 18:22:51,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 184 flow. Second operand has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:51,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:51,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 330 [2023-08-26 18:22:51,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:52,565 INFO L124 PetriNetUnfolderBase]: 4156/6760 cut-off events. [2023-08-26 18:22:52,565 INFO L125 PetriNetUnfolderBase]: For 4160/4160 co-relation queries the response was YES. [2023-08-26 18:22:52,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 6760 events. 4156/6760 cut-off events. For 4160/4160 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 46186 event pairs, 1973 based on Foata normal form. 40/5990 useless extension candidates. Maximal degree in co-relation 18794. Up to 3534 conditions per place. [2023-08-26 18:22:52,592 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 65 selfloop transitions, 7 changer transitions 0/75 dead transitions. [2023-08-26 18:22:52,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 435 flow [2023-08-26 18:22:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:22:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:22:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2023-08-26 18:22:52,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35984848484848486 [2023-08-26 18:22:52,594 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2023-08-26 18:22:52,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2023-08-26 18:22:52,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:52,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2023-08-26 18:22:52,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:52,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:52,597 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:52,597 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 184 flow. Second operand 4 states and 475 transitions. [2023-08-26 18:22:52,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 435 flow [2023-08-26 18:22:52,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:22:52,601 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 210 flow [2023-08-26 18:22:52,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-08-26 18:22:52,602 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -35 predicate places. [2023-08-26 18:22:52,602 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 210 flow [2023-08-26 18:22:52,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:52,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:52,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:52,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:22:52,602 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:52,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2022283376, now seen corresponding path program 2 times [2023-08-26 18:22:52,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:52,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284921084] [2023-08-26 18:22:52,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:52,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284921084] [2023-08-26 18:22:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284921084] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36218960] [2023-08-26 18:22:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:52,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:22:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:22:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:22:52,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 330 [2023-08-26 18:22:52,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:52,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:52,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 330 [2023-08-26 18:22:52,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:53,608 INFO L124 PetriNetUnfolderBase]: 4074/6638 cut-off events. [2023-08-26 18:22:53,608 INFO L125 PetriNetUnfolderBase]: For 5916/5916 co-relation queries the response was YES. [2023-08-26 18:22:53,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18946 conditions, 6638 events. 4074/6638 cut-off events. For 5916/5916 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 45331 event pairs, 2382 based on Foata normal form. 40/5867 useless extension candidates. Maximal degree in co-relation 18937. Up to 4509 conditions per place. [2023-08-26 18:22:53,629 INFO L140 encePairwiseOnDemand]: 327/330 looper letters, 66 selfloop transitions, 5 changer transitions 0/74 dead transitions. [2023-08-26 18:22:53,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 452 flow [2023-08-26 18:22:53,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:22:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:22:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-26 18:22:53,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35909090909090907 [2023-08-26 18:22:53,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-26 18:22:53,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-26 18:22:53,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:53,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-26 18:22:53,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:53,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:53,635 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:53,635 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 210 flow. Second operand 4 states and 474 transitions. [2023-08-26 18:22:53,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 452 flow [2023-08-26 18:22:53,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 444 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:53,638 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 218 flow [2023-08-26 18:22:53,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-26 18:22:53,638 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -33 predicate places. [2023-08-26 18:22:53,638 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 218 flow [2023-08-26 18:22:53,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:53,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:53,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:53,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:22:53,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:53,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2134889723, now seen corresponding path program 1 times [2023-08-26 18:22:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392554875] [2023-08-26 18:22:53,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:53,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:53,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:53,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392554875] [2023-08-26 18:22:53,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392554875] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:53,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:53,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:53,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576583752] [2023-08-26 18:22:53,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:53,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:22:53,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:53,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:22:53,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:22:53,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 330 [2023-08-26 18:22:53,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:53,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:53,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 330 [2023-08-26 18:22:53,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:54,915 INFO L124 PetriNetUnfolderBase]: 6094/9390 cut-off events. [2023-08-26 18:22:54,915 INFO L125 PetriNetUnfolderBase]: For 8148/8148 co-relation queries the response was YES. [2023-08-26 18:22:54,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27094 conditions, 9390 events. 6094/9390 cut-off events. For 8148/8148 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 57863 event pairs, 3696 based on Foata normal form. 16/8326 useless extension candidates. Maximal degree in co-relation 27084. Up to 7723 conditions per place. [2023-08-26 18:22:54,946 INFO L140 encePairwiseOnDemand]: 327/330 looper letters, 70 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2023-08-26 18:22:54,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 470 flow [2023-08-26 18:22:54,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:54,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-26 18:22:54,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-08-26 18:22:54,947 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-26 18:22:54,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-26 18:22:54,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:54,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-26 18:22:54,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:54,950 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:54,950 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:54,950 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 218 flow. Second operand 3 states and 360 transitions. [2023-08-26 18:22:54,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 75 transitions, 470 flow [2023-08-26 18:22:54,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 75 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:54,955 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 229 flow [2023-08-26 18:22:54,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=229, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2023-08-26 18:22:54,955 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2023-08-26 18:22:54,955 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 229 flow [2023-08-26 18:22:54,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:54,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:54,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:54,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:22:54,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:54,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash -2134889979, now seen corresponding path program 1 times [2023-08-26 18:22:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:54,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69879677] [2023-08-26 18:22:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:55,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:55,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69879677] [2023-08-26 18:22:55,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69879677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:22:55,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165708194] [2023-08-26 18:22:55,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:55,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:22:55,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:55,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:22:55,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:22:55,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 330 [2023-08-26 18:22:55,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 229 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:55,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:55,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 330 [2023-08-26 18:22:55,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:55,733 INFO L124 PetriNetUnfolderBase]: 3692/6091 cut-off events. [2023-08-26 18:22:55,733 INFO L125 PetriNetUnfolderBase]: For 7875/7922 co-relation queries the response was YES. [2023-08-26 18:22:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18265 conditions, 6091 events. 3692/6091 cut-off events. For 7875/7922 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 41854 event pairs, 2160 based on Foata normal form. 30/5257 useless extension candidates. Maximal degree in co-relation 18254. Up to 3881 conditions per place. [2023-08-26 18:22:55,755 INFO L140 encePairwiseOnDemand]: 326/330 looper letters, 57 selfloop transitions, 5 changer transitions 0/68 dead transitions. [2023-08-26 18:22:55,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 421 flow [2023-08-26 18:22:55,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:22:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:22:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-26 18:22:55,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42828282828282827 [2023-08-26 18:22:55,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-26 18:22:55,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-26 18:22:55,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:55,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-26 18:22:55,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:55,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:55,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:55,759 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 229 flow. Second operand 3 states and 424 transitions. [2023-08-26 18:22:55,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 421 flow [2023-08-26 18:22:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 403 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:22:55,767 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 207 flow [2023-08-26 18:22:55,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-08-26 18:22:55,768 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -36 predicate places. [2023-08-26 18:22:55,768 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 207 flow [2023-08-26 18:22:55,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:55,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:55,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:55,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:22:55,768 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:55,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash 24962085, now seen corresponding path program 1 times [2023-08-26 18:22:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:55,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253510208] [2023-08-26 18:22:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:55,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:56,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253510208] [2023-08-26 18:22:56,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253510208] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:56,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:56,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909966013] [2023-08-26 18:22:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:22:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:22:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:22:56,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 330 [2023-08-26 18:22:56,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:56,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:56,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 330 [2023-08-26 18:22:56,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:57,574 INFO L124 PetriNetUnfolderBase]: 6909/11156 cut-off events. [2023-08-26 18:22:57,574 INFO L125 PetriNetUnfolderBase]: For 6175/6394 co-relation queries the response was YES. [2023-08-26 18:22:57,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31288 conditions, 11156 events. 6909/11156 cut-off events. For 6175/6394 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 82106 event pairs, 1666 based on Foata normal form. 123/9554 useless extension candidates. Maximal degree in co-relation 31279. Up to 4076 conditions per place. [2023-08-26 18:22:57,609 INFO L140 encePairwiseOnDemand]: 326/330 looper letters, 87 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2023-08-26 18:22:57,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 564 flow [2023-08-26 18:22:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:22:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:22:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 548 transitions. [2023-08-26 18:22:57,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41515151515151516 [2023-08-26 18:22:57,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 548 transitions. [2023-08-26 18:22:57,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 548 transitions. [2023-08-26 18:22:57,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:57,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 548 transitions. [2023-08-26 18:22:57,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:57,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:57,614 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:57,614 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 207 flow. Second operand 4 states and 548 transitions. [2023-08-26 18:22:57,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 564 flow [2023-08-26 18:22:57,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:22:57,618 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 218 flow [2023-08-26 18:22:57,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-08-26 18:22:57,618 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -33 predicate places. [2023-08-26 18:22:57,619 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 218 flow [2023-08-26 18:22:57,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:57,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:57,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:57,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:22:57,619 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:57,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:57,619 INFO L85 PathProgramCache]: Analyzing trace with hash 24989551, now seen corresponding path program 1 times [2023-08-26 18:22:57,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:57,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748605442] [2023-08-26 18:22:57,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:57,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:57,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:57,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:57,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748605442] [2023-08-26 18:22:57,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748605442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:57,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:57,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:22:57,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807620571] [2023-08-26 18:22:57,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:57,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:22:57,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:57,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:22:57,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:22:57,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 330 [2023-08-26 18:22:57,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 218 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 18:22:57,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:57,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 330 [2023-08-26 18:22:57,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:22:58,569 INFO L124 PetriNetUnfolderBase]: 5200/8281 cut-off events. [2023-08-26 18:22:58,569 INFO L125 PetriNetUnfolderBase]: For 3976/4008 co-relation queries the response was YES. [2023-08-26 18:22:58,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24727 conditions, 8281 events. 5200/8281 cut-off events. For 3976/4008 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 54500 event pairs, 2083 based on Foata normal form. 52/7456 useless extension candidates. Maximal degree in co-relation 24716. Up to 3061 conditions per place. [2023-08-26 18:22:58,601 INFO L140 encePairwiseOnDemand]: 314/330 looper letters, 57 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2023-08-26 18:22:58,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 482 flow [2023-08-26 18:22:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:22:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:22:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2023-08-26 18:22:58,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34015151515151515 [2023-08-26 18:22:58,602 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2023-08-26 18:22:58,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2023-08-26 18:22:58,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:22:58,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2023-08-26 18:22:58,604 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 18:22:58,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:58,605 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:58,605 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 218 flow. Second operand 4 states and 449 transitions. [2023-08-26 18:22:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 482 flow [2023-08-26 18:22:58,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 69 transitions, 459 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 18:22:58,609 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 309 flow [2023-08-26 18:22:58,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 18:22:58,609 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -31 predicate places. [2023-08-26 18:22:58,609 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 309 flow [2023-08-26 18:22:58,610 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 18:22:58,610 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:22:58,610 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:22:58,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 18:22:58,610 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:22:58,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:22:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 100658922, now seen corresponding path program 1 times [2023-08-26 18:22:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:22:58,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126014132] [2023-08-26 18:22:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:22:58,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:22:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:22:59,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:22:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:22:59,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126014132] [2023-08-26 18:22:59,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126014132] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:22:59,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:22:59,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 18:22:59,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128959218] [2023-08-26 18:22:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:22:59,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 18:22:59,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:22:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 18:22:59,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-26 18:22:59,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 330 [2023-08-26 18:22:59,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 309 flow. Second operand has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:22:59,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:22:59,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 330 [2023-08-26 18:22:59,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:01,156 INFO L124 PetriNetUnfolderBase]: 5306/8438 cut-off events. [2023-08-26 18:23:01,157 INFO L125 PetriNetUnfolderBase]: For 6860/6892 co-relation queries the response was YES. [2023-08-26 18:23:01,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28685 conditions, 8438 events. 5306/8438 cut-off events. For 6860/6892 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 56288 event pairs, 1581 based on Foata normal form. 36/8182 useless extension candidates. Maximal degree in co-relation 28674. Up to 7885 conditions per place. [2023-08-26 18:23:01,188 INFO L140 encePairwiseOnDemand]: 320/330 looper letters, 89 selfloop transitions, 34 changer transitions 0/124 dead transitions. [2023-08-26 18:23:01,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 124 transitions, 999 flow [2023-08-26 18:23:01,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:23:01,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:23:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 881 transitions. [2023-08-26 18:23:01,190 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29663299663299664 [2023-08-26 18:23:01,190 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 881 transitions. [2023-08-26 18:23:01,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 881 transitions. [2023-08-26 18:23:01,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:01,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 881 transitions. [2023-08-26 18:23:01,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.88888888888889) internal successors, (881), 9 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:01,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:01,194 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 330.0) internal successors, (3300), 10 states have internal predecessors, (3300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:01,195 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 309 flow. Second operand 9 states and 881 transitions. [2023-08-26 18:23:01,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 124 transitions, 999 flow [2023-08-26 18:23:01,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 124 transitions, 993 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:01,230 INFO L231 Difference]: Finished difference. Result has 70 places, 82 transitions, 663 flow [2023-08-26 18:23:01,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=663, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2023-08-26 18:23:01,231 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -19 predicate places. [2023-08-26 18:23:01,231 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 82 transitions, 663 flow [2023-08-26 18:23:01,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 90.44444444444444) internal successors, (814), 9 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:01,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:01,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:01,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 18:23:01,232 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:01,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 774674054, now seen corresponding path program 1 times [2023-08-26 18:23:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:01,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380849609] [2023-08-26 18:23:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:01,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:01,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:01,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380849609] [2023-08-26 18:23:01,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380849609] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:01,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:01,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 18:23:01,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864474733] [2023-08-26 18:23:01,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:01,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:23:01,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:01,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:23:01,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:23:01,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 330 [2023-08-26 18:23:01,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 82 transitions, 663 flow. Second operand has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:01,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:01,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 330 [2023-08-26 18:23:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:02,351 INFO L124 PetriNetUnfolderBase]: 4082/6608 cut-off events. [2023-08-26 18:23:02,351 INFO L125 PetriNetUnfolderBase]: For 7751/7775 co-relation queries the response was YES. [2023-08-26 18:23:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24140 conditions, 6608 events. 4082/6608 cut-off events. For 7751/7775 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 42761 event pairs, 728 based on Foata normal form. 208/6669 useless extension candidates. Maximal degree in co-relation 24123. Up to 2189 conditions per place. [2023-08-26 18:23:02,370 INFO L140 encePairwiseOnDemand]: 313/330 looper letters, 109 selfloop transitions, 25 changer transitions 1/136 dead transitions. [2023-08-26 18:23:02,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 1258 flow [2023-08-26 18:23:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:23:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:23:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 737 transitions. [2023-08-26 18:23:02,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.319047619047619 [2023-08-26 18:23:02,373 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 737 transitions. [2023-08-26 18:23:02,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 737 transitions. [2023-08-26 18:23:02,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:02,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 737 transitions. [2023-08-26 18:23:02,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:02,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:02,376 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 330.0) internal successors, (2640), 8 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:02,376 INFO L175 Difference]: Start difference. First operand has 70 places, 82 transitions, 663 flow. Second operand 7 states and 737 transitions. [2023-08-26 18:23:02,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 1258 flow [2023-08-26 18:23:02,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 136 transitions, 1245 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-26 18:23:02,409 INFO L231 Difference]: Finished difference. Result has 78 places, 94 transitions, 880 flow [2023-08-26 18:23:02,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=880, PETRI_PLACES=78, PETRI_TRANSITIONS=94} [2023-08-26 18:23:02,410 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -11 predicate places. [2023-08-26 18:23:02,410 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 94 transitions, 880 flow [2023-08-26 18:23:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.75) internal successors, (766), 8 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:02,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:02,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 18:23:02,410 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:02,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:02,410 INFO L85 PathProgramCache]: Analyzing trace with hash -180633049, now seen corresponding path program 1 times [2023-08-26 18:23:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727108109] [2023-08-26 18:23:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:03,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727108109] [2023-08-26 18:23:03,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727108109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:03,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:03,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:03,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360444041] [2023-08-26 18:23:03,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:03,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:03,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:03,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:03,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:03,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 330 [2023-08-26 18:23:03,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 94 transitions, 880 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:03,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:03,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 330 [2023-08-26 18:23:03,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:04,058 INFO L124 PetriNetUnfolderBase]: 4673/7685 cut-off events. [2023-08-26 18:23:04,058 INFO L125 PetriNetUnfolderBase]: For 14244/14290 co-relation queries the response was YES. [2023-08-26 18:23:04,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30878 conditions, 7685 events. 4673/7685 cut-off events. For 14244/14290 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 52071 event pairs, 1878 based on Foata normal form. 62/7520 useless extension candidates. Maximal degree in co-relation 30858. Up to 5504 conditions per place. [2023-08-26 18:23:04,095 INFO L140 encePairwiseOnDemand]: 320/330 looper letters, 127 selfloop transitions, 43 changer transitions 0/173 dead transitions. [2023-08-26 18:23:04,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 173 transitions, 1814 flow [2023-08-26 18:23:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 618 transitions. [2023-08-26 18:23:04,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37454545454545457 [2023-08-26 18:23:04,097 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 618 transitions. [2023-08-26 18:23:04,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 618 transitions. [2023-08-26 18:23:04,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:04,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 618 transitions. [2023-08-26 18:23:04,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:04,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:04,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:04,100 INFO L175 Difference]: Start difference. First operand has 78 places, 94 transitions, 880 flow. Second operand 5 states and 618 transitions. [2023-08-26 18:23:04,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 173 transitions, 1814 flow [2023-08-26 18:23:04,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 173 transitions, 1786 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:04,200 INFO L231 Difference]: Finished difference. Result has 82 places, 118 transitions, 1255 flow [2023-08-26 18:23:04,200 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1255, PETRI_PLACES=82, PETRI_TRANSITIONS=118} [2023-08-26 18:23:04,201 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2023-08-26 18:23:04,201 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 118 transitions, 1255 flow [2023-08-26 18:23:04,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:04,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:04,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:04,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 18:23:04,201 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:04,202 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:04,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1598721269, now seen corresponding path program 2 times [2023-08-26 18:23:04,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:04,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953117054] [2023-08-26 18:23:04,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:04,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:05,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:05,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953117054] [2023-08-26 18:23:05,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953117054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:05,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:05,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:23:05,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350428326] [2023-08-26 18:23:05,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:05,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:23:05,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:05,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:23:05,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:23:05,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 330 [2023-08-26 18:23:05,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 118 transitions, 1255 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:05,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:05,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 330 [2023-08-26 18:23:05,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:06,511 INFO L124 PetriNetUnfolderBase]: 6273/10493 cut-off events. [2023-08-26 18:23:06,511 INFO L125 PetriNetUnfolderBase]: For 26402/26456 co-relation queries the response was YES. [2023-08-26 18:23:06,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45272 conditions, 10493 events. 6273/10493 cut-off events. For 26402/26456 co-relation queries the response was YES. Maximal size of possible extension queue 732. Compared 77647 event pairs, 1672 based on Foata normal form. 102/10272 useless extension candidates. Maximal degree in co-relation 45249. Up to 5122 conditions per place. [2023-08-26 18:23:06,564 INFO L140 encePairwiseOnDemand]: 320/330 looper letters, 151 selfloop transitions, 48 changer transitions 0/202 dead transitions. [2023-08-26 18:23:06,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 202 transitions, 2309 flow [2023-08-26 18:23:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:23:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:23:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 746 transitions. [2023-08-26 18:23:06,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37676767676767675 [2023-08-26 18:23:06,568 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 746 transitions. [2023-08-26 18:23:06,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 746 transitions. [2023-08-26 18:23:06,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:06,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 746 transitions. [2023-08-26 18:23:06,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:06,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:06,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 330.0) internal successors, (2310), 7 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:06,571 INFO L175 Difference]: Start difference. First operand has 82 places, 118 transitions, 1255 flow. Second operand 6 states and 746 transitions. [2023-08-26 18:23:06,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 202 transitions, 2309 flow [2023-08-26 18:23:06,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 202 transitions, 2291 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:06,780 INFO L231 Difference]: Finished difference. Result has 86 places, 123 transitions, 1411 flow [2023-08-26 18:23:06,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1237, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=86, PETRI_TRANSITIONS=123} [2023-08-26 18:23:06,781 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -3 predicate places. [2023-08-26 18:23:06,781 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 123 transitions, 1411 flow [2023-08-26 18:23:06,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:06,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:06,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:06,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 18:23:06,781 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:06,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash 261654276, now seen corresponding path program 1 times [2023-08-26 18:23:06,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:06,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337941840] [2023-08-26 18:23:06,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:06,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:06,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337941840] [2023-08-26 18:23:06,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337941840] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:06,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:06,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:23:06,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407704692] [2023-08-26 18:23:06,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:06,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:23:06,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:06,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:23:06,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:23:06,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 330 [2023-08-26 18:23:06,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 123 transitions, 1411 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 18:23:06,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:06,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 330 [2023-08-26 18:23:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:07,743 INFO L124 PetriNetUnfolderBase]: 3067/5737 cut-off events. [2023-08-26 18:23:07,743 INFO L125 PetriNetUnfolderBase]: For 18182/18329 co-relation queries the response was YES. [2023-08-26 18:23:07,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25938 conditions, 5737 events. 3067/5737 cut-off events. For 18182/18329 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 43430 event pairs, 644 based on Foata normal form. 135/5691 useless extension candidates. Maximal degree in co-relation 25914. Up to 4960 conditions per place. [2023-08-26 18:23:07,768 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 106 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-26 18:23:07,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 129 transitions, 1536 flow [2023-08-26 18:23:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:23:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:23:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-26 18:23:07,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4070707070707071 [2023-08-26 18:23:07,769 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-26 18:23:07,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-26 18:23:07,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:07,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-26 18:23:07,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:07,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:07,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 330.0) internal successors, (1320), 4 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:07,772 INFO L175 Difference]: Start difference. First operand has 86 places, 123 transitions, 1411 flow. Second operand 3 states and 403 transitions. [2023-08-26 18:23:07,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 129 transitions, 1536 flow [2023-08-26 18:23:07,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 129 transitions, 1423 flow, removed 14 selfloop flow, removed 6 redundant places. [2023-08-26 18:23:07,836 INFO L231 Difference]: Finished difference. Result has 81 places, 105 transitions, 1040 flow [2023-08-26 18:23:07,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1040, PETRI_PLACES=81, PETRI_TRANSITIONS=105} [2023-08-26 18:23:07,837 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2023-08-26 18:23:07,837 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 105 transitions, 1040 flow [2023-08-26 18:23:07,837 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 18:23:07,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:07,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:07,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 18:23:07,838 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:07,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:07,838 INFO L85 PathProgramCache]: Analyzing trace with hash -2108426788, now seen corresponding path program 1 times [2023-08-26 18:23:07,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:07,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428250672] [2023-08-26 18:23:07,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:07,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:07,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428250672] [2023-08-26 18:23:07,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428250672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:07,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:07,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:23:07,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297323477] [2023-08-26 18:23:07,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:23:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:07,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:23:07,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:23:07,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 330 [2023-08-26 18:23:07,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 105 transitions, 1040 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 18:23:07,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:07,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 330 [2023-08-26 18:23:07,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:08,343 INFO L124 PetriNetUnfolderBase]: 845/1847 cut-off events. [2023-08-26 18:23:08,343 INFO L125 PetriNetUnfolderBase]: For 4650/4725 co-relation queries the response was YES. [2023-08-26 18:23:08,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8337 conditions, 1847 events. 845/1847 cut-off events. For 4650/4725 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 12448 event pairs, 94 based on Foata normal form. 141/1957 useless extension candidates. Maximal degree in co-relation 8314. Up to 1047 conditions per place. [2023-08-26 18:23:08,350 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 85 selfloop transitions, 7 changer transitions 16/120 dead transitions. [2023-08-26 18:23:08,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 120 transitions, 1255 flow [2023-08-26 18:23:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:23:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:23:08,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-26 18:23:08,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40454545454545454 [2023-08-26 18:23:08,351 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-26 18:23:08,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-26 18:23:08,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:08,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-26 18:23:08,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,354 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 330.0) internal successors, (1650), 5 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,354 INFO L175 Difference]: Start difference. First operand has 81 places, 105 transitions, 1040 flow. Second operand 4 states and 534 transitions. [2023-08-26 18:23:08,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 120 transitions, 1255 flow [2023-08-26 18:23:08,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 120 transitions, 1219 flow, removed 12 selfloop flow, removed 2 redundant places. [2023-08-26 18:23:08,365 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 563 flow [2023-08-26 18:23:08,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=563, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-08-26 18:23:08,366 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -8 predicate places. [2023-08-26 18:23:08,366 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 563 flow [2023-08-26 18:23:08,366 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 18:23:08,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:08,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:08,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 18:23:08,366 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:08,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:08,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1709044523, now seen corresponding path program 1 times [2023-08-26 18:23:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182067938] [2023-08-26 18:23:08,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:23:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:23:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:23:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182067938] [2023-08-26 18:23:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182067938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:23:08,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:23:08,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:23:08,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775522144] [2023-08-26 18:23:08,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:23:08,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:23:08,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:23:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:23:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:23:08,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 330 [2023-08-26 18:23:08,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 563 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 18:23:08,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:23:08,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 330 [2023-08-26 18:23:08,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:23:08,736 INFO L124 PetriNetUnfolderBase]: 475/953 cut-off events. [2023-08-26 18:23:08,736 INFO L125 PetriNetUnfolderBase]: For 2891/2956 co-relation queries the response was YES. [2023-08-26 18:23:08,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4481 conditions, 953 events. 475/953 cut-off events. For 2891/2956 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5422 event pairs, 52 based on Foata normal form. 79/1021 useless extension candidates. Maximal degree in co-relation 4458. Up to 414 conditions per place. [2023-08-26 18:23:08,739 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 50 selfloop transitions, 10 changer transitions 23/86 dead transitions. [2023-08-26 18:23:08,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 86 transitions, 809 flow [2023-08-26 18:23:08,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:23:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:23:08,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-26 18:23:08,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3927272727272727 [2023-08-26 18:23:08,741 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-26 18:23:08,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-26 18:23:08,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:23:08,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-26 18:23:08,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 330.0) internal successors, (1980), 6 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 18:23:08,744 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 563 flow. Second operand 5 states and 648 transitions. [2023-08-26 18:23:08,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 86 transitions, 809 flow [2023-08-26 18:23:08,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 86 transitions, 707 flow, removed 20 selfloop flow, removed 15 redundant places. [2023-08-26 18:23:08,748 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 257 flow [2023-08-26 18:23:08,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=257, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2023-08-26 18:23:08,748 INFO L281 CegarLoopForPetriNet]: 89 programPoint places, -26 predicate places. [2023-08-26 18:23:08,748 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 257 flow [2023-08-26 18:23:08,748 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 18:23:08,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:23:08,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:08,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-26 18:23:08,749 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONASSERT === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 81 more)] === [2023-08-26 18:23:08,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:23:08,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1278529436, now seen corresponding path program 1 times [2023-08-26 18:23:08,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:23:08,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970359051] [2023-08-26 18:23:08,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:23:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:23:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:08,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:23:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:23:08,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:23:08,937 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:23:08,937 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONASSERT (83 of 84 remaining) [2023-08-26 18:23:08,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 84 remaining) [2023-08-26 18:23:08,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 84 remaining) [2023-08-26 18:23:08,939 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 84 remaining) [2023-08-26 18:23:08,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 84 remaining) [2023-08-26 18:23:08,943 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 84 remaining) [2023-08-26 18:23:08,944 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 84 remaining) [2023-08-26 18:23:08,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 84 remaining) [2023-08-26 18:23:08,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 84 remaining) [2023-08-26 18:23:08,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 84 remaining) [2023-08-26 18:23:08,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-26 18:23:08,948 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:23:08,953 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:23:08,953 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:23:09,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:23:09 BasicIcfg [2023-08-26 18:23:09,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:23:09,016 INFO L158 Benchmark]: Toolchain (without parser) took 47665.19ms. Allocated memory was 362.8MB in the beginning and 4.2GB in the end (delta: 3.8GB). Free memory was 337.7MB in the beginning and 3.3GB in the end (delta: -3.0GB). Peak memory consumption was 859.0MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,016 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 362.8MB. Free memory was 338.9MB in the beginning and 338.9MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:23:09,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.42ms. Allocated memory is still 362.8MB. Free memory was 337.3MB in the beginning and 312.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.51ms. Allocated memory is still 362.8MB. Free memory was 312.2MB in the beginning and 309.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,018 INFO L158 Benchmark]: Boogie Preprocessor took 32.91ms. Allocated memory is still 362.8MB. Free memory was 309.6MB in the beginning and 307.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,018 INFO L158 Benchmark]: RCFGBuilder took 1071.34ms. Allocated memory was 362.8MB in the beginning and 448.8MB in the end (delta: 86.0MB). Free memory was 306.8MB in the beginning and 391.4MB in the end (delta: -84.6MB). Peak memory consumption was 86.3MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,018 INFO L158 Benchmark]: TraceAbstraction took 46030.33ms. Allocated memory was 448.8MB in the beginning and 4.2GB in the end (delta: 3.8GB). Free memory was 390.3MB in the beginning and 3.3GB in the end (delta: -2.9GB). Peak memory consumption was 825.2MB. Max. memory is 16.0GB. [2023-08-26 18:23:09,019 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.09ms. Allocated memory is still 362.8MB. Free memory was 338.9MB in the beginning and 338.9MB in the end (delta: 73.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 453.42ms. Allocated memory is still 362.8MB. Free memory was 337.3MB in the beginning and 312.2MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.51ms. Allocated memory is still 362.8MB. Free memory was 312.2MB in the beginning and 309.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.91ms. Allocated memory is still 362.8MB. Free memory was 309.6MB in the beginning and 307.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 1071.34ms. Allocated memory was 362.8MB in the beginning and 448.8MB in the end (delta: 86.0MB). Free memory was 306.8MB in the beginning and 391.4MB in the end (delta: -84.6MB). Peak memory consumption was 86.3MB. Max. memory is 16.0GB. * TraceAbstraction took 46030.33ms. Allocated memory was 448.8MB in the beginning and 4.2GB in the end (delta: 3.8GB). Free memory was 390.3MB in the beginning and 3.3GB in the end (delta: -2.9GB). Peak memory consumption was 825.2MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.3s, 183 PlacesBefore, 89 PlacesAfterwards, 176 TransitionsBefore, 81 TransitionsAfterwards, 7232 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 151 TotalNumberOfCompositions, 43519 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11522, independent: 10730, independent conditional: 0, independent unconditional: 10730, dependent: 792, dependent conditional: 0, dependent unconditional: 792, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2794, independent: 2688, independent conditional: 0, independent unconditional: 2688, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11522, independent: 8042, independent conditional: 0, independent unconditional: 8042, dependent: 686, dependent conditional: 0, dependent unconditional: 686, unknown: 2794, unknown conditional: 0, unknown unconditional: 2794] , Statistics on independence cache: Total cache size (in pairs): 508, Positive cache size: 455, Positive conditional cache size: 0, Positive unconditional cache size: 455, 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_p1_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; [L835] 0 pthread_t t1985; [L836] FCALL, FORK 0 pthread_create(&t1985, ((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_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1985, ((void *)0), P0, ((void *)0))=8, t1985={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L837] 0 pthread_t t1986; 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_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1985={7:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L838] FCALL, FORK 0 pthread_create(&t1986, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1986, ((void *)0), P1, ((void *)0))=9, t1985={7:0}, t1986={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L839] 0 pthread_t t1987; [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] EXPR 1 \read(y) [L764] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L764] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L765] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L766] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L767] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L768] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L769] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L770] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L771] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L772] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L773] EXPR 1 \read(y) [L773] 1 __unbuffered_p0_EAX = y [L774] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L774] 1 y = y$flush_delayed ? y$mem_tmp : y [L775] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L778] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L840] FCALL, FORK 0 pthread_create(&t1987, ((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_p1_EAX=1, 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(&t1987, ((void *)0), P2, ((void *)0))=10, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L793] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L810] 3 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_p1_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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 \read(y) [L796] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L797] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L798] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L799] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L800] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_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}] [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 \read(y) [L813] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_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_p1_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$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L803] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 2 return 0; [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L844] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L844] RET 0 assume_abort_if_not(main$tmp_guard0) [L846] 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) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] EXPR 0 \read(y) [L846] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L846] 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) [L846] 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) [L847] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L848] 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 [L849] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L850] 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_p1_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, t1985={7:0}, t1986={5:0}, t1987={6:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 y$flush_delayed = weak$$choice2 [L856] EXPR 0 \read(y) [L856] 0 y$mem_tmp = y [L857] 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) [L857] EXPR 0 \read(y) [L857] 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) [L857] 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) [L858] 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)) [L859] 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)) [L860] 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)) [L861] 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)) [L862] 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)) [L863] 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)) [L864] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L865] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L865] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L866] EXPR 0 \read(y) [L866] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L867] 0 y = y$flush_delayed ? y$mem_tmp : y [L868] 0 y$flush_delayed = (_Bool)0 [L870] 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", "safe009_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p1_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=1, 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: 836]: 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: 838]: 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: 840]: 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, 230 locations, 84 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: 45.8s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 740 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 740 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1694 IncrementalHoareTripleChecker+Invalid, 1839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 20 mSDtfsCounter, 1694 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1411occurred in iteration=16, InterpolantAutomatonStates: 78, 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.5s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 1557 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 18:23:09,040 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...